Learned statistical regularity modulates anticipatory micro-saccades toward suppressed distractor locations.
6 blocks of code here have a permanent identifier (oscr:b:…), listed with the matches below: citable for good, with a page of its own. Select a match and press Cite to copy it. What a block identifier is.
The 8 matches · 4 of them tie a paragraph to a whole file without given lines: weak matches, whose lines are not tinted
- [1] § Methods › Micro-saccade detection ↔ Codes/Analysis Codes/Micro-saccade detection/microsacc.R, the whole file · a weak match · score 0.79 · velocity threshold, minimum duration, peak velocity, Engbert, Micro saccades, amplitude · block
oscr:b:7TFWPB4BPBJT7-L· Report a mismatch - [2] § Methods › Classification analysis ↔ Codes/Analysis Codes/Fig.2g.m, lines 157 to 236 · score 0.66 · Support Vector, SVM ECOC, fitcecoc, accuracies, training, model · block
oscr:b:3167FJAQ0G8QR-L· Report a mismatch - [3] § Methods › Time-frequency analysis ↔ Codes/Analysis Codes/Fig.2b.m, lines 16 to 96 · score 0.66 · 8–14 Hz, 2500 ms, alpha, epoch, power, electrodes · block
oscr:b:VW7JTKZJY9VC3-0· Report a mismatch - [4] § Methods › Micro-saccade-locked activity ↔ Codes/Analysis Codes/Fig2.d_e_f.m, the whole file · a weak match · score 0.56 · 500–1000 ms, pre, activity, 500 ms, EEG, electrodes · block
oscr:b:CJYD1YQEK9S1K-U· Report a mismatch - [5] § Methods › Micro-saccade detection ↔ Codes/Analysis Codes/Micro-saccade detection/binsacc.R, the whole file · a weak match · score 0.54 · peak velocity, Engbert, Micro saccades, amplitude, vertical, Horizontal · block
oscr:b:Q0WBYW43WMWJA-K· Report a mismatch - [6] § Results › Micro-saccade-locked activity ↔ Codes/Analysis Codes/Fig2.d_e_f.m, the whole file · a weak match · score 0.53 · 500–1000 ms, topography, activity, window, 500 ms · block
oscr:b:CJYD1YQEK9S1K-U· Report a mismatch - [7] § Methods › Inverted encoding model ↔ Codes/Analysis Codes/Fig.2b.m, lines 198 to 266 · score 0.52 · weight matrix, channel response, model · block
oscr:b:CZ2WSPASEDZPC-Y· Report a mismatch - [8] § Methods › Inverted encoding model ↔ Codes/Analysis Codes/Fig.2b.m, lines 16 to 96 · score 0.51 · circularly shifted, band, alpha, channel, power, electrode · block
oscr:b:VW7JTKZJY9VC3-0· Report a mismatch
Paper
Loaded from Europe PMC by your browser; OSCR does not store it: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
MATLAB · 267 lines · 11 KB · no license · 3 matches
- %dapated from Foster et al., 2016
- clear, close all, warning('off','all'),clc,clear all
- readdir = 'path to preprocessed EEG data';
- cd(readdir)
- sublist=dir(readdir);
- sublist={sublist.name};
- sublist = sublist(3:end);
- for subno =1:length(sublist)
- clear EEG
- dname = sublist{subno};
- fprintf('Loading subject %s for analysis ...\n',dname);
- load([readdir filesep dname]);
- %% Select chans of interes
- chan={'O1','O2','Oz','PO3','PO4','PO7','PO8','POz','P1','P2','P3','P4','P5','P6','P7','P8','Pz'};
- chan2plot=[];
- for ch=1:length(chan)
- chan2plot(ch) = find(strcmpi({EEG.chanlocs.labels},chan(ch)));
- end
- EEG = pop_select(EEG,'channel',chan);
- fprintf('Loading subject %s for analysis ...\n',dname);
- % parameters to set
- em.nChans = 6; % # of channels
- em.nBins = em.nChans; % # of stimulus bins
- em.nIter = 10; % # of iterations
- em.nBlocks = 3; % # of blocks for cross-validation
- em.frequencies = [8 14]; % frequency bands to analyze
- em.bands = {'Alpha'};
- em.time = -2500:2:1000; % time points of interest
- em.window = 2;
- em.Fs = EEG.srate;
- em.nElectrodes = length(chan);
- em.sampRate = 2; % downsampled sample rate (in ms)
- em.time = -2500:2:1000; % specificy time window of interest
- em.dtime = -2500:em.sampRate:1000; % downsampled time points
- em.stepSize = em.sampRate/(1000/em.Fs); % number of samples the classifer jumps with each shift
- em.nSamps = length(em.time); % # of samples
- em.dSamps = length(em.dtime); % # of samples at downsampled rate
- cnt = 0;
- clear epoch_markers distance_markers
- posBin=[];
- epoch_markers = [];
- for i = 1:EEG.trials
- marker = cell2mat(EEG.epoch(i).eventtype);
- lantancy = cell2mat(EEG.epoch(i).eventlatency);
- if length(EEG.epoch(i).eventlatency)>3
- RT(i) = lantancy(4);
- else
- RT(i) = 2001;
- end
- lantanct_index = find(lantancy==0);
- epoch_marker = marker(lantanct_index);
- response_marker = marker(lantanct_index+1);
- epoch_markers(i) = epoch_marker;
- posBin(i) = epoch_marker;
- end
- EEG.epoch_markers = epoch_markers;
- eegs = EEG.data;
- clear RT
- nChans = em.nChans;
- nBins = em.nBins;
- nIter = em.nIter;
- nBlocks = em.nBlocks;
- freqs = em.frequencies;
- times = em.time;
- nFreqs = size(em.frequencies,1); %%
- nElectrodes = em.nElectrodes;
- disp(nElectrodes);
- disp(chan);
- nSamps = length(em.time);
- Fs = em.Fs;
- dSamps = em.dSamps;
- sampRate = em.sampRate;
- stepSize = em.stepSize;
- window = em.window;
- % Specify basis set
- em.sinPower = 7;%sin power at 25th in Sutterer&Foster_2019_Plos Biology
- em.x = linspace(0, 2*pi-2*pi/nBins, nBins);
- em.cCenters = linspace(0, 2*pi-2*pi/nChans, nChans);
- em.cCenters = rad2deg(em.cCenters);
- pred = sin(0.5*em.x).^em.sinPower; % hypothetical channel responses
- pred = wshift('1D',pred,3); % shift the initial basis function
- basisSet = nan(nChans,nBins);
- for c = 1:nChans
- basisSet(c,:) = wshift('1D',pred,-c+1); % generate circularly shifted basis functions
- end
- em.basisSet = basisSet;
- eegs = EEG.data;%(:,:,EEG.index);
- posBin = posBin';
- em.posBin = posBin;
- % Grab data------------------------------------------------------------
- % Shift So that highprob loctions are catogorized into bin1
- em.nTrials = length(posBin); nTrials = em.nTrials; % # of good trials
- nTimes = length(times);
- %----------------------------------------------------------------------
- % Preallocate Matrices
- tf_evoked = nan(nFreqs,nIter,nSamps,nBlocks,nChans); tf_total = tf_evoked;
- C2_evoked = nan(nFreqs,nIter,nSamps,nBlocks,nBins,nChans); C2_total = C2_evoked;
- em.blocks = nan(nTrials,nIter);
- eegs = permute(eegs,[3 1 2]);%
- nPoint = length(eegs);
- epoch_index = dsearchn(EEG.times',times');
- % Loop through each frequency
- for f = 1:nFreqs
- tic % start timing frequency loop
- fprintf('Frequency %d out of %d\n', f, nFreqs)
- % Filter Data
- fdata_evoked = nan(nTrials,nElectrodes,nPoint);
- fdata_total = nan(nTrials,nElectrodes,nPoint);
- tic
- parfor c = 1:nElectrodes
- %fdata_total(:,c,:) = (eegfilt(squeeze((eegs(:,c,:))),Fs,freqs(f,1),freqs(f,2))')';
- disp(c)
- fdata_evoked(:,c,:) = hilbert(eegfilt(squeeze((eegs(:,c,:))),Fs,freqs(f,1),freqs(f,2))')';
- fdata_total(:,c,:) = abs(hilbert(eegfilt(squeeze((eegs(:,c,:))),Fs,freqs(f,1),freqs(f,2))')').^2;
- % fdata_total(:,c,:) = eegfilt(squeeze(eegs(:,c,:)),Fs,freqs(1,1),freqs(1,2));% instantaneous power calculated here for induced activity.
- end
- toc
- fdata_total = fdata_total(:,:,epoch_index);
- fdata_evoked = fdata_evoked(:,:,epoch_index);
- for iter = 1:nIter
- blocks = nan(size(posBin));
- shuffBlocks = nan(size(posBin));
- % count number of trials within each position bin
- clear binCnt %bincnt = bin count
- for bin = 1:nBins
- binCnt(bin) = sum(posBin == bin);%%
- end
- minCnt = min(binCnt); %
- nPerBin = floor(minCnt/nBlocks);
- % max # of trials such that the # of trials for each bin can be equated within each block
- shuffInd = randperm(nTrials)'; % create shuffle index
- shuffBin = posBin(shuffInd); % shuffle trial order
- for bin = 1:nBins
- idx = find(shuffBin == bin); % get index for trials belonging to the current bin%
- idx = idx(1:nPerBin*nBlocks); % drop excess trials
- x = repmat(1:nBlocks',nPerBin,1); shuffBlocks(idx) = x; % assign randomly order trials to blocks
- end
- % unshuffle block assignment ÕâÀïΪʲôҪunshuffle?
- blocks(shuffInd) = shuffBlocks;
- % save block assignment
- em.blocks(:,iter) = blocks; % block assignment
- em.nTrialsPerBlock = length(blocks(blocks == 1)); % ÌáÈ¡³öÿ¸öblockÖÐÓжàÉÙ¸ötrial
- %-------------------------------------------------------------------------
- % Average data for each position bin across blocks
- posBins = 1:nBins;
- blockDat_evoked = nan(nBins*nBlocks,nElectrodes,nSamps); % averaged evoked data
- blockDat_total = nan(nBins*nBlocks,nElectrodes,nSamps); % averaged total data
- labels = nan(nBins*nBlocks,1); % bin labels for averaged data
- blockNum = nan(nBins*nBlocks,1); % block numbers for averaged data
- c = nan(nBins*nBlocks,nChans); % predicted channel responses for averaged data
- bCnt = 1;
- for ii = 1:nBins
- for iii = 1:nBlocks
- blockDat_evoked(bCnt,:,:) = abs(squeeze(mean(fdata_evoked(posBin==posBins(ii) & blocks==iii,:,:),1))).^2;
- blockDat_total(bCnt,:,:) = squeeze(mean(fdata_total(posBin==posBins(ii) & blocks==iii,:,:),1));
- % blockDat_total(bCnt,:,:); = squeeze(mean(fdata_total;(posBin==posBins(1) & blocks==1,:,:),1));
- labels(bCnt) = ii;
- blockNum(bCnt) = iii;
- c(bCnt,:) = basisSet(ii,:);
- bCnt = bCnt+1;
- end
- end
- parfor t = 1:nSamps
- % grab data for timepoint t
- toi = ismember(times,times(t)-em.window/2:times(t)+em.window/2); % time window of interest
- de = squeeze(mean(blockDat_evoked(:,:,toi),3)); % evoked data
- dt = squeeze(mean(blockDat_total(:,:,toi),3)); % total data
- % Do forward model
- for i=1:nBlocks % loop through blocks, holding each out as the test set
- trnl = labels(blockNum~=i); % training labels
- tstl = labels(blockNum==i); % test labels
- %-----------------------------------------------------%
- % Analysis on Evoked Power %
- %-----------------------------------------------------%
- B1 = de(blockNum~=i,:); % training data
- B2 = de(blockNum==i,:); % test data
- C1 = c(blockNum~=i,:); % predicted channel outputs for training data
- W = C1\B1;% estimate weight matrix
- C2 = (W'\B2')'; % estimate channel responses
- C2_evoked(f,iter,t,i,:,:) = C2; % save the unshifted channel responses
- % shift eegs to common center
- n2shift = ceil(size(C2,2)/2);
- for ii=1:size(C2,1)
- [~, shiftInd] = min(abs(posBins-tstl(ii)));
- C2(ii,:) = wshift('1D', C2(ii,:), shiftInd-n2shift-1);
- end
- tf_evoked(f,iter,t,i,:,:) = mean(C2,1); % average shifted channel responses
- %-----------------------------------------------------%
- % Analysis on Total Power %
- %-----------------------------------------------------%
- B1 = dt(blockNum~=i,:); % training data
- B2 = dt(blockNum==i,:); % test data
- C1 = c(blockNum~=i,:); % predicted channel outputs for training data
- W = C1\B1; % estimate weight matrix
- C2 = (W'\B2')'; % estimate channel responses
- C2_total(f,iter,t,i,:,:) = C2;
- % shift eegs to common center
- n2shift = ceil(size(C2,2)/2);
- for ii=1:size(C2,1)
- [~, shiftInd] = min(abs(posBins-tstl(ii)));
- C2(ii,:) = wshift('1D', C2(ii,:), shiftInd-n2shift-1);
- end
- tf_total(f,iter,t,i,:) = mean(C2,1);
- C2_total_shifted(f,iter,t,i,:,:) = C2;
- % average shifted channel responses
- %-----------------------------------------------------%
- end
- end
- end
- toc % stop timing the frequency loop
- end
- %tf_total_mean = squeeze(mean(mean(tf_total,2),4));
- fName = ['save path\' filesep sublist{subno}(1:end)];
- em.C2_total_shifted = C2_total_shifted;
- em.tfs.evoked = tf_evoked;
- em.tfs.total = tf_total;
- em.nBlocks = nBlocks;
- save(fName,'em','-v7.3');
- end
Fig.2b.m, no license · at the source
Overview
- Key Laboratory of Mental Health of the Ministry of Education, Guangdong-Hong Kong-Macao Greater Bay Area Center for Brain Science and Brain-Inspired Intelligence, Guangdong-Hong Kong Joint Laboratory for Psychiatric Disorders, Guangdong Province Key Laboratory of Psychiatric Disorders, Guangdong Basic Research Center of Excellence for Integrated Traditional and Western Medicine for Qingzhi Diseases, Department of Neurobiology, School of Basic Medical Sciences, Southern Medical University,Guangzhou, China
- Institute for Brain Research and Rehabilitation, South China Normal University,Guangzhou, China
- Department of Psychology, Zhejiang Normal University,Jinhua, China
- Department of Psychiatry and Experimental Psychology, University of Oxford,Oxford, United Kingdom
- Department of Experimental and Applied Psychology, Vrije Universiteit Amsterdam,Amsterdam, the Netherlands
Abstract
The abstract is not reproduced here: the paper's license (CC BY-NC-ND) does not allow it. Read it in the paper, at the publisher or on Europe PMC.
Repository
Its files are read in the Code ↔ Paper reader above, with 8 matches between paragraphs and lines of code.
OSF dfrpq
Availability: 1 check, the latest on 27 September 2026: the link answers (HTTP 200)
- 27 September 2026: the link answers (HTTP 200)
14 files
- Codes/
Analysis Codes/ , MATLAB, 48 linesFig.1e.m - Codes/
Analysis Codes/ , MATLAB, 30 linesFig.1i.m - Codes/
Analysis Codes/ , MATLAB, 214 linesFig.2a.m - Codes/
Analysis Codes/ , MATLAB, 267 lines, 3 matchesFig.2b.m - Codes/
Analysis Codes/ , MATLAB, 236 lines, 1 matchFig.2g.m - Codes/
Analysis Codes/ , MATLAB, 30 lines, 2 matchesFig2.d_e_f.m - Codes/
Analysis Codes/ , R, 96 lines, 1 matchMicro-saccade detection/ binsacc.R - Codes/
Analysis Codes/ , R, 112 lines, 1 matchMicro-saccade detection/ microsacc.R - Codes/
Analysis Codes/ , R, 71 linesMicro-saccade detection/ sacpar.R - Codes/
Analysis Codes/ , R, 13 linesMicro-saccade detection/ smoothdata.R - Codes/
Analysis Codes/ , R, 25 linesMicro-saccade detection/ vecvel.R - Codes/
Analysis Codes/ , MATLAB, 247 linesPermutation_for_time_ser ies.m - Codes/
Experiment Codes/ , Python, 1 lineAttentionalC.py - ReadME.txt, Text, 95 lines
Code availability statement
The paper has a code availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- it points to the authors' code: OSF dfrpq
Read it in the paper: doi.org/10.1038/s41467-026-73916-1.
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;
- 13 scripts, each with its path and the digest of its content;
- 8 matches 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 availability statement
The paper has a data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- no repository, dataset or request procedure was recognized in it
Read it in the paper: doi.org/10.1038/s41467-026-73916-1.
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, 27 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 6 authors, 3 keywords, 11 MeSH terms, 1 funder, 65 references.
Cite
This paper
Chen, S., Zhang, X., Li, X., Jensen, O., Theeuwes, J., & Wang, B. (2026). Learned statistical regularity modulates anticipatory micro-saccades toward suppressed distractor locations. Nature communications, 17(1), 7091. https://
BibTeX
@article{chen2026learned
author = {Chen, Sirui and Zhang, Xin and Li, Xinyu and Jensen, Ole and Theeuwes, Jan and Wang, Benchi},
title = {{Learned statistical regularity modulates anticipatory micro-saccades toward suppressed distractor locations}},
journal = {Nature communications},
year = {2026},
month = jun,
volume = {17},
number = {1},
pages = {7091},
publisher = {Nature Portfolio},
issn = {2041-1723},
doi = {10.1038/
url = {https://
pmid = {42230612},
pmcid = {PMC13392092}
}
RIS
TY - JOUR
AU - Chen, Sirui
AU - Zhang, Xin
AU - Li, Xinyu
AU - Jensen, Ole
AU - Theeuwes, Jan
AU - Wang, Benchi
TI - Learned statistical regularity modulates anticipatory micro-saccades toward suppressed distractor locations
T2 - Nature communications
J2 - Nat Commun
PY - 2026
DA - 2026/
VL - 17
IS - 1
SP - 7091
SN - 2041-1723
PB - Nature Portfolio
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "Learned statistical regularity modulates anticipatory micro-saccades toward suppressed distractor locations",
"container-title": "Nature communications",
"author": [
{
"family": "Chen",
"given": "Sirui"
},
{
"family": "Zhang",
"given": "Xin"
},
{
"family": "Li",
"given": "Xinyu"
},
{
"family": "Jensen",
"given": "Ole"
},
{
"family": "Theeuwes",
"given": "Jan"
},
{
"family": "Wang",
"given": "Benchi"
}
],
"container-title-short":
"volume": "17",
"issue": "1",
"page": "7091",
"DOI": "10.1038/
"PMID": "42230612",
"PMCID": "PMC13392092",
"ISSN": "2041-1723",
"publisher": "Nature Portfolio",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
6,
2
]
]
}
}
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.98304
- Neural mechanisms of learned suppression uncovered by probing the hidden attentional priority map.Journal: eLifeIn common: EEG, cognitive, 17 references, author Jan Theeuwes
- [2] doi:10.1523/jneurosci.0740-25.2025 [code]
- Predictive Distractor Processing Relies on Integrated Proactive and Reactive Attentional Mechanisms.Journal: The Journal of neuroscience : the official journal of the Society for NeuroscienceIn common: Signal Processing Toolbox, Statistics and Machine Learning Toolbox, cognitive, 15 references, author Ole Jensen
- [3] doi:10.1073/pnas.2518523122 [code]
- Automaticity speeds the retrieval of instances from the human hippocampus.Journal: Proceedings of the National Academy of Sciences of the United States of AmericaIn common: EEGLAB, Signal Processing Toolbox, Image Processing Toolbox, 1 other tool, cognitive, 3 references, 3 authors
- [4] doi:10.7554/elife.101733 [code]
- Proactive distractor suppression in early visual cortex.Journal: eLifeIn common: 10 references, author Jan Theeuwes
- [5] doi:10.1038/s41467-023-40405-8 [code]
- Pinging the brain to reveal the hidden attentional priority map using encephalography.Journal: Nature communicationsIn common: cognitive, 10 references, author Jan Theeuwes
- [6] doi:10.1016/j.pneurobio.2023.102433 [code]
- Microsaccades transiently lateralise EEG alpha activity.Journal: Progress in neurobiologyIn common: Statistics and Machine Learning Toolbox, EEG, cognitive, 12 references
- [7] doi:10.1371/journal.pbio.3002014
- Suppression of distracting inputs by visual-spatial cues is driven by anticipatory alpha activity.Journal: PLoS biologyIn common: EEG, cognitive, 9 references, author Ole Jensen
- [8] doi:10.1371/journal.pbio.3003418 [code]
- Microsaccades strongly modulate but do not directly cause the EEG N2pc marker of spatial attention.Journal: PLoS biologyIn common: Statistics and Machine Learning Toolbox, EEG, cognitive, 11 references
- [9] doi:10.1038/s42003-026-09992-2 [code]
- Dynamic competition between bottom-up saliency and top-down goals in early visual cortex.Journal: Communications biologyIn common: Statistics and Machine Learning Toolbox, EEG, 7 references, author Jan Theeuwes
- [10] doi:10.1523/eneuro.0076-23.2023 [code]
- Alpha-Band Lateralization and Microsaccades Elicited by Exogenous Cues Do Not Track Attentional Orienting.Journal: eNeuroIn common: shadedErrorBar, EEGLAB, Signal Processing Toolbox, 2 other tools, cognitive, 7 references
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, 13 scripts, and 8 matches 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:551e3da224b3e833…
Add the badge to the code's README
If you are an author or a maintainer of this paper's code, you can add this badge. It says what OSCR knows of the paper (its code, its validated tracing map) and links the code to this page. Paste one of these snippets under the README's title. Keep the two marks around it, so that the badge can be replaced in place and is never added twice. OSCR changes nothing in your repository.
Markdown
<!-- oscr-badge:start -->
[](https://openscicode.org/badge/doi/10.1038/s41467-026-73916-1)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.1038/s41467-026-73916-1.svg
:target: https://openscicode.org/badge/doi/10.1038/s41467-026-73916-1
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1038/s41467-026-73916-1"><img src="https://openscicode.org/badge/doi/10.1038/s41467-026-73916-1.svg" alt="OSCR"></a>
<!-- oscr-badge:end -->If you choose to, you can have the badge kept up to date for you, with oscr badge --write from the command line or with the GitHub Action in your repository's workflows. Every other form and option (a card, AsciiDoc, LaTeX, shields.io) is on the badge 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: code errors and mismatches between the code and the paper about this paper and its code, from readers and its authors, beside the paper and its tracing map.
Report a mismatch between the code and the paper · Report a code error (signed in)
Reproductions: reports from readers who ran the authors' code and did not get the paper's result, what they ran, with which environment, commit and data.
Report a reproduction failure (signed in)
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
