OSCR

Replicability of representational similarity and its role in successful memory retrieval.

Code ↔ Paper

1 match between paragraphs of the paper and lines of its authors' code, computed by the harvester (lexical-v1). Click a colored paragraph or line to see its counterpart.

The 1 match
  1. [1] § Methods › Procedure ↔ Custom Scripts/ManipulationCheckOnlyAnalysis.m, lines 91–121 · score 0.66 · correct answers, manipulation check, campfire, yes, skipping

Paper

Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC

The paper is loaded when this pane is shown.

The authors' code

MATLAB · 277 lines · 11 KB · no license · 1 match

  1. %% ERICA'S VERSION – Cleaned Full Script for Behavioral Data Analysis (Memory + Manipulation Check)
  2. % Define the subjects to process
  3. subjnames = {'62'};
  4. % Initialize output matrix
  5. nummatrix = [];
  6. % Define correct manipulation check answers
  7. correct_1 = {'aceofdiamond.png','apron.png','sponge01.png','tent.png','campfire.png','corn02.png' };
  8. %Correct YES
  9. correct_2 = {'barn.png','tree.png','africanelephant.png', 'fingerprint.png','puzzlepiece.png','feather03a.png'};
  10. %Correct NO
  11. % Main loop for each subject
  12. for i = 1:length(subjnames)
  13. name = subjnames{i};
  14. fprintf('\n📂 Starting Subject %s\n', name);
  15. % Change directory: ERICA'S COMPUTER
  16. %cd('E:\BehavioralTask_OtherRachelOneDriveStuff\cmd');
  17. %LAB COMPUTERS: update the lines below so that the script finds the data files on your
  18. %machine
  19. %Update the lines below so that the script finds the data files on your machine
  20. addpath('\\192.168.76.14\dianalab\DroboC\RSA_Replication_Study_drobo\RawBehavData');
  21. %RACHEL'S OFFICE: update the lines below so that the script finds the data files on your machine
  22. % Update the lines below so that the script finds the data files on your machine
  23. %addpath('\\128.173.168.149\dianalab\DroboC\RSA_Replication_Study_drobo\RawBehavData');
  24. %% ------------------------ LOAD STUDY LOGS AND IDENTIFY MANIPULATION CHECK ITEMS ------------------------
  25. study_files = { strcat(name,'-Run_1_study_3_2.log'), strcat(name,'-Run_2_study_3_2.log'), ...
  26. strcat(name,'-Run_3_study_3_2.log'), strcat(name,'-Run_4_study_3_2.log') };
  27. mc_trials = {}; % to store manipulation check trials
  28. for f = 1:length(study_files)
  29. fid = fopen(study_files{f});
  30. if fid == -1
  31. warning('❌ Could not open file: %s', study_files{f});
  32. continue;
  33. end
  34. data = textscan(fid, '%*d%d%s%s%*d%*d%*d%*d%*[^\n]', 'HeaderLines', 5, 'Delimiter', '\t');
  35. fclose(fid);
  36. trialnum = data{1};
  37. event = data{2};
  38. code = data{3};
  39. for j = 1:length(code)
  40. if contains(event{j}, 'Picture') && contains(code{j}, 'Study,') && ...
  41. ~contains(code{j}, 'Study_Response') && contains(code{j}, '.png')
  42. parts = strsplit(strtrim(code{j}), ',');
  43. if length(parts) >= 3
  44. [~, baseimg, ~] = fileparts(strtrim(parts{2}));
  45. img_name = [baseimg, '.png'];
  46. question = strtrim(parts{3});
  47. if any(strcmp(img_name, correct_1)) || any(strcmp(img_name, correct_2))
  48. cur_trial = trialnum(j);
  49. response = '0'; % default to skipped
  50. % Look ahead until the first Response event in a *new* trial AND it's 7/8/9
  51. for k = j+1:min(j+15, length(trialnum))
  52. if trialnum(k) ~= cur_trial && contains(event{k}, 'Response')
  53. resp_code = strtrim(code{k});
  54. if ismember(resp_code, {'7','8','9'})
  55. response = resp_code;
  56. break;
  57. end
  58. end
  59. end
  60. mc_trials = [mc_trials; {img_name, question, response}];
  61. fprintf('🧪 MC item: %-20s | Response: %s\n', img_name, response);
  62. end
  63. end
  64. end
  65. end
  66. end
  67. %% ------------------------ SCORE MC TRIALS ------------------------
  68. %% ------------------------ SCORE MANIPULATION CHECKS (EXTERNAL ONLY) ------------------------
  69. % Define correct answers
  70. could_not_carry = {'barn.png','tree.png','africanelephant.png'}; % NO
  71. could_carry = {'aceofdiamond.png','apron.png','sponge01.png'}; % YES
  72. not_useful = {'fingerprint.png','puzzlepiece.png','feather03a.png'}; % NO
  73. is_useful = {'tent.png','campfire.png','corn02.png'}; % YES
  74. % Create lookup map
  75. valid_items = [could_not_carry, could_carry, not_useful, is_useful];
  76. correct_answers_map = containers.Map;
  77. for img = could_not_carry, correct_answers_map(img{1}) = 'no'; end
  78. for img = could_carry, correct_answers_map(img{1}) = 'yes'; end
  79. for img = not_useful, correct_answers_map(img{1}) = 'no'; end
  80. for img = is_useful, correct_answers_map(img{1}) = 'yes'; end
  81. % Scoring variables
  82. unique_trials = containers.Map;
  83. maybe_count = 0;
  84. consistent_count = 0;
  85. correct_count = 0;
  86. skipped = 0;
  87. for r = 1:size(mc_trials,1)
  88. img = mc_trials{r,1};
  89. resp = strtrim(mc_trials{r,3});
  90. % Skip if not valid MC image
  91. if ~ismember(img, valid_items)
  92. continue;
  93. end
  94. %%% TEMPORARILY COUNT DUPLICATES
  95. % Skip duplicates
  96. % if isKey(unique_trials, img)
  97. % continue;
  98. % end
  99. %%%%%%%%%%%%%%%%%%%%%%%%%%
  100. % Check response validity
  101. if ~ismember(resp, {'7','8','9'})
  102. skipped = skipped + 1;
  103. continue;
  104. end
  105. % Map numeric response to text
  106. if strcmp(resp, '7')
  107. resp_val = 'yes';
  108. elseif strcmp(resp, '9')
  109. resp_val = 'no';
  110. elseif strcmp(resp, '8')
  111. maybe_count = maybe_count + 1;
  112. unique_trials(img) = 'maybe';
  113. continue; % 'maybe' is tracked but not scored
  114. end
  115. % Compare to correct
  116. correct_val = correct_answers_map(img);
  117. if strcmp(resp_val, correct_val)
  118. correct_count = correct_count + 1;
  119. end
  120. unique_trials(img) = resp_val;
  121. end
  122. % Final scoring
  123. incorrect = 16 - correct_count;
  124. fprintf('\n✅ External consistency: %d / 16\n', consistent_count);
  125. fprintf('❔ Maybe responses: %d\n', maybe_count);
  126. fprintf('🚫 Skipped responses: %d\n', skipped);
  127. fprintf('❌ Incorrect responses: %d\n', incorrect);
  128. %% ------------------------ SCORE MANIPULATION CHECKS (INTERNAL ONLY) ------------------------
  129. % Count internal inconsistencies
  130. imgnames = mc_trials(:,1);
  131. resps = mc_trials(:,3);
  132. unique_imgs = unique(imgnames);
  133. inconsistent = 0;
  134. for u = 1:length(unique_imgs)
  135. matches = strcmp(imgnames, unique_imgs{u});
  136. all_resps = unique(resps(matches));
  137. % Only consider valid responses
  138. all_resps = intersect(all_resps, {'7','8','9'});
  139. if length(all_resps) > 1
  140. inconsistent = inconsistent + 1;
  141. end
  142. end
  143. %% ------------------------ LOAD TEST SESSION ------------------------
  144. % testname = strcat(name, '-Test_scenario.log');
  145. % fid = fopen(testname);
  146. % data = textscan(fid, '%d%d%s%s%d%d%d%d%*[^\n]', 'HeaderLines', 5, 'Delimiter', '\t');
  147. % fclose(fid);
  148. %% ------------------------ LOAD TEST SESSION (with file existence check) ------------------------
  149. testname = strcat(name, '-Test_scenario.log');
  150. if exist(testname, 'file')
  151. fprintf('📄 Found test file: %s\n', testname);
  152. fid = fopen(testname);
  153. data = textscan(fid, '%d%d%s%s%d%d%d%d%*[^\n]', 'HeaderLines', 5, 'Delimiter', '\t');
  154. fclose(fid);
  155. trial = data{2};
  156. event = data{3};
  157. code = data{4};
  158. ttime = data{6};
  159. types = {}; pics = {}; conditions = {}; resps = {}; resp_ttimes = [];
  160. for j = 1:length(code)
  161. if contains(event{j}, 'Picture') && contains(code{j}, '.png')
  162. parts = strsplit(strtrim(code{j}), ',');
  163. if length(parts) >= 3
  164. types = [types; strtrim(parts{1})];
  165. pics = [pics; strtrim(parts{2})];
  166. conditions = [conditions; strtrim(parts{3})];
  167. end
  168. % Find the next response
  169. if j+1 <= length(event) && contains(event{j+1}, 'Response')
  170. resps = [resps; code(j+1)];
  171. resp_ttimes = [resp_ttimes; ttime(j+1)];
  172. elseif j+2 <= length(event) && contains(event{j+2}, 'Response')
  173. resps = [resps; code(j+2)];
  174. resp_ttimes = [resp_ttimes; ttime(j+2)];
  175. else
  176. resps = [resps; {'0'}];
  177. resp_ttimes = [resp_ttimes; NaN];
  178. end
  179. end
  180. end
  181. %% ------------------------ SCORE MEMORY RESPONSES ------------------------
  182. resps = cellfun(@num2str, resps, 'UniformOutput', false);
  183. unstudied = []; same = []; var = []; oldresp = []; newresp = [];
  184. for k = 1:length(pics)
  185. if contains(conditions{k}, 'new'), unstudied = [unstudied, k];
  186. elseif contains(conditions{k}, 'sameA') || contains(conditions{k}, 'sameB'), same = [same, k];
  187. elseif contains(conditions{k}, 'varAB') || contains(conditions{k}, 'varBA'), var = [var, k];
  188. end
  189. if strcmp(resps{k}, '1'), oldresp = [oldresp, k];
  190. elseif strcmp(resps{k}, '2'), newresp = [newresp, k];
  191. end
  192. end
  193. same_hit = intersect(same, oldresp);
  194. var_hit = intersect(var, oldresp);
  195. same_miss = intersect(same, newresp);
  196. var_miss = intersect(var, newresp);
  197. fa = intersect(unstudied, oldresp);
  198. prop_same_hit = length(same_hit) / length(same);
  199. prop_var_hit = length(var_hit) / length(var);
  200. prop_same_miss = length(same_miss) / length(same);
  201. prop_var_miss = length(var_miss) / length(var);
  202. prop_fa = length(fa) / length(unstudied);
  203. total_hits = length(same_hit) + length(var_hit);
  204. total_miss = length(same_miss) + length(var_miss);
  205. HR = min(max(total_hits / (length(same)+length(var)), 0.01), 0.99);
  206. FAR = min(max(length(fa) / length(unstudied), 0.01), 0.99);
  207. dprime = norminv(HR) - norminv(FAR);
  208. else
  209. fprintf('⚠️ Test file missing: %s — skipping memory scoring.\n', testname);
  210. % Set placeholder values
  211. same_hit = []; var_hit = []; same_miss = []; var_miss = []; fa = [];
  212. prop_same_hit = NaN; prop_var_hit = NaN; prop_same_miss = NaN;
  213. prop_var_miss = NaN; prop_fa = NaN; total_hits = NaN;
  214. dprime = NaN; total_miss = NaN;
  215. end
  216. %% ------------------------ STORE RESULTS ------------------------
  217. % Adjust incorrect count (optional, per your note)
  218. incorrect = incorrect - maybe_count;
  219. % nummatrixrow = [length(same_hit), length(var_hit), length(same_miss), length(var_miss), length(fa), ...
  220. % prop_same_hit, prop_var_hit, prop_same_miss, prop_var_miss, prop_fa, ...
  221. % total_hits, dprime, total_miss, skipped, inconsistent, maybe_count, incorrect];
  222. nummatrixrow = [skipped, inconsistent, maybe_count, incorrect];
  223. nummatrix = [nummatrix; nummatrixrow];
  224. end

