Replicability of representational similarity and its role in successful memory retrieval.
The 1 match
- [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
- %% ERICA'S VERSION – Cleaned Full Script for Behavioral Data Analysis (Memory + Manipulation Check)
- % Define the subjects to process
- subjnames = {'62'};
- % Initialize output matrix
- nummatrix = [];
- % Define correct manipulation check answers
- correct_1 = {'aceofdiamond.png','apron.png','sponge01.png','tent.png','campfire.png','corn02.png' };
- %Correct YES
- correct_2 = {'barn.png','tree.png','africanelephant.png', 'fingerprint.png','puzzlepiece.png','feather03a.png'};
- %Correct NO
- % Main loop for each subject
- for i = 1:length(subjnames)
- name = subjnames{i};
- fprintf('\n📂 Starting Subject %s\n', name);
- % Change directory: ERICA'S COMPUTER
- %cd('E:\BehavioralTask_OtherRachelOneDriveStuff\cmd');
- %LAB COMPUTERS: update the lines below so that the script finds the data files on your
- %machine
- %Update the lines below so that the script finds the data files on your machine
- addpath('\\192.168.76.14\dianalab\DroboC\RSA_Replication_Study_drobo\RawBehavData');
- %RACHEL'S OFFICE: update the lines below so that the script finds the data files on your machine
- % Update the lines below so that the script finds the data files on your machine
- %addpath('\\128.173.168.149\dianalab\DroboC\RSA_Replication_Study_drobo\RawBehavData');
- %% ------------------------ LOAD STUDY LOGS AND IDENTIFY MANIPULATION CHECK ITEMS ------------------------
- study_files = { strcat(name,'-Run_1_study_3_2.log'), strcat(name,'-Run_2_study_3_2.log'), ...
- strcat(name,'-Run_3_study_3_2.log'), strcat(name,'-Run_4_study_3_2.log') };
- mc_trials = {}; % to store manipulation check trials
- for f = 1:length(study_files)
- fid = fopen(study_files{f});
- if fid == -1
- warning('❌ Could not open file: %s', study_files{f});
- continue;
- end
- data = textscan(fid, '%*d%d%s%s%*d%*d%*d%*d%*[^\n]', 'HeaderLines', 5, 'Delimiter', '\t');
- fclose(fid);
- trialnum = data{1};
- event = data{2};
- code = data{3};
- for j = 1:length(code)
- if contains(event{j}, 'Picture') && contains(code{j}, 'Study,') && ...
- ~contains(code{j}, 'Study_Response') && contains(code{j}, '.png')
- parts = strsplit(strtrim(code{j}), ',');
- if length(parts) >= 3
- [~, baseimg, ~] = fileparts(strtrim(parts{2}));
- img_name = [baseimg, '.png'];
- question = strtrim(parts{3});
- if any(strcmp(img_name, correct_1)) || any(strcmp(img_name, correct_2))
- cur_trial = trialnum(j);
- response = '0'; % default to skipped
- % Look ahead until the first Response event in a *new* trial AND it's 7/8/9
- for k = j+1:min(j+15, length(trialnum))
- if trialnum(k) ~= cur_trial && contains(event{k}, 'Response')
- resp_code = strtrim(code{k});
- if ismember(resp_code, {'7','8','9'})
- response = resp_code;
- break;
- end
- end
- end
- mc_trials = [mc_trials; {img_name, question, response}];
- fprintf('🧪 MC item: %-20s | Response: %s\n', img_name, response);
- end
- end
- end
- end
- end
- %% ------------------------ SCORE MC TRIALS ------------------------
- %% ------------------------ SCORE MANIPULATION CHECKS (EXTERNAL ONLY) ------------------------
- % Define correct answers
- could_not_carry = {'barn.png','tree.png','africanelephant.png'}; % NO
- could_carry = {'aceofdiamond.png','apron.png','sponge01.png'}; % YES
- not_useful = {'fingerprint.png','puzzlepiece.png','feather03a.png'}; % NO
- is_useful = {'tent.png','campfire.png','corn02.png'}; % YES
- % Create lookup map
- valid_items = [could_not_carry, could_carry, not_useful, is_useful];
- correct_answers_map = containers.Map;
- for img = could_not_carry, correct_answers_map(img{1}) = 'no'; end
- for img = could_carry, correct_answers_map(img{1}) = 'yes'; end
- for img = not_useful, correct_answers_map(img{1}) = 'no'; end
- for img = is_useful, correct_answers_map(img{1}) = 'yes'; end
- % Scoring variables
- unique_trials = containers.Map;
- maybe_count = 0;
- consistent_count = 0;
- correct_count = 0;
- skipped = 0;
- for r = 1:size(mc_trials,1)
- img = mc_trials{r,1};
- resp = strtrim(mc_trials{r,3});
- % Skip if not valid MC image
- if ~ismember(img, valid_items)
- continue;
- end
- %%% TEMPORARILY COUNT DUPLICATES
- % Skip duplicates
- % if isKey(unique_trials, img)
- % continue;
- % end
- %%%%%%%%%%%%%%%%%%%%%%%%%%
- % Check response validity
- if ~ismember(resp, {'7','8','9'})
- skipped = skipped + 1;
- continue;
- end
- % Map numeric response to text
- if strcmp(resp, '7')
- resp_val = 'yes';
- elseif strcmp(resp, '9')
- resp_val = 'no';
- elseif strcmp(resp, '8')
- maybe_count = maybe_count + 1;
- unique_trials(img) = 'maybe';
- continue; % 'maybe' is tracked but not scored
- end
- % Compare to correct
- correct_val = correct_answers_map(img);
- if strcmp(resp_val, correct_val)
- correct_count = correct_count + 1;
- end
- unique_trials(img) = resp_val;
- end
- % Final scoring
- incorrect = 16 - correct_count;
- fprintf('\n✅ External consistency: %d / 16\n', consistent_count);
- fprintf('❔ Maybe responses: %d\n', maybe_count);
- fprintf('🚫 Skipped responses: %d\n', skipped);
- fprintf('❌ Incorrect responses: %d\n', incorrect);
- %% ------------------------ SCORE MANIPULATION CHECKS (INTERNAL ONLY) ------------------------
- % Count internal inconsistencies
- imgnames = mc_trials(:,1);
- resps = mc_trials(:,3);
- unique_imgs = unique(imgnames);
- inconsistent = 0;
- for u = 1:length(unique_imgs)
- matches = strcmp(imgnames, unique_imgs{u});
- all_resps = unique(resps(matches));
- % Only consider valid responses
- all_resps = intersect(all_resps, {'7','8','9'});
- if length(all_resps) > 1
- inconsistent = inconsistent + 1;
- end
- end
- %% ------------------------ LOAD TEST SESSION ------------------------
- % testname = strcat(name, '-Test_scenario.log');
- % fid = fopen(testname);
- % data = textscan(fid, '%d%d%s%s%d%d%d%d%*[^\n]', 'HeaderLines', 5, 'Delimiter', '\t');
- % fclose(fid);
- %% ------------------------ LOAD TEST SESSION (with file existence check) ------------------------
- testname = strcat(name, '-Test_scenario.log');
- if exist(testname, 'file')
- fprintf('📄 Found test file: %s\n', testname);
- fid = fopen(testname);
- data = textscan(fid, '%d%d%s%s%d%d%d%d%*[^\n]', 'HeaderLines', 5, 'Delimiter', '\t');
- fclose(fid);
- trial = data{2};
- event = data{3};
- code = data{4};
- ttime = data{6};
- types = {}; pics = {}; conditions = {}; resps = {}; resp_ttimes = [];
- for j = 1:length(code)
- if contains(event{j}, 'Picture') && contains(code{j}, '.png')
- parts = strsplit(strtrim(code{j}), ',');
- if length(parts) >= 3
- types = [types; strtrim(parts{1})];
- pics = [pics; strtrim(parts{2})];
- conditions = [conditions; strtrim(parts{3})];
- end
- % Find the next response
- if j+1 <= length(event) && contains(event{j+1}, 'Response')
- resps = [resps; code(j+1)];
- resp_ttimes = [resp_ttimes; ttime(j+1)];
- elseif j+2 <= length(event) && contains(event{j+2}, 'Response')
- resps = [resps; code(j+2)];
- resp_ttimes = [resp_ttimes; ttime(j+2)];
- else
- resps = [resps; {'0'}];
- resp_ttimes = [resp_ttimes; NaN];
- end
- end
- end
- %% ------------------------ SCORE MEMORY RESPONSES ------------------------
- resps = cellfun(@num2str, resps, 'UniformOutput', false);
- unstudied = []; same = []; var = []; oldresp = []; newresp = [];
- for k = 1:length(pics)
- if contains(conditions{k}, 'new'), unstudied = [unstudied, k];
- elseif contains(conditions{k}, 'sameA') || contains(conditions{k}, 'sameB'), same = [same, k];
- elseif contains(conditions{k}, 'varAB') || contains(conditions{k}, 'varBA'), var = [var, k];
- end
- if strcmp(resps{k}, '1'), oldresp = [oldresp, k];
- elseif strcmp(resps{k}, '2'), newresp = [newresp, k];
- end
- end
- same_hit = intersect(same, oldresp);
- var_hit = intersect(var, oldresp);
- same_miss = intersect(same, newresp);
- var_miss = intersect(var, newresp);
- fa = intersect(unstudied, oldresp);
- prop_same_hit = length(same_hit) / length(same);
- prop_var_hit = length(var_hit) / length(var);
- prop_same_miss = length(same_miss) / length(same);
- prop_var_miss = length(var_miss) / length(var);
- prop_fa = length(fa) / length(unstudied);
- total_hits = length(same_hit) + length(var_hit);
- total_miss = length(same_miss) + length(var_miss);
- HR = min(max(total_hits / (length(same)+length(var)), 0.01), 0.99);
- FAR = min(max(length(fa) / length(unstudied), 0.01), 0.99);
- dprime = norminv(HR) - norminv(FAR);
- else
- fprintf('⚠️ Test file missing: %s — skipping memory scoring.\n', testname);
- % Set placeholder values
- same_hit = []; var_hit = []; same_miss = []; var_miss = []; fa = [];
- prop_same_hit = NaN; prop_var_hit = NaN; prop_same_miss = NaN;
- prop_var_miss = NaN; prop_fa = NaN; total_hits = NaN;
- dprime = NaN; total_miss = NaN;
- end
- %% ------------------------ STORE RESULTS ------------------------
- % Adjust incorrect count (optional, per your note)
- incorrect = incorrect - maybe_count;
- % nummatrixrow = [length(same_hit), length(var_hit), length(same_miss), length(var_miss), length(fa), ...
- % prop_same_hit, prop_var_hit, prop_same_miss, prop_var_miss, prop_fa, ...
- % total_hits, dprime, total_miss, skipped, inconsistent, maybe_count, incorrect];
- nummatrixrow = [skipped, inconsistent, maybe_count, incorrect];
- nummatrix = [nummatrix; nummatrixrow];
- end
ManipulationCheckOnlyAnalysis.m, no license · at the source
Overview
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://
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
Availability: 1 check, the latest on 30 September 2026: the link answers (HTTP 200)
- 30 September 2026: the link answers (HTTP 200)
21 files
- Custom Scripts/
CorrelateMatchingItems_F , MATLAB, 261 linesishertransform.m - Custom Scripts/
Correlate_LimReanalysisV , MATLAB, 258 linesersion.m - Custom Scripts/
ManipulationCheckOnlyAna , MATLAB, 277 lines, 1 matchlysis.m - Custom Scripts/
Merge_MovementParameters , MATLAB, 49 lines.m - Custom Scripts/
NormalizeLOC_TEMPLATE.m , MATLAB, 13 lines - Custom Scripts/
NormalizeLOC_TEMPLATE_jo , MATLAB, 288 linesb.m - Custom Scripts/
RSAReplication_CreateReg , MATLAB, 613 linesressors.m - Custom Scripts/
Template_ART_glm.m , MATLAB, 21 lines - Custom Scripts/
Template_ART_glm_job.m , MATLAB, 1,691 lines - Custom Scripts/
Template_Create_RSA_GLM_ , MATLAB, 95 linesjobs.m - Custom Scripts/
Template_Create_Target_C , MATLAB, 38 linesontrast_jobs.m - Custom Scripts/
Template_Get_Avg_Beta_Di , MATLAB, 52 linesstribution.m - Custom Scripts/
Template_RSA_GLM_pulse_l , MATLAB, 212 linesist_creation.m - Custom Scripts/
Template_ResliceMasks.m , MATLAB, 17 lines - Custom Scripts/
Template_ResliceMasks_jo , MATLAB, 20 linesb.m - Custom Scripts/
Template_Run_RSA_Contras , MATLAB, 12 linests.m - Custom Scripts/
Template_Run_RSA_GLMs.m , MATLAB, 12 lines - Custom Scripts/
Template_preprocessing.m , MATLAB, 11 lines - Custom Scripts/
Template_preprocessing_j , MATLAB, 1,746 linesob (1).m - Custom Scripts/
epiImport_ConvertTo4D_te , MATLAB, 11 linesmplate.m - Custom Scripts/
epiImport_ConvertTo4D_te , MATLAB, 905 linesmplate_job.m
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://
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://
BibTeX
@article{yuksel2026repli
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/
url = {https://
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/
VL - 4
SP - IMAG.a.1214
SN - 2837-6056
PB - MIT Press
DO - 10.1162/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1162/
"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":
"volume": "4",
"page": "IMAG.a.1214",
"DOI": "10.1162/
"PMID": "42052507",
"PMCID": "PMC13112209",
"ISSN": "2837-6056",
"publisher": "MIT Press",
"URL": "https://
"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: eLifeIn 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 : CBIn 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: iScienceIn 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 AmericaIn common: cognitive, 4 references
- [6] 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 circuitsIn common: SPM, Statistics and Machine Learning Toolbox, fMRI, cognitive, 2 references
- [7] doi:10.1162/imag.a.105 [code]
- Right posterior theta reflects human parahippocampal phase resetting by salient cues during goal-directed navigationJournal: n/aIn common: SPM, Statistics and Machine Learning Toolbox, fMRI, cognitive, 2 references
- [8] doi:10.1038/s42003-026-10262-4 [code]
- Brain-wide information flow dynamics during novel visual processing in humans.Journal: Communications biologyIn common: Statistics and Machine Learning Toolbox, 3 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: NeuronIn 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 & functionIn 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.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 1 repository of the authors' code, each at its verified commit and with its license, 21 scripts, and 1 match between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:931bd3409b441e0d…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[.
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.
