OSCR

Learned statistical regularity modulates anticipatory micro-saccades toward suppressed distractor locations.

Code ↔ Paper

8 matches 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.

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. [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. [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. [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. [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. [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. [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. [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. [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

  1. %dapated from Foster et al., 2016
  2. clear, close all, warning('off','all'),clc,clear all
  3. readdir = 'path to preprocessed EEG data';
  4. cd(readdir)
  5. sublist=dir(readdir);
  6. sublist={sublist.name};
  7. sublist = sublist(3:end);
  8. for subno =1:length(sublist)
  9. clear EEG
  10. dname = sublist{subno};
  11. fprintf('Loading subject %s for analysis ...\n',dname);
  12. load([readdir filesep dname]);
  13. %% Select chans of interes
  14. chan={'O1','O2','Oz','PO3','PO4','PO7','PO8','POz','P1','P2','P3','P4','P5','P6','P7','P8','Pz'};
  15. chan2plot=[];
  16. for ch=1:length(chan)
  17. chan2plot(ch) = find(strcmpi({EEG.chanlocs.labels},chan(ch)));
  18. end
  19. EEG = pop_select(EEG,'channel',chan);
  20. fprintf('Loading subject %s for analysis ...\n',dname);
  21. % parameters to set
  22. em.nChans = 6; % # of channels
  23. em.nBins = em.nChans; % # of stimulus bins
  24. em.nIter = 10; % # of iterations
  25. em.nBlocks = 3; % # of blocks for cross-validation
  26. em.frequencies = [8 14]; % frequency bands to analyze
  27. em.bands = {'Alpha'};
  28. em.time = -2500:2:1000; % time points of interest
  29. em.window = 2;
  30. em.Fs = EEG.srate;
  31. em.nElectrodes = length(chan);
  32. em.sampRate = 2; % downsampled sample rate (in ms)
  33. em.time = -2500:2:1000; % specificy time window of interest
  34. em.dtime = -2500:em.sampRate:1000; % downsampled time points
  35. em.stepSize = em.sampRate/(1000/em.Fs); % number of samples the classifer jumps with each shift
  36. em.nSamps = length(em.time); % # of samples
  37. em.dSamps = length(em.dtime); % # of samples at downsampled rate
  38. cnt = 0;
  39. clear epoch_markers distance_markers
  40. posBin=[];
  41. epoch_markers = [];
  42. for i = 1:EEG.trials
  43. marker = cell2mat(EEG.epoch(i).eventtype);
  44. lantancy = cell2mat(EEG.epoch(i).eventlatency);
  45. if length(EEG.epoch(i).eventlatency)>3
  46. RT(i) = lantancy(4);
  47. else
  48. RT(i) = 2001;
  49. end
  50. lantanct_index = find(lantancy==0);
  51. epoch_marker = marker(lantanct_index);
  52. response_marker = marker(lantanct_index+1);
  53. epoch_markers(i) = epoch_marker;
  54. posBin(i) = epoch_marker;
  55. end
  56. EEG.epoch_markers = epoch_markers;
  57. eegs = EEG.data;
  58. clear RT
  59. nChans = em.nChans;
  60. nBins = em.nBins;
  61. nIter = em.nIter;
  62. nBlocks = em.nBlocks;
  63. freqs = em.frequencies;
  64. times = em.time;
  65. nFreqs = size(em.frequencies,1); %%
  66. nElectrodes = em.nElectrodes;
  67. disp(nElectrodes);
  68. disp(chan);
  69. nSamps = length(em.time);
  70. Fs = em.Fs;
  71. dSamps = em.dSamps;
  72. sampRate = em.sampRate;
  73. stepSize = em.stepSize;
  74. window = em.window;
  75. % Specify basis set
  76. em.sinPower = 7;%sin power at 25th in Sutterer&Foster_2019_Plos Biology
  77. em.x = linspace(0, 2*pi-2*pi/nBins, nBins);
  78. em.cCenters = linspace(0, 2*pi-2*pi/nChans, nChans);
  79. em.cCenters = rad2deg(em.cCenters);
  80. pred = sin(0.5*em.x).^em.sinPower; % hypothetical channel responses
  81. pred = wshift('1D',pred,3); % shift the initial basis function
  82. basisSet = nan(nChans,nBins);
  83. for c = 1:nChans
  84. basisSet(c,:) = wshift('1D',pred,-c+1); % generate circularly shifted basis functions
  85. end
  86. em.basisSet = basisSet;
  87. eegs = EEG.data;%(:,:,EEG.index);
  88. posBin = posBin';
  89. em.posBin = posBin;
  90. % Grab data------------------------------------------------------------
  91. % Shift So that highprob loctions are catogorized into bin1
  92. em.nTrials = length(posBin); nTrials = em.nTrials; % # of good trials
  93. nTimes = length(times);
  94. %----------------------------------------------------------------------
  95. % Preallocate Matrices
  96. tf_evoked = nan(nFreqs,nIter,nSamps,nBlocks,nChans); tf_total = tf_evoked;
  97. C2_evoked = nan(nFreqs,nIter,nSamps,nBlocks,nBins,nChans); C2_total = C2_evoked;
  98. em.blocks = nan(nTrials,nIter);
  99. eegs = permute(eegs,[3 1 2]);%
  100. nPoint = length(eegs);
  101. epoch_index = dsearchn(EEG.times',times');
  102. % Loop through each frequency
  103. for f = 1:nFreqs
  104. tic % start timing frequency loop
  105. fprintf('Frequency %d out of %d\n', f, nFreqs)
  106. % Filter Data
  107. fdata_evoked = nan(nTrials,nElectrodes,nPoint);
  108. fdata_total = nan(nTrials,nElectrodes,nPoint);
  109. tic
  110. parfor c = 1:nElectrodes
  111. %fdata_total(:,c,:) = (eegfilt(squeeze((eegs(:,c,:))),Fs,freqs(f,1),freqs(f,2))')';
  112. disp(c)
  113. fdata_evoked(:,c,:) = hilbert(eegfilt(squeeze((eegs(:,c,:))),Fs,freqs(f,1),freqs(f,2))')';
  114. fdata_total(:,c,:) = abs(hilbert(eegfilt(squeeze((eegs(:,c,:))),Fs,freqs(f,1),freqs(f,2))')').^2;
  115. % fdata_total(:,c,:) = eegfilt(squeeze(eegs(:,c,:)),Fs,freqs(1,1),freqs(1,2));% instantaneous power calculated here for induced activity.
  116. end
  117. toc
  118. fdata_total = fdata_total(:,:,epoch_index);
  119. fdata_evoked = fdata_evoked(:,:,epoch_index);
  120. for iter = 1:nIter
  121. blocks = nan(size(posBin));
  122. shuffBlocks = nan(size(posBin));
  123. % count number of trials within each position bin
  124. clear binCnt %bincnt = bin count
  125. for bin = 1:nBins
  126. binCnt(bin) = sum(posBin == bin);%%
  127. end
  128. minCnt = min(binCnt); %
  129. nPerBin = floor(minCnt/nBlocks);
  130. % max # of trials such that the # of trials for each bin can be equated within each block
  131. shuffInd = randperm(nTrials)'; % create shuffle index
  132. shuffBin = posBin(shuffInd); % shuffle trial order
  133. for bin = 1:nBins
  134. idx = find(shuffBin == bin); % get index for trials belonging to the current bin%
  135. idx = idx(1:nPerBin*nBlocks); % drop excess trials
  136. x = repmat(1:nBlocks',nPerBin,1); shuffBlocks(idx) = x; % assign randomly order trials to blocks
  137. end
  138. % unshuffle block assignment ÕâÀïΪʲôҪunshuffle?
  139. blocks(shuffInd) = shuffBlocks;
  140. % save block assignment
  141. em.blocks(:,iter) = blocks; % block assignment
  142. em.nTrialsPerBlock = length(blocks(blocks == 1)); % ÌáÈ¡³öÿ¸öblockÖÐÓжàÉÙ¸ötrial
  143. %-------------------------------------------------------------------------
  144. % Average data for each position bin across blocks
  145. posBins = 1:nBins;
  146. blockDat_evoked = nan(nBins*nBlocks,nElectrodes,nSamps); % averaged evoked data
  147. blockDat_total = nan(nBins*nBlocks,nElectrodes,nSamps); % averaged total data
  148. labels = nan(nBins*nBlocks,1); % bin labels for averaged data
  149. blockNum = nan(nBins*nBlocks,1); % block numbers for averaged data
  150. c = nan(nBins*nBlocks,nChans); % predicted channel responses for averaged data
  151. bCnt = 1;
  152. for ii = 1:nBins
  153. for iii = 1:nBlocks
  154. blockDat_evoked(bCnt,:,:) = abs(squeeze(mean(fdata_evoked(posBin==posBins(ii) & blocks==iii,:,:),1))).^2;
  155. blockDat_total(bCnt,:,:) = squeeze(mean(fdata_total(posBin==posBins(ii) & blocks==iii,:,:),1));
  156. % blockDat_total(bCnt,:,:); = squeeze(mean(fdata_total;(posBin==posBins(1) & blocks==1,:,:),1));
  157. labels(bCnt) = ii;
  158. blockNum(bCnt) = iii;
  159. c(bCnt,:) = basisSet(ii,:);
  160. bCnt = bCnt+1;
  161. end
  162. end
  163. parfor t = 1:nSamps
  164. % grab data for timepoint t
  165. toi = ismember(times,times(t)-em.window/2:times(t)+em.window/2); % time window of interest
  166. de = squeeze(mean(blockDat_evoked(:,:,toi),3)); % evoked data
  167. dt = squeeze(mean(blockDat_total(:,:,toi),3)); % total data
  168. % Do forward model
  169. for i=1:nBlocks % loop through blocks, holding each out as the test set
  170. trnl = labels(blockNum~=i); % training labels
  171. tstl = labels(blockNum==i); % test labels
  172. %-----------------------------------------------------%
  173. % Analysis on Evoked Power %
  174. %-----------------------------------------------------%
  175. B1 = de(blockNum~=i,:); % training data
  176. B2 = de(blockNum==i,:); % test data
  177. C1 = c(blockNum~=i,:); % predicted channel outputs for training data
  178. W = C1\B1;% estimate weight matrix
  179. C2 = (W'\B2')'; % estimate channel responses
  180. C2_evoked(f,iter,t,i,:,:) = C2; % save the unshifted channel responses
  181. % shift eegs to common center
  182. n2shift = ceil(size(C2,2)/2);
  183. for ii=1:size(C2,1)
  184. [~, shiftInd] = min(abs(posBins-tstl(ii)));
  185. C2(ii,:) = wshift('1D', C2(ii,:), shiftInd-n2shift-1);
  186. end
  187. tf_evoked(f,iter,t,i,:,:) = mean(C2,1); % average shifted channel responses
  188. %-----------------------------------------------------%
  189. % Analysis on Total Power %
  190. %-----------------------------------------------------%
  191. B1 = dt(blockNum~=i,:); % training data
  192. B2 = dt(blockNum==i,:); % test data
  193. C1 = c(blockNum~=i,:); % predicted channel outputs for training data
  194. W = C1\B1; % estimate weight matrix
  195. C2 = (W'\B2')'; % estimate channel responses
  196. C2_total(f,iter,t,i,:,:) = C2;
  197. % shift eegs to common center
  198. n2shift = ceil(size(C2,2)/2);
  199. for ii=1:size(C2,1)
  200. [~, shiftInd] = min(abs(posBins-tstl(ii)));
  201. C2(ii,:) = wshift('1D', C2(ii,:), shiftInd-n2shift-1);
  202. end
  203. tf_total(f,iter,t,i,:) = mean(C2,1);
  204. C2_total_shifted(f,iter,t,i,:,:) = C2;
  205. % average shifted channel responses
  206. %-----------------------------------------------------%
  207. end
  208. end
  209. end
  210. toc % stop timing the frequency loop
  211. end
  212. %tf_total_mean = squeeze(mean(mean(tf_total,2),4));
  213. fName = ['save path\' filesep sublist{subno}(1:end)];
  214. em.C2_total_shifted = C2_total_shifted;
  215. em.tfs.evoked = tf_evoked;
  216. em.tfs.total = tf_total;
  217. em.nBlocks = nBlocks;
  218. save(fName,'em','-v7.3');
  219. end

Fig.2b.m, no license · at the source

Overview

Authors: Sirui Chen1,2, Xin Zhang3, Xinyu Li3, Ole Jensen4, Jan Theeuwes5, Benchi Wang1,2
  1. 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
  2. Institute for Brain Research and Rehabilitation, South China Normal University,Guangzhou, China
  3. Department of Psychology, Zhejiang Normal University,Jinhua, China
  4. Department of Psychiatry and Experimental Psychology, University of Oxford,Oxford, United Kingdom
  5. Department of Experimental and Applied Psychology, Vrije Universiteit Amsterdam,Amsterdam, the Netherlands
Journal: Nature communications, volume 17, issue 1, article 7091
Dates: received 2 February 2025; accepted 22 May 2026; published online 2 June 2026
Type: Research article · Language: English
License: CC BY-NC-ND
Identifiers: DOI 10.1038/s41467-026-73916-1 · PMID 42230612 · PMCID PMC13392092 · OpenAlex W7163176395
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: EEG (modality), human (organism), cognitive (subfield)
Methods: Spectral & time-frequency, Statistics, Smoothing, state filtering, decompositions, Machine learning, Preprocessing, Physiology & signal measures, Connectivity
Keywords: Human behaviour, Saccades, Attention
MeSH: Attention*, Learning*, Saccades*, Adult, Electroencephalography, Female, Humans, Male, Photic Stimulation, Reaction Time, Young Adult (* major topic)
Topic: Generative Adversarial Networks and Image Synthesis (Computer Vision and Pattern Recognition, Computer Science), according to OpenAlex
Funding: Wellcome Trust (227420)
Citations: not cited yet (Europe PMC); 65 references in the paper

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

License: none: the authors keep all their rights
State: the link answers, verified on 27 September 2026
Evidence: files inventoried
Languages: MATLAB (7), R (5), Python (1)
Size: 30 files, 13 scripts
Software Heritage: not checked
Found in: “Code availability”
Holds: README
Not found: license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 27 September 2026: the link answers (HTTP 200)
  • 27 September 2026: the link answers (HTTP 200)
14 files
At the source:

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://doi.org/10.1038/s41467-026-73916-1

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 Publishing Group},
issn = {2041-1723},
doi = {10.1038/s41467-026-73916-1},
url = {https://doi.org/10.1038/s41467-026-73916-1},
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/06/02
VL - 17
IS - 1
SP - 7091
SN - 2041-1723
PB - Nature Publishing Group
DO - 10.1038/s41467-026-73916-1
UR - https://doi.org/10.1038/s41467-026-73916-1
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s41467-026-73916-1",
"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": "Nat Commun",
"volume": "17",
"issue": "1",
"page": "7091",
"DOI": "10.1038/s41467-026-73916-1",
"PMID": "42230612",
"PMCID": "PMC13392092",
"ISSN": "2041-1723",
"publisher": "Nature Publishing Group",
"URL": "https://doi.org/10.1038/s41467-026-73916-1",
"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: eLife
In 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 Neuroscience
In 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 America
In 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: eLife
In 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 communications
In 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 neurobiology
In 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 biology
In 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 biology
In 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 biology
In 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: eNeuro
In 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.

Add the badge to the code's README

OSCR: the badge of this paper

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 -->
[![OSCR](https://openscicode.org/badge/doi/10.1038/s41467-026-73916-1.svg)](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:end
HTML
<!-- 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.