ManipulationCheckOnlyAnalysis.m, no license · at the source

Overview

Authors: Ece Yuksel1, Erica S Shafer1, Madeline Netto1, Rachel A Diana1
  1. Department of Psychology, Virginia Tech, Blacksburg, VA, United States
Institutions: Virginia Tech (United States)
Journal: Imaging neuroscience (Cambridge, Mass.), volume 4, article IMAG.a.1214
Dates: received 18 March 2026; accepted 18 March 2026; published online 24 April 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1162/imag.a.1214 · PMID 42052507 · PMCID PMC13112209 · OpenAlex W7143441916
Open access: diamond, a free copy (OpenAlex)
Status: code verified
Categories: fMRI (modality), none (in silico) (organism), cognitive (subfield)
Methods: Statistics, Connectivity, fMRI & imaging, Machine learning
Keywords: fMRI, representational similarity analysis, episodic memory, hippocampus, context variability, encoding variability
Topic: Memory and Neural Mechanisms (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Citations: not cited yet (Europe PMC); 55 references in the paper
Research resources: RRID:SCR_005994

Abstract

Studies of hippocampal pattern similarity during event encoding and its relationship to subsequent memory retrieval have revealed inconsistent results. Our laboratory recently found evidence that differences in cognitive processing during encoding can modulate the relationship between hippocampal pattern similarity and recognition success. This finding is consistent with the theoretical proposal that hippocampal representations have a dynamic relationship to memory retrieval in which cognitive goals are influential. However, there have been few attempts to replicate representational similarity findings from functional magnetic resonance imaging (fMRI) and, to our knowledge, no evidence of successful replication in either the hippocampus or subsequent memory studies. In order to draw strong theoretical conclusions from our findings, or others in the literature, it is important to demonstrate that those findings are robust. The current study attempted a direct replication of our prior experiment with the exception of minor modifications in the neuroimaging parameters, which were intended to assess the degree to which representational similarity analyses are influenced by reasonable technical differences in data collection. We did not replicate the finding that cognitive variability interacts with future recognition success in the hippocampus. Overall, we failed to replicate 9 out of 12 significant F-test results from the Lim et al. study. The three findings that were replicated can be explained by minor visual differences in stimulus presentation on variable cognitive context trials. In addition, we found three new significant effects in the current study that did not previously appear in our earlier study. Therefore, we conclude that fMRI studies using representational similarity analysis of subsequent memory performance are sensitive to minor methodological variation. Further tests of the replicability of these findings are needed prior to drawing theoretical conclusions from their results. Preregistered Stage 1 protocol: https://osf.io/njzhq (date of in-principle acceptance: August 1, 2025) Final recommended Stage 2 manuscript and materials: https://doi.org/10.17605/OSF.IO/ZUYNA PCI:RR Stage 1 recommendation: https://rr.peercommunityin.org/articles/rec?id=873 PCI:RR Stage 2 recommendation: https://rr.peercommunityin.org/articles/rec?id=1278

Reproduced under the paper's license (CC BY), from the paper cited above.

Repository

Its files are read in the Code ↔ Paper reader above, with 1 match between paragraphs and lines of code.

OSF zuyna

License: none: the authors keep all their rights
State: the link answers, verified on 30 September 2026
Evidence: files inventoried
Languages: MATLAB (21)
Size: 96 files, 21 scripts
Software Heritage: not checked
Found in: “Data and Code Availability”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 30 September 2026: the link answers (HTTP 200)
  • 30 September 2026: the link answers (HTTP 200)
21 files

The paper's code and data availability statement is in the Data section.

Tracing map

Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.

What the map holds:

  • 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 21 scripts, each with its path and the digest of its content;
  • 1 match between paragraphs of the paper and lines of the code (method lexical-v1);
  • neither the text of the paper nor the code itself.

Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.

Data

No dataset and no data link were found in the paper.

Data and Code Availability

All raw data, custom scripts, RSA output, and statistical output are available at: https://doi.org/10.17605/OSF.IO/ZUYNA

Reproduced under the paper's license (CC BY), from the paper cited above.

Versions

The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.

Version 1, 30 September 2026: the first record

Recorded: type, language, journal, volume, pages, dates, 4 authors, 6 keywords, 2 funders, 55 references, 1 RRID.

Cite

This paper

Yuksel, E., Shafer, E. S., Netto, M., & Diana, R. A. (2026). Replicability of representational similarity and its role in successful memory retrieval. Imaging neuroscience (Cambridge, Mass.), 4, IMAG.a.1214. https://doi.org/10.1162/imag.a.1214

BibTeX

@article{yuksel2026replicability,
author = {Yuksel, Ece and Shafer, Erica S and Netto, Madeline and Diana, Rachel A},
title = {{Replicability of representational similarity and its role in successful memory retrieval}},
journal = {Imaging neuroscience (Cambridge, Mass.)},
year = {2026},
month = apr,
volume = {4},
pages = {IMAG.a.1214},
publisher = {MIT Press},
issn = {2837-6056},
doi = {10.1162/imag.a.1214},
url = {https://doi.org/10.1162/imag.a.1214},
pmid = {42052507},
pmcid = {PMC13112209}
}

RIS

TY - JOUR
AU - Yuksel, Ece
AU - Shafer, Erica S
AU - Netto, Madeline
AU - Diana, Rachel A
TI - Replicability of representational similarity and its role in successful memory retrieval
T2 - Imaging neuroscience (Cambridge, Mass.)
J2 - Imaging Neurosci (Camb)
PY - 2026
DA - 2026/04/24
VL - 4
SP - IMAG.a.1214
SN - 2837-6056
PB - MIT Press
DO - 10.1162/imag.a.1214
UR - https://doi.org/10.1162/imag.a.1214
LA - en
ER -

CSL-JSON

{
"id": "10.1162/imag.a.1214",
"type": "article-journal",
"title": "Replicability of representational similarity and its role in successful memory retrieval",
"container-title": "Imaging neuroscience (Cambridge, Mass.)",
"author": [
{
"family": "Yuksel",
"given": "Ece"
},
{
"family": "Shafer",
"given": "Erica S"
},
{
"family": "Netto",
"given": "Madeline"
},
{
"family": "Diana",
"given": "Rachel A"
}
],
"container-title-short": "Imaging Neurosci (Camb)",
"volume": "4",
"page": "IMAG.a.1214",
"DOI": "10.1162/imag.a.1214",
"PMID": "42052507",
"PMCID": "PMC13112209",
"ISSN": "2837-6056",
"publisher": "MIT Press",
"URL": "https://doi.org/10.1162/imag.a.1214",
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
24
]
]
}
}

