Dynamic competition between bottom-up saliency and top-down goals in early visual cortex.
One block of code here has 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 1 match
- [1] § Methods › Eye-tracking analysis ↔ mkj6s/Part6_GazeBias.m, lines 90 to 148 · score 0.54 · saccade trials, head, dva, block, gaze, eye · block
oscr:b:GG3QKHZRD0QJ5-H· 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 · 334 lines · 15 KB · no license · 1 match
- %% Dissociating External and Internal Attentional Selection | ANALYSIS
- % RIFT Analysis | PreCue | part 5 of 5
- %
- % This file
- % - imports and preprocesses gaze position data (blink_correction, saccade removal, baselining)
- %
- % Requirements
- % - list of participants (corresponding to directory names) at the start
- % - directory for eeg_matrix and saving in lines 24,
- %
- % Outputs (if saving is on, saved in saved/"participant")
- % -
- %% Settings
- close all; clear all; clc;
- addpath(genpath("C:\Users\wang0175\Desktop\Data analysis\Step3_Gazebias\eyetracking analysis")) % add data and helper functions
- % Collection info
- f_s = 500; % Hz
- trial_latency = [0, 2.5]; % sec, has to include 0 % 0 means placeholder onset
- % Screen info
- dist_from_screen = 72; screen_dim = [48 27.2]; % cm
- screen_pxs = [1920 1080];
- screen_dva = rad2deg(2*atan((0.5*screen_dim)/dist_from_screen));
- dva_per_px = screen_dva(1)/screen_pxs(1);
- dir='C:\Users\wang0175\Desktop\Data analysis\Step3_Gazebias\eyelinkdata\';
- participants = ["03","04","05","06","07","08","09","10","11","12","13","17","18","20","21","22","S1","S2","S3","S4","S5","S7","S8","S9"];
- %% Import eyetracking data
- disp("(1/7) Importing data from edf files");
- for p = 1:length(participants)
- disp("Participant "+char(participants(p))+" of "+num2str(length(participants)));
- % Import data
- filename =dir+participants(p)+'.edf';
- edf_data{p} = Edf2Mat(char(filename));
- end
- % save('original_eyetracking_data.mat', 'edf_data', '-v7.3');
- %% Convert into a big matrix
- disp("(2/7) Converting edf into a matrix");
- x_data_blinkcorrected = []; y_data_blinkcorrected = [];
- % Trial number info
- for p = 1:length(participants)
- triggers{p} = find(strncmpi(edf_data{1, p}.Events.Messages.info, "Trial", 5)); % ignore triggers during calibration
- num_trials(p) = length(triggers{p});
- for eye = 1:2
- x_data_blinkcorrected{1, p}(eye, :) = draft_blink_edge_correction(edf_data{1, p}.Samples.pupilSize(:, eye)', edf_data{1, p}.Samples.posX(:, eye)', 500);
- y_data_blinkcorrected{1, p}(eye, :) = draft_blink_edge_correction(edf_data{1, p}.Samples.pupilSize(:, eye)', edf_data{1, p}.Samples.posY(:, eye)', 500);
- end
- disp("Done blink correction for participant "+char(participants(p))+" of "+num2str(length(participants)));
- end
- % Are all trial numbers same?
- if nnz(diff(num_trials))
- disp("Warning: Unequal numbers of trials across participants");
- end
- %%
- x_pos_unmatched = zeros(num_trials(1), floor(sum(abs(trial_latency))*f_s), 2, length(participants)); % both eyes
- y_pos_unmatched = x_pos_unmatched; % trials x timepoints x eyes x participants
- % Extract position traces and store
- for p = 1:length(participants)
- for tr = 1:num_trials(1)
- trig = triggers{p}(tr);
- % Start time as per trigger
- [~, trig_time_idx(tr)] = min(abs(edf_data{1, p}.Samples.time - edf_data{1, p}.Events.Messages.time(1, trig)));
- % Start and end times
- start_t = trig_time_idx(tr) + floor(trial_latency(1)*f_s);
- end_t = start_t + floor(sum(abs(trial_latency))*f_s) - 1;
- % Extract position
- for eye = 1:2
- x_pos_unmatched(tr, :, eye, p) = x_data_blinkcorrected{p}(eye ,start_t:end_t, :);
- y_pos_unmatched(tr, :, eye, p) = y_data_blinkcorrected{p}(eye, start_t:end_t, :);
- end
- end
- disp("Extract position traces and store "+char(participants(p))+" of "+num2str(length(participants)));
- end
- save('x_pos_unmatched', 'x_pos_unmatched', '-v7.3');
- save('y_pos_unmatched', 'y_pos_unmatched', '-v7.3');
- %% Mark trials with saccades
- % Collection info
- clear all;clc;
- load('y_pos_unmatched.mat');
- load('x_pos_unmatched.mat');
- x_pos_unmatched(577:864, :, :, 16) = NaN;
- y_pos_unmatched(577:864, :, :, 16) = NaN;
- x_pos_unmatched(721:864, :, :, 17) = NaN;
- y_pos_unmatched(721:864, :, :, 17) = NaN;
- % Screen info
- dir='C:\Users\wang0175\Desktop\Data analysis\Step3_Gazebias\eyelinkdata\';
- participants = ["03","04","05","06","07","08","09","10","11","12","13","17","18","20","21","22","S1","S2","S3","S4","S5","S7","S8","S9"];
- disp("(3/7) Marking trials with saccades");
- f_s = 500; % Hz
- trial_latency = [0, 2.5]; % sec, has to include 0 % 0 means placeholder onset
- num_trials=size(x_pos_unmatched);
- % Screen info
- dist_from_screen = 72; screen_dim = [48 27.2]; % cm
- screen_pxs = [1920 1080];
- screen_dva = rad2deg(2*atan((0.5*screen_dim)/dist_from_screen));
- dva_per_px = screen_dva(1)/screen_pxs(1);
- % Parameter
- % s
- screen_pxs = [1920 1080];
- saccade_threshold = 3.5; %dva
- x_deviation = []; y_deviation = []; eccentricities_px = []; saccade_thresh_dur = 0.05;
- % Identify timepoints exceeding threshold
- for p = 1:size(x_pos_unmatched,4)
- for eye = 1:2
- x_deviation(:, :, eye, p) = x_pos_unmatched(:, [floor(1.2*f_s):floor(2.4*f_s)], eye, p) - mean(x_pos_unmatched(:, :, eye, p), "all", "omitnan");
- y_deviation(:, :, eye, p) = y_pos_unmatched(:, [floor(1.2*f_s):floor(2.4*f_s)], eye, p) - mean(y_pos_unmatched(:, :, eye, p), "all", "omitnan");
- eccentricities_px(:, :, eye, p) = sqrt(x_deviation(:, :, eye, p).^2 + y_deviation(:, :, eye, p).^2);
- end
- end
- points_beyond_threshold = eccentricities_px > (saccade_threshold/dva_per_px);
- % Average eyes
- eyes_averaged = mean(points_beyond_threshold, 3);
- saccade_trials = zeros(num_trials(1), length(participants));
- for p = 1:length(participants)
- for tr = 1:num_trials(1)
- saccade_trials(tr, p) = (nnz(eyes_averaged(tr, :, p)) > saccade_thresh_dur*f_s);
- end
- disp("--- Participant "+char(participants(p))+" made saccades in "+num2str(nnz(saccade_trials(:, p)/num_trials(1)))+" trials out of "+num_trials(1))
- end
- saccade_trials(577:864, 16)=1;
- saccade_trials(721:864, 17)=1;
- xxx=sum(saccade_trials);
- save('C:\Users\wang0175\Desktop\Data analysis\Step2 coherence without saccade\saccade_trials1.mat', 'saccade_trials');
- % 单独分析第五和第六和block 对于第16个被试
- % 若是第16个被试,将第577-864个试次设为 NaN (fifth and sixth move head)
- % xxx= squeeze(mean(eccentricities_px,3));
- % xxx=squeeze(mean(xxx,2))*dva_per_px;
- %%
- load('y_pos_unmatched.mat');
- load('x_pos_unmatched.mat');
- % % 设置参数
- bad_trials_16 = 577:864;
- time_window = floor(1.2*f_s):floor(2.4*f_s);
- %
- % % 初始化
- % x_deviation_bad = NaN(length(bad_trials_16), length(time_window), 2); % trial × time × eye
- % y_deviation_bad = NaN(length(bad_trials_16), length(time_window), 2);
- % eccentricities_bad_px = NaN(length(bad_trials_16), length(time_window), 2);
- %
- % 被试编号
- p = 16;
- for eye = 1:2
- % 取出原始位置
- x_data = squeeze(x_pos_unmatched(bad_trials_16, time_window, eye, p));
- y_data = squeeze(y_pos_unmatched(bad_trials_16, time_window, eye, p));
- % 计算去均值后的偏移量
- x_dev = x_data - mean(x_data, 'all', 'omitnan');
- y_dev = y_data - mean(y_data, 'all', 'omitnan');
- % 保存
- x_deviation_bad(:, :, eye) = x_dev;
- y_deviation_bad(:, :, eye) = y_dev;
- eccentricities_bad_px(:, :, eye) = sqrt(x_dev.^2 + y_dev.^2);
- end
- % 参数
- bad_trials_16 = 577:864;
- p = 16; % 第16个被试
- threshold_px = saccade_threshold / dva_per_px;
- % 只针对这部分试次计算是否超过阈值
- points_beyond_threshold = eccentricities_px(bad_trials_16, :, :, p) > threshold_px;
- % 对双眼取平均
- eyes_averaged = mean(points_beyond_threshold, 3); % size: [288, time]
- % 初始化结果
- saccade_trials_16 = zeros(length(bad_trials_16), 1);
- % 计算每个试次是否为扫视试次
- for i = 1:length(bad_trials_16)
- saccade_trials_16(i) = nnz(eyes_averaged(i, :)) > saccade_thresh_dur * f_s;
- end
- % 输出统计
- disp("Participant 16 made saccades in " + num2str(nnz(saccade_trials_16)) + ...
- " trials out of " + num2str(length(bad_trials_16)) + " (trials 577-864)")
- %
- % % %% Mark trials with NaNs/blinks
- % % load ('x_pos_unmatched.mat');
- % % load('y_pos_unmatched.mat');
- % % f_s = 500; % Hz
- % % trial_latency = [0, 2.5]; % sec, has to include 0 % 0 means placeholder onset
- % % x_pos_uncorrected=[];
- % % y_pos_uncorrected=[];
- % % % Screen info
- % % dist_from_screen = 72; screen_dim = [48 27.2]; % cm
- % screen_pxs = [1920 1080];
- % participants = ["01","03","04","05","06","07","08","09","10","11","12","13","14","15","17","18","20","21","22"];%02 single eye, others no eyelink data
- % for p = 1:size(x_pos_unmatched,4)
- % for tr = 1:size(x_pos_unmatched,1)
- % x_pos_uncorrected(tr, :, :, p) = x_pos_unmatched(tr, : ,:, p);
- % y_pos_uncorrected(tr, :, :, p) = y_pos_unmatched(tr, :, :, p);
- % end
- % end
- % disp("(3/7) Marking trials with NaNs");
- %
- % % Identify timepoints exceeding threshold
- % for p = 1:length(participants)
- % for tr = 1:size(x_pos_unmatched, 1)
- % nan_or_not = anynan(x_pos_uncorrected(tr, :, :, p));
- % nan_trials(tr, p) = nan_or_not;
- % end
- % disp("--- Participant "+num2str(p)+" had NaNs in "+num2str(nnz(nan_trials(:, p)/size(x_pos_unmatched, 1)))+" trials out of "+size(x_pos_unmatched, 1))
- % nan_trials_p = nan_trials(:, p);
- % end
- %
- %
- % %% NaN Corrections
- %
- % min_nan_length = 0.02; % sec, patches < this will be interpolated
- %
- % % Prepare variables
- % x_pos_unbaselined = x_pos_uncorrected; y_pos_unbaselined = y_pos_uncorrected;
- % disp("(5/7) Interpolating short periods of NaNs")
- %
- % % Interpolate patches that are small enough
- % fix_counter = 0;
- % for p = 1:length(participants)
- % counter_sh = 0; counter_lo = 0;
- % for tr = 1:size(x_pos_unmatched,1)
- % nans_logical = isnan(squeeze(x_pos_uncorrected(tr, :, :, 1)));
- %
- % for eye = 1:2
- % state_changes = diff([0 nans_logical(:, eye)' 0]); % when this is 1/-1, a NaN block has started/ended
- %
- % % Find NaN start/ends
- % idxs_NaN_starts{tr} = find(state_changes==1);
- % idxs_NaN_ends{tr} = find(state_changes==-1);
- %
- % % If NaNs are present,
- % if ~isempty(idxs_NaN_starts{tr})
- % % then for each NaN block,
- % for i = 1:length(idxs_NaN_starts{tr})
- % % which is within acceptable range,
- % block_length = idxs_NaN_ends{tr}(i)-idxs_NaN_starts{tr}(i);
- %
- % if block_length < min_nan_length*f_s
- % % interpolate the block.
- % fix_counter = fix_counter + 1;
- %
- % if idxs_NaN_starts{tr}(i) == 1
- % % if trial start is already a NaN, interpolate with block end point
- % x_pos_unbaselined(tr, idxs_NaN_starts{tr}(i):idxs_NaN_ends{tr}(i)-1, eye, p) = ...
- % linspace(x_pos_uncorrected(tr, idxs_NaN_ends{tr}(i), eye, p), x_pos_uncorrected(tr, idxs_NaN_ends{tr}(i), eye, p), block_length);
- % y_pos_unbaselined(tr, idxs_NaN_starts{tr}(i):idxs_NaN_ends{tr}(i)-1, eye, p) = ...
- % linspace(y_pos_uncorrected(tr, idxs_NaN_ends{tr}(i), eye, p), y_pos_uncorrected(tr, idxs_NaN_ends{tr}(i), eye, p), block_length);
- %
- % elseif idxs_NaN_ends{tr}(i) == length(state_changes)
- % % if trial end is a NaN, interpolate with block start point
- % x_pos_unbaselined(tr, idxs_NaN_starts{tr}(i):idxs_NaN_ends{tr}(i)-1, eye, p) = ...
- % linspace(x_pos_uncorrected(tr, idxs_NaN_starts{tr}(i)-1, eye, p), x_pos_uncorrected(tr, idxs_NaN_starts{tr}(i)-1, eye, p), block_length);
- % y_pos_unbaselined(tr, idxs_NaN_starts{tr}(i):idxs_NaN_ends{tr}(i)-1, eye, p) = ...
- % linspace(y_pos_uncorrected(tr, idxs_NaN_starts{tr}(i)-1, eye, p), y_pos_uncorrected(tr, idxs_NaN_starts{tr}(i)-1, eye, p), block_length);
- %
- % else
- % % if both start and end point are available
- % x_pos_unbaselined(tr, idxs_NaN_starts{tr}(i)-1:idxs_NaN_ends{tr}(i), eye, p) = ...
- % linspace(x_pos_uncorrected(tr, idxs_NaN_starts{tr}(i)-1, eye, p), x_pos_uncorrected(tr, idxs_NaN_ends{tr}(i), eye, p), block_length+2);
- % y_pos_unbaselined(tr, idxs_NaN_starts{tr}(i)-1:idxs_NaN_ends{tr}(i), eye, p) = ...
- % linspace(y_pos_uncorrected(tr, idxs_NaN_starts{tr}(i)-1, eye, p), y_pos_uncorrected(tr, idxs_NaN_ends{tr}(i), eye, p), block_length+2);
- %
- % end
- % end
- % end
- % end
- % end
- % end
- % end
- %
- % %%
- % %% Baseline Correction
- % disp("(6/7) Baseline correcting and converting to dva")
- %
- % % Baseline period
- % baseline_int = [0.2,1]; % sec, wrt. cue onset, + cue latency(1)
- % % Screen info
- % dist_from_screen = 72; screen_dim = [48 27.2]; % cm
- % screen_pxs = [1920 1080];
- % screen_dva = rad2deg(2*atan((0.5*screen_dim)/dist_from_screen));
- % dva_per_px = screen_dva(1)/screen_pxs(1);
- % % Prepare variables
- % x_pos_px = x_pos_unbaselined; y_pos_px = y_pos_unbaselined;
- %
- % x_pos_px = x_pos_unbaselined - repmat(mean(x_pos_unbaselined(:, floor(baseline_int(1)*f_s):floor(baseline_int(2)*f_s), :, :), 2, "omitnan"), 1, size(x_pos_unbaselined, 2), 1, 1);
- % y_pos_px = y_pos_unbaselined - repmat(mean(y_pos_unbaselined(:, floor(baseline_int(1)*f_s):floor(baseline_int(2)*f_s), :, :), 2, "omitnan"), 1, size(y_pos_unbaselined, 2), 1, 1);
- %
- % % DVA conversion
- % x_pos_dva = x_pos_px.*dva_per_px;
- % y_pos_dva = y_pos_px.*dva_per_px;
- %
- %
- % % Note trials with outlier baselines
- % baseline_outlier_trials = [];
- % for p = 1:length(participants)
- % baselines = mean(x_pos_unbaselined(:, floor(baseline_int(1)*f_s):floor(baseline_int(2)*f_s), :, :), 2, "omitnan");
- % baselines_avgd = squeeze(mean(baselines(:, :, :, p), 3, "omitnan"));
- % baselines_y = mean(y_pos_unbaselined(:, floor(baseline_int(1)*f_s):floor(baseline_int(2)*f_s), :, :), 2, "omitnan");
- % baselines_avgd_y = squeeze(mean(baselines_y(:, :, :, p), 3, "omitnan"));
- %
- % % Find stdev
- % threshold = 2*std(baselines_avgd, "omitnan"); avg_base = mean(baselines_avgd, "omitnan");
- % threshold_y = 2*std(baselines_avgd_y, "omitnan"); avg_base_y = mean(baselines_avgd_y, "omitnan");
- %
- % % Trial idxs
- % baseline_outlier = ((baselines_avgd) > (avg_base + threshold)) | ((baselines_avgd) < (avg_base - threshold));
- % baseline_outlier_y = ((baselines_avgd_y) > (avg_base_y + threshold_y)) | ((baselines_avgd_y) < (avg_base_y - threshold_y));
- %
- % baseline_outlier_trials(:, p) = baseline_outlier | baseline_outlier_y;
- % end
- % %%
Part6_GazeBias.m, no license · at the source
Overview
- Department of Experimental Psychology, Helmholtz Institute, Utrecht University,Utrecht, Netherlands
- Department of Experimental and Applied Psychology, Vrije Universiteit Amsterdam,Amsterdam, Netherlands
- Institute Brain and Behavior Amsterdam (iBBA), Amsterdam, Netherlands
- William James Center for Research, ISPA-Instituto Universitario,Lisbon, Portugal
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 1 match between paragraphs and lines of code.
OSF szuxa
Availability: 1 check, the latest on 29 September 2026: the link answers (HTTP 200)
- 29 September 2026: the link answers (HTTP 200)
9 files
- mkj6s/
Part1_behavioral analysis.m , MATLAB, 101 lines - mkj6s/
Part2_EEG_preprocessing. , MATLAB, 224 linesm - mkj6s/
Part3_coherence_eegmatri , MATLAB, 118 linesx_60Hz.m - mkj6s/
Part3_coherence_eegmatri , MATLAB, 89 linesx_64Hz.m - mkj6s/
Part4_location_coherence , MATLAB, 146 lines_60Hz.m - mkj6s/
Part4_location_coherence , MATLAB, 130 lines_64Hz.m - mkj6s/
Part5_topsix_condition_6 , MATLAB, 186 lines0.m - mkj6s/
Part5_topsix_condition_6 , MATLAB, 188 lines4.m - mkj6s/
Part6_GazeBias.m , MATLAB, 334 lines, 1 match
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 szuxa
Read it in the paper: doi.org/10.1038/s42003-026-09992-2.
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;
- 9 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 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:
- it says that the data are available on request
Read it in the paper: doi.org/10.1038/s42003-026-09992-2.
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, 29 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 6 authors, 2 keywords, 9 MeSH terms, 2 funders, 46 references.
Cite
This paper
Wang, D., Arora, K., Theeuwes, J., Van der Stigchel, S., Gayet, S., & Chota, S. (2026). Dynamic competition between bottom-up saliency and top-down goals in early visual cortex. Communications biology, 9(1), 779. https://
BibTeX
@article{wang2026dynamic
author = {Wang, Dan and Arora, Kabir and Theeuwes, Jan and Van der Stigchel, Stefan and Gayet, Surya and Chota, Samson},
title = {{Dynamic competition between bottom-up saliency and top-down goals in early visual cortex}},
journal = {Communications biology},
year = {2026},
month = apr,
volume = {9},
number = {1},
pages = {779},
publisher = {Nature Portfolio},
issn = {2399-3642},
doi = {10.1038/
url = {https://
pmid = {41957277},
pmcid = {PMC13249964}
}
RIS
TY - JOUR
AU - Wang, Dan
AU - Arora, Kabir
AU - Theeuwes, Jan
AU - Van der Stigchel, Stefan
AU - Gayet, Surya
AU - Chota, Samson
TI - Dynamic competition between bottom-up saliency and top-down goals in early visual cortex
T2 - Communications biology
J2 - Commun Biol
PY - 2026
DA - 2026/
VL - 9
IS - 1
SP - 779
SN - 2399-3642
PB - Nature Portfolio
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "Dynamic competition between bottom-up saliency and top-down goals in early visual cortex",
"container-title": "Communications biology",
"author": [
{
"family": "Wang",
"given": "Dan"
},
{
"family": "Arora",
"given": "Kabir"
},
{
"family": "Theeuwes",
"given": "Jan"
},
{
"family": "Van der Stigchel",
"given": "Stefan"
},
{
"family": "Gayet",
"given": "Surya"
},
{
"family": "Chota",
"given": "Samson"
}
],
"container-title-short":
"volume": "9",
"issue": "1",
"page": "779",
"DOI": "10.1038/
"PMID": "41957277",
"PMCID": "PMC13249964",
"ISSN": "2399-3642",
"publisher": "Nature Portfolio",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
9
]
]
}
}
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.1016/j.isci.2025.112282 [code]
- Dissociating external and internal attentional selection.Journal: iScienceIn common: FieldTrip, Statistics and Machine Learning Toolbox, 12 references, author Surya Gayet
- [2] doi:10.1038/s42003-025-08321-3 [code]
- Guided visual search is associated with target boosting and distractor suppression in early visual cortex.Journal: Communications biologyIn common: FieldTrip, Statistics and Machine Learning Toolbox, 13 references
- [3] 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: FieldTrip, Statistics and Machine Learning Toolbox, 11 references
- [4] doi:10.1162/nol_a_00171 [code]
- Using Rapid Invisible Frequency Tagging (RIFT) to Probe the Neural Interaction Between Representations of Speech Planning and Comprehension.Journal: Neurobiology of language (Cambridge, Mass.)In common: FieldTrip, EEG, 11 references
- [5] doi:10.7554/elife.98304
- Neural mechanisms of learned suppression uncovered by probing the hidden attentional priority map.Journal: eLifeIn common: EEG, 8 references, author Jan Theeuwes
- [6] doi:10.1038/s41467-026-73916-1 [code]
- Learned statistical regularity modulates anticipatory micro-saccades toward suppressed distractor locations.Journal: Nature communicationsIn common: Statistics and Machine Learning Toolbox, EEG, 7 references, author Jan Theeuwes
- [7] doi:10.1162/imag_a_00242 [code]
- Perceptual foundation and extension to phase tagging for rapid invisible frequency tagging (RIFT).Journal: Imaging neuroscience (Cambridge, Mass.)In common: FieldTrip, EEG, 8 references
- [8] doi:10.7554/elife.101733 [code]
- Proactive distractor suppression in early visual cortex.Journal: eLifeIn common: 5 references, author Jan Theeuwes
- [9] doi:10.1016/j.neuroimage.2023.120389
- Optimal parameters for rapid (invisible) frequency tagging using MEG.Journal: NeuroImageIn common: EEG, 9 references
- [10] doi:10.7554/elife.91327 [code]
- Early parafoveal semantic integration in natural reading.Journal: eLifeIn common: FieldTrip, Statistics and Machine Learning Toolbox, 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, 9 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:5aeb617076c7945a…
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/s42003-026-09992-2)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.1038/s42003-026-09992-2.svg
:target: https://openscicode.org/badge/doi/10.1038/s42003-026-09992-2
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1038/s42003-026-09992-2"><img src="https://openscicode.org/badge/doi/10.1038/s42003-026-09992-2.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.
