OSCR

Digit-tracking reveals curiosity-driven visual attention in macaque monkeys.

Code ↔ Paper

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

5 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 6 matches · 2 of them tie a paragraph to a whole file without given lines: weak matches, whose lines are not tinted
  1. [1] § Methods › The convolutional neural network model ↔ 03_CNN_Prediction/PredictSaliency.m, lines 2 to 41 · score 0.76 · Convolutional Neural Network, AlexNet, saliency map, layer, prediction, CNN · block oscr:b:1MQ9R9XCTT8TQ-6 · Report a mismatch
  2. [2] § Methods › Digit-tracking method ↔ 01_Task/DIGITRACK_SetB.m, lines 10 to 24 · score 0.57 · aperture window, Gaussian blur, picture, resolution, distance, exploration · block oscr:b:0Q1WC1776T92M-Y · Report a mismatch
  3. [3] § Methods › Digit-tracking method ↔ 01_Task/DIGITRACK_DEMO.m, lines 10 to 24 · score 0.56 · aperture window, Gaussian blur, picture, resolution, distance, exploration · block oscr:b:SW7H5AV1H43ZY-I · Report a mismatch
  4. [4] § Results › Digit-tracking captures features predicted by models ↔ 03_CNN_Prediction/PredictSaliency.m, lines 2 to 41 · score 0.55 · Convolutional Neural Network, CNN predictions, saliency, human, maps · block oscr:b:1MQ9R9XCTT8TQ-6 · Report a mismatch
  5. [5] § Methods › Attention maps ↔ 02_Attention_Map/filter_2d_heat_map.m, the whole file · a weak match · score 0.51 · heat maps, density, kernel, Attention maps, Gaussian · block oscr:b:F7MJZPK1JDFPC-9 · Report a mismatch
  6. [6] § Methods › Attention maps ↔ 02_Attention_Map/filter_3d_heat_map.m, the whole file · a weak match · score 0.51 · heat maps, density, kernel, Attention maps, Gaussian · block oscr:b:1JRSDZRXAYFSE-E · 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 · 228 lines · 9.9 KB · no license · 2 matches

  1. function [SALIENCY_MAP,SALIENCY_MAP_H,SALIENCY_MAP_M,SALIENCY_MAP_Mat,SALIENCY_MAP_Mav]=PredictSaliency(I,Levels,HFpenalty,prct_features)
  2. % PredictSaliency() - Makes a saliency map from an input image (I) using the
  3. % relu5 layer of the AlexNet Convolutional Neural Network (CNN) and weights
  4. % learned using a digit-tracking task and the wCORR method (Lio et al.
  5. % 2019) and weights estimated with the same method in an alternative dataset and with human and monkey explorations.
  6. % The input image is resized at the resolution of the CNN, or
  7. % sampled in a set of sub-images at the resolution of the CNN. Then
  8. % predicted saliency for each sub-images are assembled to produce a
  9. % saliency map for the whole image.
  10. %
  11. %
  12. % USAGES :
  13. % e.g.
  14. % [SALIENCY_MAP, SALIENCY_MAP_H, SALIENCY_MAP_M, SALIENCY_MAP_Mat, SALIENCY_MAP_Mav] = PredictSaliency(I,3,0.75,10)
  15. % % 3 pyramid levels, high frequency penalty=0.75, 10 percent for feature selection
  16. %
  17. %
  18. %
  19. % INPUTS:
  20. % -------
  21. % I = RGB image.
  22. % Levels (integer) = Number of levels in the pyramid. Default: 3. More levels = more detailed saliency prediction.
  23. % HFpenalty (0<HFpenalty<=1) = Default: 0.75. If 1 (no penalty). If <1, reduce the weight of the higher levels of the pyramid to obtain saliency prediction less biased on highly salient small details.
  24. % prct_features (percent) = Percentile threshold for attractive and avoided feature selection
  25. %
  26. %
  27. % OUTPUTS:
  28. % --------
  29. % SALIENCY_MAP (matrix) = Main saliency map with the dimensions of the input picture I.
  30. % SALIENCY_MAP_H (matrix) = Human-based weights saliency map.
  31. % SALIENCY_MAP_M (matrix) = Monkey-based weights saliency map.
  32. % SALIENCY_MAP_Mat (matrix) = Monkey attractive features saliency map.
  33. % SALIENCY_MAP_Mav (matrix) = Monkey avoided features saliency map.
  34. %
  35. % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  36. % Author : G. Lio
  37. % Centre de Neurosciences Cognitives, CNRS UMR 5229, Lyon, France
  38. % v1.0 2019
  39. % This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/4.0/ or send a letter to Creative Commons, PO Box 1866, Mountain View, CA 94042, USA.
  40. %
  41. % Legal code :
  42. % https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
  43. net = alexnet; % CNN used for features extraction
  44. load Wpredict.mat % Weights learned using the digit-tracking experiment described in the Lio, Duhamel, Sirigu, 2019 (Nat. Com.) paper.
  45. load WpredictDatabase2Z.mat % Weights learned using Human and Monkey digit-tracking data on a second picture database. Estimates where intra-picture Z-transformed to focus on weight relative activation in place of global weight activation (focus on feature choice than features absolute attraction and compensate for global less CNN activation in noiser attention-map estimates).
  46. switch nargin
  47. case 3
  48. FlagDisplay=1;
  49. case 2
  50. FlagDisplay=1;
  51. HFpenalty=0.75;
  52. case 1
  53. FlagDisplay=1;
  54. HFpenalty=0.75; % 1=no penalty <1= Reduce the saliency level of highly salient details.
  55. Levels=3; % pyramid levels / more levels=more detailed analysis of the picture
  56. end
  57. Output_resolution=[227 227]; % Images resolution = input resolution of the CNN
  58. Stride=75; % Overlap between windows.
  59. LevelCoeff=ones(1,Levels);
  60. if(Levels>1)
  61. for l=2:Levels
  62. LevelCoeff(l)=LevelCoeff(l-1).*HFpenalty;
  63. end
  64. end
  65. sPICT=size(I);
  66. %) superresolution images generation
  67. [OUT,COORD,W] = PyramidExp(I,Output_resolution,Levels,Stride);
  68. for LEV=1:Levels
  69. fprintf('>> Process Layer %d...\n',LEV);
  70. s=size(OUT{LEV});
  71. if(length(s)==3)
  72. nb_pict=1;
  73. else
  74. nb_pict=s(4);
  75. end
  76. RES{LEV}=zeros(Output_resolution(1).*LEV,Output_resolution(1).*LEV);
  77. RES_H{LEV}=zeros(Output_resolution(1).*LEV,Output_resolution(1).*LEV);
  78. RES_M{LEV}=zeros(Output_resolution(1).*LEV,Output_resolution(1).*LEV);
  79. RES_D{LEV}=zeros(Output_resolution(1).*LEV,Output_resolution(1).*LEV);
  80. RES_Mat{LEV}=zeros(Output_resolution(1).*LEV,Output_resolution(1).*LEV);
  81. RES_Mav{LEV}=zeros(Output_resolution(1).*LEV,Output_resolution(1).*LEV);
  82. for j=1:nb_pict
  83. %) Conv-Layer + RELU outputs
  84. act5 = activations(net,OUT{LEV}(:,:,:,j),'relu5','OutputAs','channels');
  85. sz = size(act5);
  86. act5 = reshape(act5,[sz(1) sz(2) 1 sz(3)]);
  87. %) Interp to the CNN input resolution
  88. act=squeeze(imresize(act5,[227 227]));
  89. %) Weighted combination of the channels
  90. idx1av=(WpredictM1<prctile(WpredictM1,prct_features));
  91. idx2av=(WpredictM2<prctile(WpredictM2,prct_features));
  92. idx3av=(WpredictM3<prctile(WpredictM3,prct_features));
  93. idx1at=(WpredictM1>prctile(WpredictM1,100-prct_features));
  94. idx2at=(WpredictM2>prctile(WpredictM2,100-prct_features));
  95. idx3at=(WpredictM3>prctile(WpredictM3,100-prct_features));
  96. WpredictM1av=abs(WpredictM1.*idx1av);
  97. WpredictM2av=abs(WpredictM2.*idx2av);
  98. WpredictM3av=abs(WpredictM3.*idx3av);
  99. WpredictM1at=WpredictM1.*idx1at;
  100. WpredictM2at=WpredictM2.*idx2at;
  101. WpredictM3at=WpredictM3.*idx3at;
  102. s=size(act);
  103. for i=1:s(3)
  104. if(i==1)
  105. learnedMapH1=act(:,:,i).*Wpredict(i);
  106. learnedMapH2=act(:,:,i).*WpredictH1(i);
  107. learnedMapM=act(:,:,i).*WpredictM1(i);
  108. learnedMapD=act(:,:,i).*WpredictDIFF(i);
  109. learnedMapMat=act(:,:,i).*WpredictM1at(i);
  110. learnedMapMav=act(:,:,i).*WpredictM1av(i);
  111. else
  112. learnedMapH1=learnedMapH1+act(:,:,i).*Wpredict(i);
  113. learnedMapH2=learnedMapH2+act(:,:,i).*WpredictH1(i);
  114. learnedMapM=learnedMapM+act(:,:,i).*WpredictM1(i);
  115. learnedMapD=learnedMapD+act(:,:,i).*WpredictDIFF(i);
  116. learnedMapMat=learnedMapMat+act(:,:,i).*WpredictM1at(i);
  117. learnedMapMav=learnedMapMav+act(:,:,i).*WpredictM1av(i);
  118. end
  119. end
  120. learnedMapH1=imresize(learnedMapH1,Output_resolution);
  121. learnedMapH2=imresize(learnedMapH2,Output_resolution);
  122. learnedMapM=imresize(learnedMapM,Output_resolution);
  123. learnedMapD=imresize(learnedMapD,Output_resolution);
  124. learnedMapMat=imresize(learnedMapMat,Output_resolution);
  125. learnedMapMav=imresize(learnedMapMav,Output_resolution);
  126. RES{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))=RES{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))+double(learnedMapH1);
  127. RES_H{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))=RES_H{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))+double(learnedMapH2);
  128. RES_M{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))=RES_M{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))+double(learnedMapM);
  129. RES_D{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))=RES_D{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))+double(learnedMapD);
  130. RES_Mat{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))=RES_Mat{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))+double(learnedMapMat);
  131. RES_Mav{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))=RES_Mav{LEV}(COORD{LEV}.x1(j):COORD{LEV}.x2(j),COORD{LEV}.y1(j):COORD{LEV}.y2(j))+double(learnedMapMav);
  132. end
  133. RES{LEV}=RES{LEV}./double(W{LEV});
  134. RES_H{LEV}=RES_H{LEV}./double(W{LEV});
  135. RES_M{LEV}=RES_M{LEV}./double(W{LEV});
  136. RES_D{LEV}=RES_D{LEV}./double(W{LEV});
  137. RES_Mat{LEV}=RES_Mat{LEV}./double(W{LEV});
  138. RES_Mav{LEV}=RES_Mav{LEV}./double(W{LEV});
  139. if(LEV==1)
  140. SALIENCY_MAP=imresize(RES{LEV},sPICT(1:2));
  141. SALIENCY_MAP_H=imresize(RES_H{LEV},sPICT(1:2));
  142. SALIENCY_MAP_M=imresize(RES_M{LEV},sPICT(1:2));
  143. SALIENCY_MAP_DIFF=imresize(RES_D{LEV},sPICT(1:2));
  144. SALIENCY_MAP_Mat=imresize(RES_Mat{LEV},sPICT(1:2));
  145. SALIENCY_MAP_Mav=imresize(RES_Mav{LEV},sPICT(1:2));
  146. else
  147. SALIENCY_MAP=SALIENCY_MAP+LevelCoeff(LEV).*imresize(RES{LEV},sPICT(1:2));
  148. SALIENCY_MAP_H=SALIENCY_MAP_H+LevelCoeff(LEV).*imresize(RES_H{LEV},sPICT(1:2));
  149. SALIENCY_MAP_M=SALIENCY_MAP_M+LevelCoeff(LEV).*imresize(RES_M{LEV},sPICT(1:2));
  150. SALIENCY_MAP_DIFF=SALIENCY_MAP_DIFF+LevelCoeff(LEV).*imresize(RES_D{LEV},sPICT(1:2));
  151. SALIENCY_MAP_Mat=SALIENCY_MAP_Mat+LevelCoeff(LEV).*imresize(RES_Mat{LEV},sPICT(1:2));
  152. SALIENCY_MAP_Mav=SALIENCY_MAP_Mav+LevelCoeff(LEV).*imresize(RES_Mav{LEV},sPICT(1:2));
  153. end
  154. end
  155. SALIENCY_MAP=SALIENCY_MAP./sum(LevelCoeff);
  156. SALIENCY_MAP_H=SALIENCY_MAP_H./sum(LevelCoeff);
  157. SALIENCY_MAP_M=SALIENCY_MAP_M./sum(LevelCoeff);
  158. SALIENCY_MAP_Mat=SALIENCY_MAP_Mat./sum(LevelCoeff);
  159. SALIENCY_MAP_Mav=SALIENCY_MAP_Mav./sum(LevelCoeff);
  160. end %// END FCT

