OSCR

Dynamic neural representations of scene beauty are relatively unaffected by stimulus timing and task.

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.

The 1 match
  1. [1] § Materials and methods › Representational similarity analysis ↔ Code/correlation_rdm_newpca.m, lines 84–158 · score 0.51 · dissimilarity matrices, PCA, Spearman, RDMs, correlation, EEG

Paper

Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC

The paper is loaded when this pane is shown.

The authors' code

MATLAB · 159 lines · 4.7 KB · no license · 1 match

  1. close all
  2. clear all
  3. clc
  4. ss=[3:13,15:30];
  5. addpath('/Users/sanjeev/Documents/Projects/toolboxes/fieldtrip-20220416');
  6. ft_defaults()
  7. addpath(genpath('/Users/sanjeev/Documents/Projects/toolboxes/CoSMoMVPA-master'));
  8. for s=ss
  9. %Load data
  10. if s<10
  11. load(['../Data/preprocessed/sub-0' num2str(s) '/timelock/timelock',num2str(s) '.mat']);
  12. else
  13. load(['../Data/preprocessed/sub-' num2str(s) '/timelock/timelock',num2str(s) '.mat']);
  14. end
  15. for ii =1:length(timelock.trialinfo)
  16. if timelock.trialinfo(ii,2)== 1;
  17. timelock.trialinfo(ii,5) = timelock.trialinfo(ii,3);
  18. else
  19. timelock.trialinfo(ii,5) = timelock.trialinfo(ii,3) + 50;
  20. end
  21. end
  22. %Baseline correct
  23. cfg=[];
  24. cfg.baseline=[-0.5,0];
  25. cfg.parameter='trial';
  26. timelock=ft_timelockbaseline(cfg,timelock);
  27. res.time=timelock.time;
  28. %choose time window
  29. cfg=[];
  30. cfg.latency=[-0.25,1.45];
  31. timelock=ft_selectdata(cfg,timelock);
  32. %get original time values
  33. res.time_original=timelock.time;
  34. %convert to cosmomvpa struct
  35. ds=cosmo_meeg_dataset(timelock);
  36. %Assign all possible trial info
  37. ds.sa.targets=timelock.trialinfo(:,5);
  38. %Store intact DS
  39. ds1=ds;
  40. %Remove useless feature data
  41. ds=cosmo_remove_useless_data(ds);
  42. %preassign stuff
  43. ds0=ds;
  44. nch=2;
  45. nIter=50;
  46. res.time=-0.225:0.01:1.425;
  47. res.diss=zeros(length(unique(ds.sa.targets)),length(unique(ds.sa.targets)),length(res.time),nch*nIter);
  48. res.n_feat=zeros(nch*nIter,length(res.time));
  49. %start loop across iterations
  50. ix=0;
  51. tic
  52. for iter=1:nIter
  53. %increase counter
  54. ix=ix+2;
  55. %get ds
  56. ds=ds0;
  57. %build chunks
  58. ds.sa.chunks=[1:length(ds.sa.targets)]';
  59. for cond=unique(ds.sa.targets)'
  60. cond_ind=find(ds.sa.targets==cond);
  61. chks=repmat([1:2]',ceil(length(cond_ind)/2));
  62. chks=Shuffle(chks);
  63. ds.sa.chunks(ds.sa.targets==cond)=chks(1:length(cond_ind));
  64. end
  65. %start loop across time
  66. for t=1:length(res.time)
  67. tp=find(res.time_original>res.time(t)-0.025&res.time_original<=res.time(t)+0.025);
  68. for cv=1:2
  69. %put results in the right place
  70. if cv==1
  71. res_ind=ix-1;
  72. else
  73. res_ind=ix;
  74. end
  75. if cv==1
  76. ds_class=cosmo_slice(ds,ds.sa.chunks==1,1);
  77. ds_pca=cosmo_slice(ds,ds.sa.chunks==2,1);
  78. else
  79. ds_class=cosmo_slice(ds,ds.sa.chunks==2,1);
  80. ds_pca=cosmo_slice(ds,ds.sa.chunks==1,1);
  81. end
  82. ds_class=cosmo_slice(ds_class,ismember(ds_class.fa.time,tp),2);
  83. ds_pca=cosmo_slice(ds_pca,ismember(ds_pca.fa.time,tp),2);
  84. %do a pca one one dataset
  85. n_feat=length(unique(ds_pca.fa.chan));
  86. [coeff,x,LATENT,TSQUARED,x_exp,mu]=pca(ds_pca.samples);
  87. for ccx=1:length(x_exp)
  88. if sum(x_exp(1:ccx))>=99
  89. n_feat=ccx;
  90. break
  91. end
  92. end
  93. res.n_feat(res_ind,t)=n_feat;
  94. %apply pca to other dataset
  95. ds_class.samples=(ds_class.samples-mu)*coeff(:,1:n_feat);
  96. ds_class.fa.chan=1:n_feat;
  97. ds_class.fa.time=ones(size(ds_class.fa.chan));
  98. ds_class.a.fdim.values{1}=1:n_feat;
  99. %average samples
  100. ds_class.sa.chunks=ones(size(ds_class.sa.targets));
  101. cx=0;
  102. for cond=unique(ds_class.sa.targets)'
  103. dsx=cosmo_slice(ds_class,ds_class.sa.targets==cond);
  104. if not(isempty(dsx.samples))
  105. cx=cx+1;
  106. ds_cond{cx}=cosmo_average_samples(dsx);
  107. end
  108. end
  109. ds_class=cosmo_stack(ds_cond,1);
  110. clear ds_cond
  111. %get similarity
  112. args.metric='Spearman';
  113. res_ds=cosmo_dissimilarity_matrix_measure(ds_class,args);
  114. [d,l,v]=cosmo_unflatten(res_ds,1);
  115. res.diss(:,:,t,res_ind)=d;
  116. end
  117. end
  118. display(['subject #',num2str(s),' - analysis #',num2str(iter),'/',num2str(nIter),' - ',num2str(round(toc/60,1)),'min passed.']);
  119. end
  120. res.n_feat=mean(res.n_feat,1);
  121. res.diss=mean(res.diss,4);
  122. %Save
  123. save(['../results/RDMs_EEG_mod/correlation_rdm_newpca',num2str(s)],'res');
  124. end

correlation_rdm_newpca.m, no license · at the source

Overview

Authors: Sanjeev Nara1,2,3, Lara Becker4, Lilly Hillebrand4, Rongming Xiang1, Daniel Kaiser1,5,6,7
ORCID iDs: Sanjeev Nara
  1. Present Address: Neural Computation Group, Department of Mathematics and Computer Science, Physics, Geography, Justus Liebig University Giessen,Giessen, Germany
  2. School of Biosciences and Bioengineering, IIT Mandi,Mandi, 175075 Himachal Pradesh India
  3. Centre for Human-Computer Interaction (CHCi), IIT Mandi,Mandi, Himachal Pradesh India
  4. Department of Psychology, Justus Liebig University Giessen,Giessen, Germany
  5. Center for Mind, Brain and Behavior (CMBB), Universities of Giessen, Marburg, and Darmstadt,Marburg, Germany
  6. Center for Applied Computer Science and Data Science (ZAD), Justus Liebig University Giessen,Giessen, Germany
  7. Cluster of Excellence “The Adaptive Mind”, Universities of Giessen, Marburg, and Darmstadt,Giessen, Germany
Journal: Scientific reports, volume 16, issue 1, article 15217
Dates: received 30 April 2025; accepted 24 March 2026; published online 15 May 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1038/s41598-026-46149-x · PMID 42141016 · PMCID PMC13179325 · OpenAlex W4409836820
Open access: gold, a free copy (OpenAlex)
Status: code verified
Categories: EEG (modality), human (organism), cognitive (subfield)
Methods: Preprocessing, Statistics, Smoothing, state filtering, decompositions, Connectivity, Physiology & signal measures, Machine learning
Keywords: Neuroscience, Cognitive neuroscience, Perception
MeSH: Beauty*, Visual Perception*, Adult, Electroencephalography, Female, Humans, Judgment, Male, Photic Stimulation, Time Factors, Young Adult (* major topic)
Topic: Visual perception and processing mechanisms (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Funding: Deutsche Forschungsgemeinschaft (533717223, KA4683/6-1, EXC 3066/1, 536053998)
Citations: cited by 1 paper (Europe PMC); 30 references in the paper

Abstract

Understanding the neural correlates of aesthetic experiences in natural environments is a central question in neuroaesthetics. A previous EEG study (Kaiser, 2022) identified early and temporally sustained neural representations of visual scene beauty. These results were obtained with long presentation durations (1450 ms) and with explicit beauty judgments, rendering it unclear how presentation time and task demands shape the neural correlates of scene beauty. In two EEG experiments, we replicated this study while varying presentation time and task. Experiment 1 tested whether reducing stimulus presentation time from 1450 ms to 100 ms altered neural representations of beauty. Experiment 2 examined whether beauty-related representations prevailed when participants performed an orthogonal task instead of explicitly judging beauty. Representational similarity analysis revealed that beauty-related neural representations emerged early (within 150–200 ms post-stimulus) and were sustained over time, in line with previous findings. Critically, we found that neither reduced presentation time nor the absence of an explicit beauty judgment significantly altered beauty-related neural dynamics. These results suggest that the neural correlates of scene beauty are relatively robust to stimulus presentation and task regimes, providing a potential correlate of the spontaneous perception of beauty in natural environments.

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

Repository

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

OSF fj6sq

License: none: the authors keep all their rights
State: the link answers, verified on 28 September 2026
Evidence: files inventoried
Languages: MATLAB (6)
Size: 67 files, 6 scripts
Software Heritage: not checked
Found in: “Data availability”
Holds: README
Not found: license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 28 September 2026: the link answers (HTTP 200)
  • 28 September 2026: the link answers (HTTP 200)
6 files
At the source: osf.io/fj6sq

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;
  • 6 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

Data and code are publicly accessible on the Open Science Framework (OSF) via this link: https://osf.io/fj6sq.

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 2, 28 September 2026

  • Funding: added Deutsche Forschungsgemeinschaft: 533717223, KA4683/6-1, EXC 3066/1, 536053998

Version 1, 28 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 5 authors, 3 keywords, 11 MeSH terms, 30 references.

Cite

This paper

Nara, S., Becker, L., Hillebrand, L., Xiang, R., & Kaiser, D. (2026). Dynamic neural representations of scene beauty are relatively unaffected by stimulus timing and task. Scientific reports, 16(1), 15217. https://doi.org/10.1038/s41598-026-46149-x

BibTeX

@article{nara2026dynamic,
author = {Nara, Sanjeev and Becker, Lara and Hillebrand, Lilly and Xiang, Rongming and Kaiser, Daniel},
title = {{Dynamic neural representations of scene beauty are relatively unaffected by stimulus timing and task}},
journal = {Scientific reports},
year = {2026},
month = may,
volume = {16},
number = {1},
pages = {15217},
publisher = {Nature Publishing Group},
issn = {2045-2322},
doi = {10.1038/s41598-026-46149-x},
url = {https://doi.org/10.1038/s41598-026-46149-x},
pmid = {42141016},
pmcid = {PMC13179325}
}

RIS

TY - JOUR
AU - Nara, Sanjeev
AU - Becker, Lara
AU - Hillebrand, Lilly
AU - Xiang, Rongming
AU - Kaiser, Daniel
TI - Dynamic neural representations of scene beauty are relatively unaffected by stimulus timing and task
T2 - Scientific reports
J2 - Sci Rep
PY - 2026
DA - 2026/05/15
VL - 16
IS - 1
SP - 15217
SN - 2045-2322
PB - Nature Publishing Group
DO - 10.1038/s41598-026-46149-x
UR - https://doi.org/10.1038/s41598-026-46149-x
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s41598-026-46149-x",
"type": "article-journal",
"title": "Dynamic neural representations of scene beauty are relatively unaffected by stimulus timing and task",
"container-title": "Scientific reports",
"author": [
{
"family": "Nara",
"given": "Sanjeev"
},
{
"family": "Becker",
"given": "Lara"
},
{
"family": "Hillebrand",
"given": "Lilly"
},
{
"family": "Xiang",
"given": "Rongming"
},
{
"family": "Kaiser",
"given": "Daniel"
}
],
"container-title-short": "Sci Rep",
"volume": "16",
"issue": "1",
"page": "15217",
"DOI": "10.1038/s41598-026-46149-x",
"PMID": "42141016",
"PMCID": "PMC13179325",
"ISSN": "2045-2322",
"publisher": "Nature Publishing Group",
"URL": "https://doi.org/10.1038/s41598-026-46149-x",
"language": "en",
"issued": {
"date-parts": [
[
2026,
5,
15
]
]
}
}

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.1038/s41467-026-73153-6 [code]
Latent neural architecture organising shared aesthetic evaluations of visual artworks.
Journal: Nature communications
In common: CoSMoMVPA, Statistics and Machine Learning Toolbox, cognitive, 3 references
[2] doi:10.1093/cercor/bhag075 [code]
Cortical dynamics of icon perception: effects of concreteness and attractiveness.
Journal: Cerebral cortex (New York, N.Y. : 1991)
In common: cognitive, 5 references
[3] doi:10.1038/s41467-026-74565-0 [code]
The functional neurobiology of dispositions towards negative emotions.
Journal: Nature communications
In common: boundedline, fdr_bh (Benjamini-Hochberg FDR), FieldTrip, 1 other tool, cognitive
[4] doi:10.1038/s41467-026-71151-2 [code]
Common and distinct neural correlates of social interaction processing and theory of mind in narratives.
Journal: Nature communications
In common: boundedline, fdr_bh (Benjamini-Hochberg FDR), FieldTrip, 1 other tool, cognitive
[5] doi:10.1167/jov.26.8.2 [code]
Disentangling objects' contextual associations from perceptual and conceptual attributes using time-resolved neural decoding.
Journal: Journal of vision
In common: CoSMoMVPA, Statistics and Machine Learning Toolbox, EEG, cognitive, 2 references
[6] doi:10.1002/hbm.70577 [code]
Disgust Propensity, Not Disgust Sensitivity, Shapes the Reactivity of a Subjective Disgust Circuit in Humans.
Journal: Human brain mapping
In common: boundedline, fdr_bh (Benjamini-Hochberg FDR), FieldTrip, 1 other tool
[7] doi:10.1038/s41593-026-02357-2 [code]
Experience reorganizes content-specific memory traces in macaques.
Journal: Nature neuroscience
In common: boundedline, fdr_bh (Benjamini-Hochberg FDR), FieldTrip, 1 other tool
[8] doi:10.1038/s41467-026-75345-6 [code]
Hippocampal ripples initiate cortical dimensionality expansion for memory retrieval.
Journal: Nature communications
In common: boundedline, FieldTrip, Statistics and Machine Learning Toolbox, EEG, cognitive, 1 reference
[9] doi:10.1371/journal.pbio.3003938 [code]
Theta oscillations tag episodic memories for sleep-dependent consolidation.
Journal: PLoS biology
In common: fdr_bh (Benjamini-Hochberg FDR), FieldTrip, Statistics and Machine Learning Toolbox, EEG, cognitive, 1 reference
[10] doi:10.1038/s41467-026-75359-0 [code]
Neural mechanisms of time-forward predictions for naturalistic auditory tone sequences.
Journal: Nature communications
In common: fdr_bh (Benjamini-Hochberg FDR), FieldTrip, Statistics and Machine Learning Toolbox, EEG, 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.

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: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.

Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.

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