OSCR

Perceptual and neural constraints on photometric measures of heterochromatic brightness.

Code ↔ Paper

1 match 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.

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. [1] § Materials and Methods › Real-World Lighting Experiments. ↔ IlluminationBrightness/Code/RunIlluminationFig.m, lines 114 to 155 · score 0.60 · sumRGB, MaxRGB, melanopsin, conflicts, illumination, radiance · block oscr:b:2TRFSXP3YNG8Y-3 · 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 · 221 lines · 11 KB · MIT · 1 match

  1. clear;clc
  2. %% Load Data
  3. load ../RawData/LightingData.mat;
  4. %% Set Paras
  5. wavelength = 380:780;
  6. %% Convert to an RGB tripartition (482.65 nm, 565.43 nm)
  7. % Followed Koenderink, J., Doorn, A. v. & Gegenfurtner, K. Colors and things (2020)
  8. AreaBlue = find(wavelength<482.65);
  9. AreaGreen = intersect(find(wavelength<565.43),find(wavelength>482.65));
  10. AreaRed = find(wavelength>565.43);
  11. LightingData.linearRGB(:,:,:,1) = sum(LightingData.spectra(:,:,:,AreaBlue),4);
  12. LightingData.linearRGB(:,:,:,2) = sum(LightingData.spectra(:,:,:,AreaGreen),4);
  13. LightingData.linearRGB(:,:,:,3) = sum(LightingData.spectra(:,:,:,AreaRed),4);
  14. %% Calculate Luminance, Radiance, Melanopsin Excitation
  15. load ./Paras/PhotoreceptorSpectralSensitivity.mat;
  16. [wavelengthCIE x_bar y_bar z_bar]=textread('./Paras/ciexyz31_1.txt', '', 'delimiter', ',');
  17. wavelengthTarget = [find(wavelengthCIE == wavelength(1)):find(wavelengthCIE == wavelength(end))];
  18. LightingData.radiance = squeeze(sum(LightingData.spectra,4))*1000;
  19. LightingData.melanopsin = sum(LightingData.spectra.*reshape(PhotoreceptorSpectralSensitivity(:,6),1,1,1,401),4)*1000;
  20. LightingData.luminance = sum(LightingData.spectra.*reshape(y_bar(wavelengthTarget),1,1,1,401),4)*683;
  21. %% Optimal Weight Fitting
  22. Allweight= 0:0.02:5;
  23. nsteps = length(Allweight);
  24. if exist('MaxWeights') ~= 1
  25. count = 0;
  26. for g= 1:nsteps
  27. for b = 1:nsteps
  28. count = count + 1;
  29. wG = Allweight(g);
  30. wB = Allweight(b);
  31. [1,wG,wB]
  32. weightList(count,:) = [1,wG,wB];
  33. weights = repmat([1,wG,wB],size(LightingData.linearRGB,2),1);
  34. for subject = 1:size(LightingData.linearRGB,1)
  35. RGB_a = squeeze(LightingData.linearRGB(subject,:,1,:));
  36. RGB_b = squeeze(LightingData.linearRGB(subject,:,2,:));
  37. Resp = LightingData.choice(subject,:);%%1:Left -1:Right
  38. Resp(find(Resp==-1)) = 2;
  39. RGB_withWeights_a = RGB_a.*weights;
  40. RGB_withWeights_b = RGB_b.*weights;
  41. %%%%%%%%%%%%%%%%%%%%%%%%%%%%% Fit MaxWeight %%%%%%%%%%%%%%%
  42. MaxWeight_a = max(RGB_withWeights_a')';
  43. MaxWeight_b = max(RGB_withWeights_b')';
  44. MaxWeight_diff = MaxWeight_a-MaxWeight_b;
  45. Diff_AB = [MaxWeight_diff];
  46. Direction = Diff_AB./abs(Diff_AB);
  47. CorrectAnswer = -Direction*0.5+1.5;
  48. NanLoc = find(isnan(CorrectAnswer(:,1)));
  49. NanNum = length(NanLoc);
  50. CorrectAnswer(NanLoc(1:round(NanNum/2)),1) = 1;
  51. CorrectAnswer(NanLoc(round(NanNum/2)+1:end),1) = 2;
  52. Diff = CorrectAnswer(:,1)-Resp';
  53. Acc_MaxWeighted(subject,count) = length(find(Diff==0))./length(Diff);
  54. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  55. %%%%%%%%%%%%%%%%%%%%%%%%%%%%% Fit SumWeight %%%%%%%%%%%%%%%
  56. SumWeight_a = sum(RGB_withWeights_a')';
  57. SumWeight_b = sum(RGB_withWeights_b')';
  58. SumWeight_diff = SumWeight_a-SumWeight_b;
  59. Diff_AB = [SumWeight_diff];
  60. Direction = Diff_AB./abs(Diff_AB);
  61. CorrectAnswer = -Direction*0.5+1.5;
  62. NanLoc = find(isnan(CorrectAnswer(:,1)));
  63. NanNum = length(NanLoc);
  64. CorrectAnswer(NanLoc(1:round(NanNum/2)),1) = 1;
  65. CorrectAnswer(NanLoc(round(NanNum/2)+1:end),1) = 2;
  66. Diff = CorrectAnswer(:,1)-Resp';
  67. Acc_SumWeighted(subject,count) = length(find(Diff==0))./length(Diff);
  68. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  69. end
  70. MeanAcc_MaxWeighted(count) = mean(Acc_MaxWeighted(:,count));
  71. MeanAcc_SumWeighted(count) = mean(Acc_SumWeighted(:,count));
  72. end
  73. end
  74. [MaxWeighted_Acc,Loc] = max(MeanAcc_MaxWeighted);
  75. MaxWeights = weightList(Loc,:); %% The optimal weights
  76. LightingData.MaxWeightRGB(:,:,1) = max(cat(4,squeeze(LightingData.linearRGB(:,:,1,1))*MaxWeights(1),squeeze(LightingData.linearRGB(:,:,1,2))*MaxWeights(2),squeeze(LightingData.linearRGB(:,:,1,3))*MaxWeights(3)),[],4);
  77. LightingData.MaxWeightRGB(:,:,2) = max(cat(4,squeeze(LightingData.linearRGB(:,:,2,1))*MaxWeights(1),squeeze(LightingData.linearRGB(:,:,2,2))*MaxWeights(2),squeeze(LightingData.linearRGB(:,:,2,3))*MaxWeights(3)),[],4);
  78. LightingData.WeightFitting.MaxWeights = MaxWeights;
  79. LightingData.MaxRGB = max(LightingData.linearRGB,[],4);
  80. [SumWeighted_Acc,Loc] = max(MeanAcc_SumWeighted);
  81. SumWeights = weightList(Loc,:); %% The optimal weights
  82. LightingData.SumWeightRGB(:,:,1) = squeeze(LightingData.linearRGB(:,:,1,1))*SumWeights(1)+squeeze(LightingData.linearRGB(:,:,1,2))*SumWeights(2)+squeeze(LightingData.linearRGB(:,:,1,3))*SumWeights(3);
  83. LightingData.SumWeightRGB(:,:,2) = squeeze(LightingData.linearRGB(:,:,2,1))*SumWeights(1)+squeeze(LightingData.linearRGB(:,:,2,2))*SumWeights(2)+squeeze(LightingData.linearRGB(:,:,2,3))*SumWeights(3);
  84. LightingData.WeightFitting.SumWeights = SumWeights;
  85. LightingData.SumRGB = sum(LightingData.linearRGB,4);
  86. save ../RawData/LightingData.mat LightingData MaxWeights SumWeights;
  87. end
  88. %% Plot Conflicting Pairs Choice
  89. DimName = {'Radiance','wMaxRGB','Melanopsin','Weighted sumRGB','SumRGB','MaxRGB'};
  90. for subject = 1:size(LightingData.linearRGB,1)
  91. luminanceDiff = squeeze(LightingData.luminance(subject,:,1)-LightingData.luminance(subject,:,2));
  92. radianceDiff = squeeze(LightingData.radiance(subject,:,1)-LightingData.radiance(subject,:,2));
  93. mwDiff = squeeze(LightingData.MaxWeightRGB(subject,:,1)-LightingData.MaxWeightRGB(subject,:,2));
  94. melanopsinDiff = squeeze(LightingData.melanopsin(subject,:,1)-LightingData.melanopsin(subject,:,2));
  95. swDiff = squeeze(LightingData.SumWeightRGB(subject,:,1)-LightingData.SumWeightRGB(subject,:,2));
  96. SumRGBDiff = squeeze(LightingData.SumRGB(subject,:,1)-LightingData.SumRGB(subject,:,2));
  97. MaxRGBDiff = squeeze(LightingData.MaxRGB(subject,:,1)-LightingData.MaxRGB(subject,:,2));
  98. for nPair = 1:6
  99. switch nPair
  100. case 1
  101. AllCompare = luminanceDiff.*radianceDiff;
  102. case 2
  103. AllCompare = luminanceDiff.*mwDiff;
  104. case 3
  105. AllCompare = luminanceDiff.*melanopsinDiff;
  106. case 4
  107. AllCompare = luminanceDiff.*swDiff;
  108. case 5
  109. AllCompare = luminanceDiff.*SumRGBDiff;
  110. case 6
  111. AllCompare = luminanceDiff.*MaxRGBDiff;
  112. end
  113. TargetTrial = find(AllCompare<0);
  114. ChoosingLeft = find(LightingData.choice(subject,:)==1);
  115. luminanceHigherLeft = find(luminanceDiff>0);
  116. ChoosingRight = find(LightingData.choice(subject,:)==-1);
  117. luminanceHigherRight = find(luminanceDiff<0);
  118. ChoosingLuminance = [intersect(ChoosingLeft,luminanceHigherLeft), intersect(ChoosingRight,luminanceHigherRight)];
  119. ChoosingLuminance_conflictingTrial(nPair,subject) = length(intersect(ChoosingLuminance,TargetTrial))/length(TargetTrial);
  120. end
  121. AllCompare = radianceDiff.*mwDiff;
  122. TargetTrial = find(AllCompare<0);
  123. ChoosingLeft = find(LightingData.choice(subject,:)==1);
  124. RadianceHigherLeft = find(radianceDiff>0);
  125. ChoosingRight = find(LightingData.choice(subject,:)==-1);
  126. RadianceHigherRight = find(radianceDiff<0);
  127. ChoosingRadiance = [intersect(ChoosingLeft,RadianceHigherLeft), intersect(ChoosingRight,RadianceHigherRight)];
  128. ChoosingRadiance_conflictingTrial(subject) = length(intersect(ChoosingRadiance,TargetTrial))/length(TargetTrial);
  129. end
  130. %% plot Luminance versus others
  131. FigIdList = {"Fig. 4D","Fig. 4E","Fig. 4F","fig. S9C","fig. S9D","fig. S9E"};
  132. for nPair = 1:6
  133. figure("Name",FigIdList{1,nPair},'NumberTitle','off');
  134. ConflicChoice = 100-squeeze(ChoosingLuminance_conflictingTrial(nPair,:)*100);
  135. plot(1:size(LightingData.linearRGB,1),ConflicChoice,'o','MarkerSize',10,'LineWidth',1.5,'MarkerEdgeColor',[0 0.4470 0.7410],'MarkerFaceColor',[0 0.4470 0.7410]);
  136. Loc = find(ConflicChoice>50);
  137. LuminanceChoice = 100-round(length(Loc)/size(LightingData.linearRGB,1)*100);
  138. hold on
  139. plot(Loc,ConflicChoice(Loc),'o','MarkerSize',10,'LineWidth',1.5,'MarkerEdgeColor',[0.9290 0.6940 0.1250],'MarkerFaceColor',[0.9290 0.6940 0.1250]);
  140. ylim([0,100]);
  141. xlim([0,size(LightingData.linearRGB,1)+1])
  142. line([0,size(LightingData.linearRGB,1)+1],[50,50],'Color','k','LineStyle','--','LineWidth',1.5)
  143. if LuminanceChoice > 50
  144. lgd = legend({['Luminance wins for ',num2str(LuminanceChoice),'% observers'],[DimName{1,nPair}, ' wins']},'Box','off', 'Location','northoutside','FontSize',14);
  145. else
  146. lgd = legend({['Luminance wins'],[DimName{1,nPair}, ' wins for ', num2str(100-LuminanceChoice),'% observers']},'Box','off', 'Location','northoutside','FontSize',14);
  147. end
  148. lgd.NumColumns = 1;
  149. xlabel('Observers','FontSize',20, 'FontWeight', 'bold')
  150. xticks([]);
  151. xticklabels([])
  152. ylabel({'Trials choosing','non-luminance (%)',''}, 'FontSize', 16, 'FontWeight', 'bold');
  153. box off
  154. set(gca,'FontSize',12)
  155. set(gca,'LineWidth',1.5)
  156. set(gcf,'Position',[0,0,600,300])
  157. end
  158. %% plot Radiance versus Max-weighted
  159. figure("Name","fig. S9F",'NumberTitle','off')
  160. ConflicChoice = 100-squeeze(ChoosingRadiance_conflictingTrial*100);
  161. plot(1:size(LightingData.linearRGB,1),ConflicChoice,'o','MarkerSize',10,'LineWidth',1.5,'MarkerEdgeColor',[0 0.4470 0.7410],'MarkerFaceColor',[0 0.4470 0.7410]);
  162. Loc = find(ConflicChoice>50);
  163. RadianceChoice = 100-round(length(Loc)/size(LightingData.linearRGB,1)*100);
  164. hold on
  165. plot(Loc,ConflicChoice(Loc),'o','MarkerSize',10,'LineWidth',1.5,'MarkerEdgeColor',[0.9290 0.6940 0.1250],'MarkerFaceColor',[0.9290 0.6940 0.1250]);
  166. ylim([0,100]);
  167. xlim([0,size(LightingData.linearRGB,1)+1])
  168. line([0,size(LightingData.linearRGB,1)+1],[50,50],'Color','k','LineStyle','--','LineWidth',1.5)
  169. if RadianceChoice > 50
  170. lgd = legend({['Radiance wins for ',num2str(RadianceChoice),'% observers'],['wMaxRGB wins']},'Box','off', 'Location','northoutside','FontSize',14);
  171. else
  172. lgd = legend({['Radiance wins'],['wMaxRGB wins for ', num2str(100-RadianceChoice),'% observers']},'Box','off', 'Location','northoutside','FontSize',14);
  173. end
  174. lgd.NumColumns = 1;
  175. xlabel('Observers','FontSize',20, 'FontWeight', 'bold')
  176. xticks([]);
  177. xticklabels([])
  178. box off
  179. set(gca,'FontSize',12)
  180. set(gca,'LineWidth',1.5)
  181. % Add a single ylabel in the middle of the figure
  182. % han = axes(figure(100), 'Visible', 'off');
  183. % han.YLabel.Visible = 'on';
  184. ylabel({'Trials choosing wMaxRGB (%)',''}, 'FontSize', 16, 'FontWeight', 'bold');
  185. set(gcf,'Position',[0,0,600,300])

RunIlluminationFig.m at commit b38d286, under MIT · at the source

Overview

Authors: Shuchen Guan1, Jing Chen2, Robert Ennis1, Matteo Toscani3, Matteo Valsecchi4, Andrea van Doorn1,5, Jan Koenderink1,5,6, Karl R Gegenfurtner1
  1. Department of Psychology and Center for Mind, Brain and Behavior, Justus-Liebig-Universität Giessen, Giessen 35394, Germany
  2. School of Psychology, Shanghai University of Sport, Shanghai 200438, China
  3. Department of Psychology, Faculty of Science and Technology, Bournemouth University, Poole BH12 5BB, United Kingdom
  4. Department of Psychology, University of Bologna, Bologna 40127, Italy
  5. Department of Experimental Psychology, Utrecht University, Utrecht 3584 CS, the Netherlands
  6. Laboratory for Experimental Psychology, Catholic University of Leuven, Leuven 3000, Belgium
Institutions: Justus-Liebig-Universität Gießen (Germany); Shanghai University of Sport (China); Bournemouth University (United Kingdom); University of Bologna (Italy); Utrecht University (Netherlands); KU Leuven (Belgium)
Dates: received 24 March 2026; accepted 23 July 2026; published online 19 August 2026; in print 25 August 2026
Type: Research article · Language: English
License: CC BY-NC-ND
Identifiers: DOI 10.1073/pnas.2610398123 · PMID 42616779 · PMCID PMC13506033 · OpenAlex W7203761736
Open access: hybrid, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: optical imaging (calcium, voltage, 2-photon) (modality), human (organism), cognitive (subfield)
Methods: Connectivity
Keywords: luminance, photometric standards, color, heterochromatic brightness, lighting
MeSH: Color Perception*, Heterochromatin*, Photometry*, Color, Humans, Light, Photic Stimulation (* major topic)
Topic: Visual perception and processing mechanisms (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Funding: EC | Horizon Europe | Excellent Science | HORIZON EUROPE European Research Council (ERC) (884116); European Research Council (884116); Deutsche Forschungsgemeinschaft DFG (533717223)
Citations: cited by 1 paper (Europe PMC); 49 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 1 match between paragraphs and lines of code.

visionplusplu/LuminanceAndBrightness

License: MIT
State: the link answers, verified on 13 November 2026
Evidence: files inventoried
Commit: b38d2868328d7fcad3013b013c39898834a0a7a3, 4 June 2026
Languages: MATLAB (19)
Size: 99 files, 19 scripts
Software Heritage: not archived
Found in: operator
Holds: README, license file
Not found: CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 13 November 2026: the link answers
  • 13 November 2026: the link answers
21 files

The paper's code and data availability statement is in the Data section.

Tracing map

Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.

What the map holds:

  • 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 19 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

Datasets cited

  • osf:65bwf, at OSF; found in “Data, Materials, and Software Availability”

Code and data availability statement

The paper has a code and data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:

Read it in the paper: doi.org/10.1073/pnas.2610398123.

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 3, 13 November 2026 (an edit)

    Version 1, 27 September 2026: the first record

    Recorded: type, language, journal, volume, issue, pages, dates, 8 authors, 5 keywords, 7 MeSH terms, 3 funders, 25 references.

    Cite

    This paper

    Guan, S., Chen, J., Ennis, R., Toscani, M., Valsecchi, M., van Doorn, A., Koenderink, J., & Gegenfurtner, K. R. (2026). Perceptual and neural constraints on photometric measures of heterochromatic brightness. Proceedings of the National Academy of Sciences of the United States of America, 123(34), e2610398123. https://doi.org/10.1073/pnas.2610398123

    BibTeX

    @article{guan2026perceptual,
    author = {Guan, Shuchen and Chen, Jing and Ennis, Robert and Toscani, Matteo and Valsecchi, Matteo and van Doorn, Andrea and Koenderink, Jan and Gegenfurtner, Karl R},
    title = {{Perceptual and neural constraints on photometric measures of heterochromatic brightness}},
    journal = {Proceedings of the National Academy of Sciences of the United States of America},
    year = {2026},
    month = aug,
    volume = {123},
    number = {34},
    pages = {e2610398123},
    publisher = {National Academy of Sciences},
    issn = {0027-8424},
    doi = {10.1073/pnas.2610398123},
    url = {https://doi.org/10.1073/pnas.2610398123},
    pmid = {42616779},
    pmcid = {PMC13506033}
    }

    RIS

    TY - JOUR
    AU - Guan, Shuchen
    AU - Chen, Jing
    AU - Ennis, Robert
    AU - Toscani, Matteo
    AU - Valsecchi, Matteo
    AU - van Doorn, Andrea
    AU - Koenderink, Jan
    AU - Gegenfurtner, Karl R
    TI - Perceptual and neural constraints on photometric measures of heterochromatic brightness
    T2 - Proceedings of the National Academy of Sciences of the United States of America
    J2 - Proc Natl Acad Sci U S A
    PY - 2026
    DA - 2026/08/19
    VL - 123
    IS - 34
    SP - e2610398123
    SN - 0027-8424
    PB - National Academy of Sciences
    DO - 10.1073/pnas.2610398123
    UR - https://doi.org/10.1073/pnas.2610398123
    LA - en
    ER -

    CSL-JSON

    {
    "id": "10.1073/pnas.2610398123",
    "type": "article-journal",
    "title": "Perceptual and neural constraints on photometric measures of heterochromatic brightness",
    "container-title": "Proceedings of the National Academy of Sciences of the United States of America",
    "author": [
    {
    "family": "Guan",
    "given": "Shuchen"
    },
    {
    "family": "Chen",
    "given": "Jing"
    },
    {
    "family": "Ennis",
    "given": "Robert"
    },
    {
    "family": "Toscani",
    "given": "Matteo"
    },
    {
    "family": "Valsecchi",
    "given": "Matteo"
    },
    {
    "family": "van Doorn",
    "given": "Andrea"
    },
    {
    "family": "Koenderink",
    "given": "Jan"
    },
    {
    "family": "Gegenfurtner",
    "given": "Karl R"
    }
    ],
    "container-title-short": "Proc Natl Acad Sci U S A",
    "volume": "123",
    "issue": "34",
    "page": "e2610398123",
    "DOI": "10.1073/pnas.2610398123",
    "PMID": "42616779",
    "PMCID": "PMC13506033",
    "ISSN": "0027-8424",
    "publisher": "National Academy of Sciences",
    "URL": "https://doi.org/10.1073/pnas.2610398123",
    "language": "en",
    "issued": {
    "date-parts": [
    [
    2026,
    8,
    19
    ]
    ]
    }
    }

    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.1126/sciadv.aec6658 [code]
    A unifying principle of chromatic coding across biological and artificial systems.
    Journal: Science advances
    In common: 7 references, author Karl R. Gegenfurtner
    [2] doi:10.1038/s41467-022-28249-0 [code]
    Temporal dynamics of the neural representation of hue and luminance polarity.
    Journal: Nature communications
    In common: 5 references
    [3] doi:10.1162/imag.a.130 [code]
    Tuning of cortical color mechanisms revealed using steady-state visually evoked potentials.
    Journal: Imaging neuroscience (Cambridge, Mass.)
    In common: Statistics and Machine Learning Toolbox, 4 references
    [4] doi:10.1038/s41562-026-02445-0 [code]
    Human gloss perception reproduced by tiny neural networks.
    Journal: Nature human behaviour
    In common: Statistics and Machine Learning Toolbox, cognitive, author Karl R. Gegenfurtner
    [5] doi:10.7554/elife.75897 [code]
    Human visual gamma for color stimuli.
    Journal: eLife
    In common: Curve Fitting Toolbox, Statistics and Machine Learning Toolbox, 2 references
    [6] doi:10.1038/s41467-022-34020-2 [code]
    Cone opponent functional domains in primary visual cortex combine signals for color appearance mechanisms.
    Journal: Nature communications
    In common: Statistics and Machine Learning Toolbox, 3 references
    [7] doi:10.1167/jov.25.12.2
    Individual variability in steady-state VEP responses for hues sweeping around cardinal color axes: Clues to cortical color coding?
    Journal: Journal of vision
    In common: cognitive, 3 references
    [8] doi:10.1016/j.neuroimage.2022.118941
    Representation of color, form, and their conjunction across the human ventral visual pathway.
    Journal: NeuroImage
    In common: 3 references
    [9] doi:10.1038/s41598-024-59930-7 [code]
    An analysis of information segregation in parallel streams of a multi-stream convolutional neural network.
    Journal: Scientific reports
    In common: 3 references
    [10] doi:10.1038/s41467-024-44809-y
    The neural origin for asymmetric coding of surface color in the primate visual cortex.
    Journal: Nature communications
    In common: 3 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.1073/pnas.2610398123.svg)](https://openscicode.org/badge/doi/10.1073/pnas.2610398123)
    <!-- oscr-badge:end -->
    reStructuredText
    .. oscr-badge:start
    
    .. image:: https://openscicode.org/badge/doi/10.1073/pnas.2610398123.svg
       :target: https://openscicode.org/badge/doi/10.1073/pnas.2610398123
       :alt: OSCR
    
    .. oscr-badge:end
    HTML
    <!-- oscr-badge:start -->
    <a href="https://openscicode.org/badge/doi/10.1073/pnas.2610398123"><img src="https://openscicode.org/badge/doi/10.1073/pnas.2610398123.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.