PredictSaliency.m, no license · at the source

Overview

Authors: Yidong Yang1, Antoine Ameloot1, Guillaume Lio1,2, Angela Sirigu3, Jean-René Duhamel1
  1. Institut des Sciences Cognitives Marc Jeannerod, CNRS, UMR 5229, Université Claude Bernard Lyon, 67 Bd Pinel, 69675 Bron Cedex, France
  2. IMind Center of Excellence for Autism, Le Vinatier Hospital, Bron, France
  3. Institute of Neuroscience la Timone, UMR7289, CNRS, Aix-Marseille University, Marseille, France
Journal: Scientific reports, volume 16, issue 1, article 27117
Dates: received 27 September 2025; accepted 8 June 2026; published online 14 June 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1038/s41598-026-57654-4 · PMID 42288666 · PMCID PMC13527078 · OpenAlex W4414274204
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: behavior only (modality), human (organism), non-human primate (organism), cognitive (subfield)
Methods: Statistics, Connectivity, Graphs, Machine learning, Physiology & signal measures
Keywords: Neuroscience, Psychology
MeSH: Attention*, Exploratory Behavior*, Visual Perception*, Animals, Convolutional Neural Networks, Eye Movements, Eye-Tracking Technology, Humans, Macaca, Macaca mulatta, Male (* major topic)
Topic: Face Recognition and Perception (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Funding: Agence Nationale de la Recherche (ANR-20-CE37-0015); European Research Council (885746)
Citations: not cited yet (Europe PMC); 27 references in the paper

Abstract

We used digit-tracking, a touch-based method for assessing visual attention, to investigate spontaneous exploration in macaque monkeys. By engaging with degraded images on a touch-sensitive display, monkeys could uncover high-resolution portions through finger movements, allowing for natural and unrestricted interaction. Monkeys received juice rewards after touching a predetermined number of pixels, but no specific regions were targeted. Attention maps were generated from their interactions, along with data from human digit-tracking and monkey eye-tracking experiments. Direct comparisons across recording methods revealed that monkey digit-tracking attention maps were significantly correlated with both monkey eye-tracking and human digit-tracking maps, indicating shared patterns of visual exploration across species and devices. We further applied a saliency model and a Convolutional Neural Network (CNN) model to predict the empirical explorations. The correlation between model prediction maps and empirical attention maps indicated that monkeys focused non-randomly on information-rich regions, with the CNN model providing the most accurate predictions. These findings suggest that exploration was driven by intrinsic curiosity, beyond the extrinsic rewards for interaction. Digit-tracking offers a minimally invasive, portable alternative to eye-tracking, expanding research opportunities in visual cognition within ecologically valid settings.

Supplementary Information: The online version contains supplementary material available at https://doi.org/10.1038/s41598-026-57654-4.

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

Repositories

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

DirkBWalther/SaliencyToolbox

License: other
State: the link answers, verified on 27 September 2026
Evidence: files inventoried
Commit: 097daa42b51a4c7c8c1253408e260e9c94e6fa0f, 16 September 2023
Languages: MATLAB (72)
Size: 180 files, 72 scripts
Software Heritage: not archived
Found in: the text, “The saliency maps”
Holds: README, license file, documentation
Not found: CITATION.cff, environment file, tests, continuous integration
Tools: Image Processing Toolbox (10 files)
Availability: 1 check, the latest on 27 September 2026: the link answers
  • 27 September 2026: the link answers
75 files

OSF na4mv

License: none: the authors keep all their rights
State: the link answers, verified on 27 September 2026
Evidence: files inventoried
Languages: MATLAB (12)
Size: 25 files, 12 scripts
Software Heritage: not checked
Found in: “Data availability”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Tools: Psychtoolbox (5 files), Image Processing Toolbox (4 files)
Availability: 1 check, the latest on 27 September 2026: the link answers (HTTP 200)
  • 27 September 2026: the link answers (HTTP 200)
12 files
At the source: osf.io/na4mv/

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:

  • 2 repositories of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 84 scripts, each with its path and the digest of its content;
  • 6 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

The example code and data are available on the Open Science Framework (https://osf.io/na4mv/).

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, 27 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 5 authors, 2 keywords, 11 MeSH terms, 2 funders, 24 references.

Cite

This paper

Yang, Y., Ameloot, A., Lio, G., Sirigu, A., & Duhamel, J.-R. (2026). Digit-tracking reveals curiosity-driven visual attention in macaque monkeys. Scientific reports, 16(1), 27117. https://doi.org/10.1038/s41598-026-57654-4

BibTeX

@article{yang2026digit,
author = {Yang, Yidong and Ameloot, Antoine and Lio, Guillaume and Sirigu, Angela and Duhamel, Jean-René},
title = {{Digit-tracking reveals curiosity-driven visual attention in macaque monkeys}},
journal = {Scientific reports},
year = {2026},
month = jun,
volume = {16},
number = {1},
pages = {27117},
publisher = {Nature Publishing Group},
issn = {2045-2322},
doi = {10.1038/s41598-026-57654-4},
url = {https://doi.org/10.1038/s41598-026-57654-4},
pmid = {42288666},
pmcid = {PMC13527078}
}

RIS

TY - JOUR
AU - Yang, Yidong
AU - Ameloot, Antoine
AU - Lio, Guillaume
AU - Sirigu, Angela
AU - Duhamel, Jean-René
TI - Digit-tracking reveals curiosity-driven visual attention in macaque monkeys
T2 - Scientific reports
J2 - Sci Rep
PY - 2026
DA - 2026/06/14
VL - 16
IS - 1
SP - 27117
SN - 2045-2322
PB - Nature Publishing Group
DO - 10.1038/s41598-026-57654-4
UR - https://doi.org/10.1038/s41598-026-57654-4
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s41598-026-57654-4",
"type": "article-journal",
"title": "Digit-tracking reveals curiosity-driven visual attention in macaque monkeys",
"container-title": "Scientific reports",
"author": [
{
"family": "Yang",
"given": "Yidong"
},
{
"family": "Ameloot",
"given": "Antoine"
},
{
"family": "Lio",
"given": "Guillaume"
},
{
"family": "Sirigu",
"given": "Angela"
},
{
"family": "Duhamel",
"given": "Jean-René"
}
],
"container-title-short": "Sci Rep",
"volume": "16",
"issue": "1",
"page": "27117",
"DOI": "10.1038/s41598-026-57654-4",
"PMID": "42288666",
"PMCID": "PMC13527078",
"ISSN": "2045-2322",
"publisher": "Nature Publishing Group",
"URL": "https://doi.org/10.1038/s41598-026-57654-4",
"language": "en",
"issued": {
"date-parts": [
[
2026,
6,
14
]
]
}
}

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.1073/pnas.2309906121 [code]
Inactivation of face-selective neurons alters eye movements when free viewing faces.
Journal: Proceedings of the National Academy of Sciences of the United States of America
In common: Image Processing Toolbox, non-human primate, cognitive, 4 references
[2] doi:10.1371/journal.pcbi.1010654 [code]
Look twice: A generalist computational model predicts return fixations across tasks and species.
Journal: PLoS computational biology
In common: Image Processing Toolbox, non-human primate, 3 references
[3] doi:10.1167/jov.22.12.9 [code]
Individual differences in looking at persons in scenes.
Journal: Journal of vision
In common: behavior only, cognitive, 2 references
[4] doi:10.1371/journal.pcbi.1013092 [code]
Noise correlations and neuronal diversity may limit the utility of winner-take-all readout in a pop out visual search task.
Journal: PLoS computational biology
In common: behavior only, cognitive, 2 references
[5] doi:10.7554/elife.63816 [code]
A naturalistic environment to study visual cognition in unrestrained monkeys.
Journal: eLife
In common: non-human primate, cognitive, 2 references
[6] doi:10.1093/scan/nsaf108 [code]
Challenging the negativity bias in affective scene viewing: The role of social content.
Journal: Social cognitive and affective neuroscience
In common: cognitive, 2 references
[7] doi:10.3389/fnsys.2022.882315 [code]
Modeling Human Visual Search in Natural Scenes: A Combined Bayesian Searcher and Saliency Map Approach.
Journal: Frontiers in systems neuroscience
In common: Image Processing Toolbox, behavior only, cognitive, 1 reference
[8] doi:10.1038/s41467-021-26756-0 [code]
A sensory memory to preserve visual representations across eye movements.
Journal: Nature communications
In common: Image Processing Toolbox, behavior only, cognitive, 1 reference
[9] doi:10.1038/s41467-026-69447-4 [code]
Functional distinctions between orbitofrontal cortex and anterior cingulate cortex subregions in decision-making and autonomic regulation.
Journal: Nature communications
In common: Image Processing Toolbox, non-human primate, cognitive, 1 reference
[10] doi:10.1038/s41467-024-48374-2 [code]
Primacy of vision shapes behavioral strategies and neural substrates of spatial navigation in marmoset hippocampus.
Journal: Nature communications
In common: Image Processing Toolbox, non-human primate, cognitive, 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.

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/s41598-026-57654-4.svg)](https://openscicode.org/badge/doi/10.1038/s41598-026-57654-4)
<!-- oscr-badge:end -->
reStructuredText
.. oscr-badge:start

.. image:: https://openscicode.org/badge/doi/10.1038/s41598-026-57654-4.svg
   :target: https://openscicode.org/badge/doi/10.1038/s41598-026-57654-4
   :alt: OSCR

.. oscr-badge:end
HTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1038/s41598-026-57654-4"><img src="https://openscicode.org/badge/doi/10.1038/s41598-026-57654-4.svg" alt="OSCR"></a>
<!-- oscr-badge:end -->

On GitHub, open the README, choose Edit (the pencil), paste the snippet under the title, then "Commit changes".

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)

Versions of its code: the releases of its code tied to a version of this paper (the preprint, the accepted manuscript, the version of record…), each with the tracing map versioned with it.

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