The tracing map gets a citation of its own once an author has validated it and it has a DOI.

Similar papers

The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.

[1] doi:10.7554/elife.107933 [code]
Modality-agnostic decoding of vision and language from fMRI.
Journal: eLife
In common: SPM, fMRI, cognitive, 4 references
[2] doi:10.1162/imag.a.1321 [code]
Phase similarity between similar objects indicates representational merging across retrieval training but not sleep.
Journal: Imaging neuroscience (Cambridge, Mass.)
In common: cognitive, 4 references
[3] doi:10.1016/j.cub.2026.05.068 [code]
An abstract relational map emerges in the human medial prefrontal cortex with consolidation.
Journal: Current biology : CB
In common: SPM, Image Processing Toolbox, Statistics and Machine Learning Toolbox, fMRI, 2 references
[4] doi:10.1016/j.isci.2026.117391
Context-dependent abstraction of temporal relationships during naturalistic episodic memory.
Journal: iScience
In common: fMRI, cognitive, 4 references
[5] doi:10.1073/pnas.2603114123 [code]
The human hippocampus can pattern separate memories by meaning.
Journal: Proceedings of the National Academy of Sciences of the United States of America
In common: cognitive, 4 references
[6] doi:10.1038/s42003-026-10262-4 [code]
Brain-wide information flow dynamics during novel visual processing in humans.
Journal: Communications biology
In common: Statistics and Machine Learning Toolbox, 3 references
[7] doi:10.3389/fncir.2026.1741762 [code]
Task-dependent increases and decreases of BOLD signal in theory of mind brain regions during strategic social interaction.
Journal: Frontiers in neural circuits
In common: SPM, Statistics and Machine Learning Toolbox, fMRI, cognitive, 2 references
[8] doi:10.1162/imag.a.105 [code]
Right posterior theta reflects human parahippocampal phase resetting by salient cues during goal-directed navigation
Journal: n/a
In common: SPM, Statistics and Machine Learning Toolbox, fMRI, cognitive, 2 references
[9] doi:10.1016/j.neuron.2026.04.011 [code]
Precision fMRI reveals densely interdigitated network patches with conserved motifs in the lateral prefrontal cortex.
Journal: Neuron
In common: SPM, Image Processing Toolbox, Statistics and Machine Learning Toolbox, fMRI, 1 reference
[10] doi:10.1007/s00429-026-03152-2 [code]
Limb-selective regions in the lateral temporal lobe shrink from childhood to adulthood.
Journal: Brain structure & function
In common: SPM, Image Processing Toolbox, Statistics and Machine Learning Toolbox, fMRI, 1 reference

Contribute

The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.

Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.

Request its removal

To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).

Discussion, reproductions, activity

Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.

Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.

Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.