Young and old adult brains experience opposite effects of acute sleep restriction on the functional connectivity network.
The 8 matches · 3 of them tie a paragraph to a whole file, not to given lines: weak matches, whose lines are not tinted
- [1] § Methods › Modularity ↔ community_louvain.m, lines 1–71 · score 0.90 · asymmetric treatment, COMMUNITY_LOUVAIN, resolution parameter, und sign, negative weights, modules
- [2] § Methods › Modularity ↔ null_model_und_sign.m, lines 1–73 · score 0.82 · NULL_MODEL_UND_SIGN, strength distributions, preserves weight, negative weights, network, matrices
- [3] § Methods › Dynamic functional connectivity ↔ leida-matlab-1.0/utilities/analyses_scripts/cluster_performance.m, the whole file · a weak match · score 0.78 · Calinski Harabasz, Silhouette coefficient, Leading Eigenvector, Dunn, clustering, score
- [4] § Methods › Dynamic functional connectivity ↔ leida-matlab-1.0/LEiDA_TransitionsK.m, the whole file · a weak match · score 0.72 · Leading Eigenvector Dynamics, transition probability matrices, LEiDA, chosen, clustering, FC
- [5] § Methods › Preprocessing ↔ python_packages/brainvistools/src/brainvistools/visualization.py, lines 73–138 · score 0.61 · Tian atlas, subcortical regions, Library, Schaefer
- [6] § Results › Network modularity ↔ community_louvain.m, lines 1–71 · score 0.60 · resolution parameter, modularity increased, Louvain, algorithm, modules, model
- [7] § Methods › Partial least squares (PLS) ↔ leida-matlab-1.0/utilities/analyses_scripts/LEiDA_stats_TransitionMatrix.m, lines 1–65 · score 0.53 · transition probability, fractional occupancy, LEiDA, scans, bootstrap, permutation
- [8] § Methods › Partial least squares (PLS) ↔ leida-matlab-1.0/LEiDA_TransitionsK.m, the whole file · a weak match · score 0.53 · transition probability, LEiDA, reliable, bootstrap, variables, permutation
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 · 198 lines · 7.6 KB · no license · 2 matches
- function [M,Q]=community_louvain(W,gamma,M0,B)
- %COMMUNITY_LOUVAIN Optimal community structure
- %
- % M = community_louvain(W);
- % [M,Q] = community_louvain(W,gamma);
- % [M,Q] = community_louvain(W,gamma,M0);
- % [M,Q] = community_louvain(W,gamma,M0,'potts');
- % [M,Q] = community_louvain(W,gamma,M0,'negative_asym');
- % [M,Q] = community_louvain(W,[],[],B);
- %
- % The optimal community structure is a subdivision of the network into
- % nonoverlapping groups of nodes which maximizes the number of within-
- % group edges, and minimizes the number of between-group edges.
- %
- % This function is a fast and accurate multi-iterative generalization of
- % the Louvain community detection algorithm. This function subsumes and
- % improves upon,
- % modularity_louvain_und.m, modularity_finetune_und.m,
- % modularity_louvain_dir.m, modularity_finetune_dir.m,
- % modularity_louvain_und_sign.m
- % and additionally allows to optimize other objective functions (includes
- % built-in Potts-model Hamiltonian, allows for custom objective-function
- % matrices).
- %
- % Inputs:
- % W,
- % directed/undirected weighted/binary connection matrix with
- % positive and possibly negative weights.
- % gamma,
- % resolution parameter (optional)
- % gamma>1, detects smaller modules
- % 0<=gamma<1, detects larger modules
- % gamma=1, classic modularity (default)
- % M0,
- % initial community affiliation vector (optional)
- % B,
- % objective-function type or custom objective matrix (optional)
- % 'modularity', modularity (default)
- % 'potts', Potts-model Hamiltonian (for binary networks)
- % 'negative_sym', symmetric treatment of negative weights
- % 'negative_asym', asymmetric treatment of negative weights
- % B, custom objective-function matrix
- %
- % Note: see Rubinov and Sporns (2011) for a discussion of
- % symmetric vs. asymmetric treatment of negative weights.
- %
- % Outputs:
- % M,
- % community affiliation vector
- % Q,
- % optimized community-structure statistic (modularity by default)
- %
- % Example:
- % % Iterative community finetuning.
- % % W is the input connection matrix.
- % n = size(W,1); % number of nodes
- % M = 1:n; % initial community affiliations
- % Q0 = -1; Q1 = 0; % initialize modularity values
- % while Q1-Q0>1e-5; % while modularity increases
- % Q0 = Q1; % perform community detection
- % [M, Q1] = community_louvain(W, [], M);
- % end
- %
- % References:
- % Blondel et al. (2008) J. Stat. Mech. P10008.
- % Reichardt and Bornholdt (2006) Phys. Rev. E 74, 016110.
- % Ronhovde and Nussinov (2008) Phys. Rev. E 80, 016109
- % Sun et al. (2008) Europhysics Lett 86, 28004.
- % Rubinov and Sporns (2011) Neuroimage 56:2068-79.
- %
- % Mika Rubinov, U Cambridge 2015-2016
- % Modification history
- % 2015: Original
- % 2016: Included generalization for negative weights.
- % Enforced binary network input for Potts-model Hamiltonian.
- % Streamlined code and expanded documentation.
- W=double(W); % convert to double format
- n=length(W); % get number of nodes
- s=sum(sum(W)); % get sum of edges
- if ~exist('B','var') || isempty(B)
- type_B = 'modularity';
- elseif ischar(B)
- type_B = B;
- else
- type_B = 0;
- if exist('gamma','var') && ~isempty(gamma)
- warning('Value of gamma is ignored in generalized mode.')
- end
- end
- if ~exist('gamma','var') || isempty(gamma)
- gamma = 1;
- end
- if strcmp(type_B,'negative_sym') || strcmp(type_B,'negative_asym')
- W0 = W.*(W>0); %positive weights matrix
- s0 = sum(sum(W0)); %weight of positive links
- B0 = W0-gamma*(sum(W0,2)*sum(W0,1))/s0; %positive modularity
- W1 =-W.*(W<0); %negative weights matrix
- s1 = sum(sum(W1)); %weight of negative links
- if s1 %negative modularity
- B1 = W1-gamma*(sum(W1,2)*sum(W1,1))/s1;
- else
- B1 = 0;
- end
- elseif min(min(W))<-1e-10
- err_string = [
- 'The input connection matrix contains negative weights.\nSpecify ' ...
- '''negative_sym'' or ''negative_asym'' objective-function types.'];
- error(sprintf(err_string)) %#ok<SPERR>
- end
- if strcmp(type_B,'potts') && any(any(W ~= logical(W)))
- error('Potts-model Hamiltonian requires a binary W.')
- end
- if type_B
- switch type_B
- case 'modularity'; B = (W-gamma*(sum(W,2)*sum(W,1))/s)/s;
- case 'potts'; B = W-gamma*(~W);
- case 'negative_sym'; B = B0/(s0+s1) - B1/(s0+s1);
- case 'negative_asym'; B = B0/s0 - B1/(s0+s1);
- otherwise; error('Unknown objective function.');
- end
- else % custom objective function matrix as input
- B = double(B);
- if ~isequal(size(W),size(B))
- error('W and B must have the same size.')
- end
- end
- if ~exist('M0','var') || isempty(M0)
- M0=1:n;
- elseif numel(M0)~=n
- error('M0 must contain n elements.')
- end
- [~,~,Mb] = unique(M0);
- M = Mb;
- B = (B+B.')/2; % symmetrize modularity matrix
- Hnm=zeros(n,n); % node-to-module degree
- for m=1:max(Mb) % loop over modules
- Hnm(:,m)=sum(B(:,Mb==m),2);
- end
- Q0 = -inf;
- Q = sum(B(bsxfun(@eq,M0,M0.'))); % compute modularity
- first_iteration = true;
- while Q-Q0>1e-10
- flag = true; % flag for within-hierarchy search
- while flag
- flag = false;
- for u=randperm(n) % loop over all nodes in random order
- ma = Mb(u); % current module of u
- dQ = Hnm(u,:) - Hnm(u,ma) + B(u,u);
- dQ(ma) = 0; % (line above) algorithm condition
- [max_dQ,mb] = max(dQ); % maximal increase in modularity and corresponding module
- if max_dQ>1e-10 % if maximal increase is positive
- flag = true;
- Mb(u) = mb; % reassign module
- Hnm(:,mb) = Hnm(:,mb)+B(:,u); % change node-to-module strengths
- Hnm(:,ma) = Hnm(:,ma)-B(:,u);
- end
- end
- end
- [~,~,Mb] = unique(Mb); % new module assignments
- M0 = M;
- if first_iteration
- M=Mb;
- first_iteration=false;
- else
- for u=1:n % loop through initial module assignments
- M(M0==u)=Mb(u); % assign new modules
- end
- end
- n=max(Mb); % new number of modules
- B1=zeros(n); % new weighted matrix
- for u=1:n
- for v=u:n
- bm=sum(sum(B(Mb==u,Mb==v))); % pool weights of nodes in same module
- B1(u,v)=bm;
- B1(v,u)=bm;
- end
- end
- B=B1;
- Mb=1:n; % initial module assignments
- Hnm=B; % node-to-module strength
- Q0=Q;
- Q=trace(B); % compute modularity
- end
community_louvain.m at commit 9ac5ad3, no license · at the source
Overview
- Institute for Neuroscience and Neurotechnology, Simon Fraser University, Burnaby, Canada
- Centre for Social Sciences, Athabasca University, Athabasca, Canada
- Department of Biomedical Physiology and Kinesiology, Simon Fraser University, Burnaby, Canada
- Rotman Research Institute, Baycrest Health Sciences, Toronto, Canada
- Department of Psychology, Simon Fraser University, Burnaby, Canada
Abstract
Chronic, long-term sleep loss is detrimental to brain health and cognitive ability. However, older adults are affected differently by acute, short-term loss of sleep than young and middle-aged adults. Older adults are more resilient to the effects of acute sleep loss and, depending on the cognitive domain, may be completely unaffected while younger adults suffer. To elucidate the brain network responses to sleep loss underlying these cognitive differences between age groups, we investigated the static and dynamic functional connectivity effects of acute sleep restriction (sleep limited to 3 hours) and how these effects differ between younger adults (20–30 years) and older adults (65–75 years). We found a functional connectivity subnetwork that was primarily strengthened in younger adults after acute sleep restriction but weakened in older adults after acute sleep restriction. Similar crossover interactions were consistently observed in further analyses of functional connectivity degree, modularity, and dynamic functional connectivity state fractional occupancy. Our findings demonstrate that the effect of acute sleep restriction on older adults is fundamentally different from that on younger adults. These results most strongly support the compensation theory of ageing, which predicts a fundamental shift in the effects of acute sleep loss, rather than a mere dampening of the sleep benefits experienced by younger adults.
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 8 matches between paragraphs and lines of code.
McIntosh-Lab/SleepyBrain_analyses
9ac5ad3bbe28feaa8cc7925ccf9adee716ae3877, 31 July 2025Availability: 1 check, the latest on 27 September 2026: the link answers
- 27 September 2026: the link answers
79 files
- 0_copy_data.sh, Shell, 16 lines
- 1_submit_preprocessing.s
h , Shell, 14 lines - 3_submit_matlab_analyses
.sh , Shell, 15 lines - 4_submit_python_analyses
.sh , Shell, 13 lines - 5_submit_r_analyses.sh, Shell, 21 lines
- 6_submit_FC_null_array.s
h , Shell, 20 lines - FC_null_array.m, MATLAB, 54 lines
- GM_sig_var_analyses.r, R, 44 lines
- PLS_usc_figures.r, R, 242 lines
- community_louvain.m, MATLAB, 198 lines, 2 matches
- data/
data_processing/ , Python, 456 linesimport_SleepyBrain_data. py - install_packages.r, R, 13 lines
- leida-matlab-1.0/
2_submit_leida.sh , Shell, 15 lines - leida-matlab-1.0/
LEiDA_AnalysisCentroid.m , MATLAB, 92 lines - leida-matlab-1.0/
LEiDA_AnalysisK.m , MATLAB, 98 lines - leida-matlab-1.0/
LEiDA_Start.m , MATLAB, 124 lines - leida-matlab-1.0/
LEiDA_StateTime.m , MATLAB, 80 lines - leida-matlab-1.0/
LEiDA_TransitionsK.m , MATLAB, 90 lines, 2 matches - leida-matlab-1.0/
run_all_after_start.m , MATLAB, 281 lines - leida-matlab-1.0/
submit_leida.sh , Shell, 11 lines - leida-matlab-1.0/
utilities/ , MATLAB, 149 linesanalyses_scripts/ EigenVectors_VoxelSpace. m - leida-matlab-1.0/
utilities/ , MATLAB, 62 linesanalyses_scripts/ LEiDA_cluster.m - leida-matlab-1.0/
utilities/ , MATLAB, 124 linesanalyses_scripts/ LEiDA_data.m - leida-matlab-1.0/
utilities/ , MATLAB, 213 linesanalyses_scripts/ LEiDA_stats_DwellTime.m - leida-matlab-1.0/
utilities/ , MATLAB, 184 linesanalyses_scripts/ LEiDA_stats_FracOccup.m - leida-matlab-1.0/
utilities/ , MATLAB, 198 lines, 1 matchanalyses_scripts/ LEiDA_stats_TransitionMa trix.m - leida-matlab-1.0/
utilities/ , MATLAB, 84 linesanalyses_scripts/ Overlap_LEiDA_Yeo.m - leida-matlab-1.0/
utilities/ , MATLAB, 92 linesanalyses_scripts/ Parcellate.m - leida-matlab-1.0/
utilities/ , MATLAB, 144 linesanalyses_scripts/ Parcellate_ABIDE_func_pr eproc.m - leida-matlab-1.0/
utilities/ , MATLAB, 18 linesanalyses_scripts/ TemporalFiltering.m - leida-matlab-1.0/
utilities/ , MATLAB, 48 linesanalyses_scripts/ append_tag.m - leida-matlab-1.0/
utilities/ , MATLAB, 186 linesanalyses_scripts/ bootstrap_within_permuta tion_paired_samples.m - leida-matlab-1.0/
utilities/ , MATLAB, 222 linesanalyses_scripts/ bootstrap_within_permuta tion_ttest2.m - leida-matlab-1.0/
utilities/ , MATLAB, 111 lines, 1 matchanalyses_scripts/ cluster_performance.m - leida-matlab-1.0/
utilities/ , MATLAB, 162 linesanalyses_scripts/ cluster_stability.m - leida-matlab-1.0/
utilities/ , MATLAB, 27 linesanalyses_scripts/ dunns.m - leida-matlab-1.0/
utilities/ , MATLAB, 121 linesanalyses_scripts/ rand_index.m - leida-matlab-1.0/
utilities/ , MATLAB, 128 linesfigures_scripts/ Plot_C_boxplot_DT.m - leida-matlab-1.0/
utilities/ , MATLAB, 126 linesfigures_scripts/ Plot_C_boxplot_FO.m - leida-matlab-1.0/
utilities/ , MATLAB, 311 linesfigures_scripts/ Plot_C_summary.m - leida-matlab-1.0/
utilities/ , MATLAB, 84 linesfigures_scripts/ Plot_C_vector_labelled.m - leida-matlab-1.0/
utilities/ , MATLAB, 96 linesfigures_scripts/ Plot_C_vector_ordered.m - leida-matlab-1.0/
utilities/ , MATLAB, 137 linesfigures_scripts/ Plot_Centroid_Pyramid.m - leida-matlab-1.0/
utilities/ , MATLAB, 258 linesfigures_scripts/ Plot_DwellTime.m - leida-matlab-1.0/
utilities/ , MATLAB, 258 linesfigures_scripts/ Plot_FracOccup.m - leida-matlab-1.0/
utilities/ , MATLAB, 153 linesfigures_scripts/ Plot_K_3Dbrain.m - leida-matlab-1.0/
utilities/ , MATLAB, 161 linesfigures_scripts/ Plot_K_V1_VoxelSpace.m - leida-matlab-1.0/
utilities/ , MATLAB, 97 linesfigures_scripts/ Plot_K_V1_VoxelSpace_Sli ce.m - leida-matlab-1.0/
utilities/ , MATLAB, 138 linesfigures_scripts/ Plot_K_boxplot_DT.m - leida-matlab-1.0/
utilities/ , MATLAB, 137 linesfigures_scripts/ Plot_K_boxplot_FO.m - leida-matlab-1.0/
utilities/ , MATLAB, 113 linesfigures_scripts/ Plot_K_diffs_transitions .m - leida-matlab-1.0/
utilities/ , MATLAB, 112 linesfigures_scripts/ Plot_K_links_in_cortex.m - leida-matlab-1.0/
utilities/ , MATLAB, 52 linesfigures_scripts/ Plot_K_matrix.m - leida-matlab-1.0/
utilities/ , MATLAB, 100 linesfigures_scripts/ Plot_K_nodes_in_cortex.m - leida-matlab-1.0/
utilities/ , MATLAB, 85 linesfigures_scripts/ Plot_K_overlap_yeo_nets. m - leida-matlab-1.0/
utilities/ , MATLAB, 314 linesfigures_scripts/ Plot_K_repertoire.m - leida-matlab-1.0/
utilities/ , MATLAB, 110 linesfigures_scripts/ Plot_K_state_time.m - leida-matlab-1.0/
utilities/ , MATLAB, 67 linesfigures_scripts/ Plot_K_tpm.m - leida-matlab-1.0/
utilities/ , MATLAB, 72 linesfigures_scripts/ Plot_K_vector_labelled.m - leida-matlab-1.0/
utilities/ , MATLAB, 61 linesfigures_scripts/ Plot_K_vector_numbered.m - leida-matlab-1.0/
utilities/ , MATLAB, 105 linesfigures_scripts/ Plot_subj_cluster_blocks .m - leida-matlab-1.0/
utilities/ , MATLAB, 90 linesfigures_scripts/ Plot_subj_stairs.m - leida-matlab-1.0/
utilities/ , MATLAB, 261 linesfigures_scripts/ linspecer.m - leida-matlab-1.0/
utilities/ , MATLAB, 55 linesfigures_scripts/ subplot_tight.m - mean_centred_pls.m, MATLAB, 1,529 lines
- modularity.m, MATLAB, 124 lines
- modularity_analyses.r, R, 49 lines
- null_model_und_sign.m, MATLAB, 181 lines, 1 match
- python_packages/
PyNeudorf/ , Python, 1 linesrc/ PyNeudorf/ __init__.py - python_packages/
PyNeudorf/ , Python, 1 linesrc/ PyNeudorf/ data/ __init__.py - python_packages/
PyNeudorf/ , R, 54 linessrc/ PyNeudorf/ data/ ggseg_Schaefer200.r - python_packages/
PyNeudorf/ , Python, 90 linessrc/ PyNeudorf/ graphs.py - python_packages/
brainvistools/ , Python, 1 linesrc/ brainvistools/ __init__.py - python_packages/
brainvistools/ , Python, 1 linesrc/ brainvistools/ data/ __init__.py - python_packages/
brainvistools/ , R, 119 linessrc/ brainvistools/ data/ ggseg_figure.r - python_packages/
brainvistools/ , Python, 453 lines, 1 matchsrc/ brainvistools/ visualization.py - randmio_und_signed.m, MATLAB, 80 lines
- rsfMRI_sleep_deprivation
_analyses.py , Python, 1,025 lines - README.md, Text, 96 lines
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;
- 78 scripts, each with its path and the digest of its content;
- 8 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
Datasets cited
- openfmri.org/
dataset/ , at openfmri.org; found in “Data and Code Availability”ds000201
Data and Code Availability
Data were downloaded from OpenfMRI (https://
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
- Authors: added Kelly Shen (0000-0001-8780-9299); Brianne Kent (0000-0003-0074-028X); removed Kelly Shen; Brianne Kent
Version 1, 27 September 2026: the first record
Recorded: type, language, journal, volume, pages, dates, 5 authors, 5 keywords, 2 funders, 85 references.
Cite
This paper
Neudorf, J., Rokos, L., Shen, K., Kent, B., & McIntosh, A. R. (2026). Young and old adult brains experience opposite effects of acute sleep restriction on the functional connectivity network. Imaging neuroscience (Cambridge, Mass.), 4, IMAG.a.1278. https://
BibTeX
@article{neudorf2026youn
author = {Neudorf, Josh and Rokos, Leanne and Shen, Kelly and Kent, Brianne and McIntosh, Anthony R.},
title = {{Young and old adult brains experience opposite effects of acute sleep restriction on the functional connectivity network}},
journal = {Imaging neuroscience (Cambridge, Mass.)},
year = {2026},
month = jun,
volume = {4},
pages = {IMAG.a.1278},
publisher = {MIT Press},
issn = {2837-6056},
doi = {10.1162/
url = {https://
pmid = {42326561},
pmcid = {PMC13281775}
}
RIS
TY - JOUR
AU - Neudorf, Josh
AU - Rokos, Leanne
AU - Shen, Kelly
AU - Kent, Brianne
AU - McIntosh, Anthony R.
TI - Young and old adult brains experience opposite effects of acute sleep restriction on the functional connectivity network
T2 - Imaging neuroscience (Cambridge, Mass.)
J2 - Imaging Neurosci (Camb)
PY - 2026
DA - 2026/
VL - 4
SP - IMAG.a.1278
SN - 2837-6056
PB - MIT Press
DO - 10.1162/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1162/
"type": "article-journal",
"title": "Young and old adult brains experience opposite effects of acute sleep restriction on the functional connectivity network",
"container-title": "Imaging neuroscience (Cambridge, Mass.)",
"author": [
{
"family": "Neudorf",
"given": "Josh"
},
{
"family": "Rokos",
"given": "Leanne"
},
{
"family": "Shen",
"given": "Kelly"
},
{
"family": "Kent",
"given": "Brianne"
},
{
"family": "McIntosh",
"given": "Anthony R."
}
],
"container-title-short":
"volume": "4",
"page": "IMAG.a.1278",
"DOI": "10.1162/
"PMID": "42326561",
"PMCID": "PMC13281775",
"ISSN": "2837-6056",
"publisher": "MIT Press",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
6,
18
]
]
}
}
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-76011-7 [code]
- Human cortex organizes dynamic co-fluctuations along the sensorimotor-association
axis. Journal: Nature communicationsIn common: ggseg, Brain Connectivity Toolbox, FSL, 10 other tools, 4 references - [2] 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 communicationsIn common: Brain Connectivity Toolbox, Parallel Computing Toolbox, FSL, 12 other tools, 2 references
- [3] doi:10.1016/j.nicl.2026.104012 [code]
- Structural-functional multilayer brain network properties and outcome of combined repetitive transcranial magnetic stimulation and psychotherapy for obsessive-compulsive disorder.Journal: NeuroImage. ClinicalIn common: Brain Connectivity Toolbox, NetworkX, lme4, 12 other tools, fMRI, 3 references
- [4] doi:10.1038/s41467-026-75959-w [code]
- Charting higher-order models of brain function beyond pairwise interactions.Journal: Nature communicationsIn common: neuromaps, Nilearn, NetworkX, 8 other tools, 6 references
- [5] doi:10.1038/s41531-026-01354-3 [code]
- Neuromodulation-induced normalization of cortical metastable dynamics signatures in Parkinson's disease.Journal: NPJ Parkinson's diseaseIn common: neuromaps, Nilearn, Signal Processing Toolbox, 8 other tools, 6 references
- [6] doi:10.1038/s41467-026-73668-y [code]
- Convergent and divergent brain-cognition development in early adolescence.Journal: Nature communicationsIn common: FSL, Nilearn, lme4, 11 other tools, fMRI, 3 references
- [7] doi:10.1038/s41398-026-04025-2 [code]
- Brain energetic landscapes shape state dysregulation in major depressive disorder: a morphological network controllability perspective.Journal: Translational psychiatryIn common: neuromaps, Brain Connectivity Toolbox, FSL, 10 other tools, 3 references
- [8] doi:10.1038/s41467-026-71270-w [code]
- Spatiotemporal dynamics of the human cortical functional hierarchy across the lifespan.Journal: Nature communicationsIn common: Parallel Computing Toolbox, FSL, Nilearn, 10 other tools, fMRI, 3 references
- [9] doi:10.1038/s41586-026-10631-3 [code]
- A prognostic human brain network for diffuse midline glioma.Journal: NatureIn common: neuromaps, Parallel Computing Toolbox, FSL, 10 other tools, 3 references
- [10] doi:10.7554/elife.103097 [code]
- Canonical neurodevelopmental trajectories of structural and functional manifolds.Journal: eLifeIn common: ggseg, neuromaps, Brain Connectivity Toolbox, 9 other tools, 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.
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, 78 scripts, and 8 matches 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:ad568d2f07bf4372…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[, paste the snippet at the top, then “Commit changes…” and, to review it first, “Create a new branch and start a pull request”. You open the pull request; OSCR asks for no permission.
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.
