OSCR

Human cortical networks trade communication efficiency for computational reliability.

Code ↔ Paper

The paper beside its authors' code: matches between them have not been computed for this paper yet.

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

Python · 31 lines · 1.2 KB · MIT

  1. # Configuration file for the Sphinx documentation builder.
  2. #
  3. # For the full list of built-in configuration values, see the documentation:
  4. # https://www.sphinx-doc.org/en/master/usage/configuration.html
  5. # -- Project information -----------------------------------------------------
  6. # https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
  7. import os
  8. import sys
  9. sys.path.insert(0, os.path.abspath('..'))
  10. import yanat
  11. project = 'YANAT'
  12. copyright = '2024, Kayson Fakhar, Shrey Dixit'
  13. author = 'Kayson Fakhar, Shrey Dixit'
  14. release = yanat.__version__
  15. # -- General configuration ---------------------------------------------------
  16. # https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
  17. extensions = ["sphinx.ext.todo", "sphinx.ext.viewcode", "sphinx.ext.autodoc", "myst_parser", "nbsphinx", "sphinx.ext.napoleon"]
  18. templates_path = ['_templates']
  19. exclude_patterns = ['_build', 'Thumbs.db', '.DS_Store']
  20. # -- Options for HTML output -------------------------------------------------
  21. # https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
  22. html_theme = 'sphinx_rtd_theme'
  23. html_static_path = ['_static']

conf.py at commit 25ee298, under MIT · at the source

Overview

  1. MRC Cognition and Brain Sciences Unit, University of Cambridge, Cambridge, UK
  2. Institute of Computational Neuroscience, University Medical Center Hamburg-Eppendorf, Hamburg, Germany
  3. Department of Electrical and Electronic Engineering, Imperial College London, London, UK
  4. Imperial-X, Imperial College London, London, UK
  5. Centre for Eudaimonia and Human Flourishing, Linacre College and Department of Psychiatry, University of Oxford, Oxford, UK
  6. St. John’s College, University of Cambridge, Cambridge, UK
  7. Montreal Neurological Institute, Montreal, Canada
  8. Developmental Imaging, Murdoch Children’s Research Institute, Parkville, Australia
  9. School of Psychological Sciences, The Turner Institute for Brain and Mental Health, Monash University, Clayton, Australia
  10. Department of Psychiatry, University of Cambridge, Cambridge, UK
  11. Institute of Psychiatry, Psychology & Neuroscience, King’s College London, London, UK
  12. Department of Health Sciences, Boston University, Boston, MA, USA
Journal: Science advances, volume 12, issue 36, article eaef2894
Dates: received 7 January 2026; accepted 28 July 2026; published online 2 September 2026; in print September 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1126/sciadv.aef2894 · PMID 42685191 · PMCID PMC13537246 · OpenAlex W7115011065
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: computational modeling (no new data) (modality), human (organism)
Methods: Statistics, Smoothing, state filtering, decompositions, Connectivity, Graphs, Machine learning, fMRI & imaging, Physiology & signal measures, Preprocessing
MeSH: Cerebral Cortex*, Communication*, Models, Neurological*, Nerve Net*, Computer Simulation, Humans (* major topic)
Topic: Neural Networks and Reservoir Computing (Artificial Intelligence, Computer Science), according to OpenAlex
Funding: Wellcome Trust (226924/Z/23/Z, 309245/Z/24/Z); National Institute for Health Research (NIHR) (NIHR203312)
Citations: not cited yet (Europe PMC); 114 references in the paper

Abstract

Brains are often described as cost-efficient communication networks that optimally balance long-connection costs against fast communication. Inspired by the “use it or lose it” principle, we present a game-theoretic model of self-organizing neural units showing the brain is suboptimal in both regards. Regional competition for connectivity under propagative dynamics yields networks resembling the human cortex yet more efficient and economical. In addition, using a reservoir computing framework, we find comparable information processing capacity, but synthetic optimal communication networks show lower computational reliability. Last, virtual lesions reveal why these networks are fragile: To optimize communication, they funnel information through a spatially clustered “oligarchy” of transmodal hubs. The human brain instead uses a distributed “rich-club” backbone that better resists targeted attacks, despite higher wiring costs and less efficient communication. Cortical networks thus trade both cost and efficiency for reliable computation, highlighting computational reliability as an overlooked and perhaps even more prominent driver of brain connectivity than wiring cost or communication efficiency.

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

Repositories

Its files are read in the Code ↔ Paper reader above.

fabridamicelli.github.io/echoes

License: none: the authors keep all their rights
State: the link answers, verified on 26 September 2026
Evidence: the link answers
Software Heritage: not checked
Found in: “Data, code, and materials availability:”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 26 September 2026: the link answers (HTTP 200)
  • 26 September 2026: the link answers (HTTP 200)

netneurotools.readthedocs.io

License: none: the authors keep all their rights
State: the link answers, verified on 26 September 2026
Evidence: the link answers
Software Heritage: not checked
Found in: “Data, code, and materials availability:”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 26 September 2026: the link answers (HTTP 200)
  • 26 September 2026: the link answers (HTTP 200)

netneurolab.github.io/neuromaps

License: none: the authors keep all their rights
State: the link answers, verified on 26 September 2026
Evidence: the link answers
Software Heritage: not checked
Found in: “Data, code, and materials availability:”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 26 September 2026: the link answers (HTTP 200)
  • 26 September 2026: the link answers (HTTP 200)

kuffmode/yanat

License: MIT
State: the link answers, verified on 26 September 2026
Evidence: files inventoried
Commit: 25ee29860814679592de8c43ebc9d5c9bb720989, 2 December 2025
Languages: Python (13), Jupyter (2)
Size: 29 files, 15 scripts
Software Heritage: not archived
Found in: “Data, code, and materials availability:”
Holds: README, license file, CITATION.cff, environment (pyproject.toml), tests, continuous integration, documentation, 2 notebooks
Tools: Matplotlib (2 files), netneurotools (2 files), NumPy (2 files), SciPy (2 files), seaborn (2 files)
Availability: 1 check, the latest on 26 September 2026: the link answers
  • 26 September 2026: the link answers
5 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:

  • 4 repositories of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 3 scripts, each with its path and the digest of its content;
  • no match between paragraphs and code yet;
  • 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

Data, code, and materials availability

All data and code needed to evaluate and reproduce the conclusions in the paper are present in the paper and/or the Supplementary Materials. This study did not generate new materials. Specifically, the simulated optimal communication networks are available at: https://doi.org/10.5281/zenodo.20446126. The dataset used in this work is available at: www.humanconnectome.org/study/hcp-young-adult/document/900-subjects-data-release, and the following open-source Python libraries were used: YANAT (Yet Another Network Analysis Toolkit; https://kuffmode.github.io/YANAT/) for the game-theoretic framework, Echoes (https://fabridamicelli.github.io/echoes/) for neuromorphic modeling, Netneurotools (https://netneurotools.readthedocs.io/en/latest/) for thresholding empirical networks, Brain Connectivity Toolbox (BCT; https://github.com/aestrivex/bctpy) for constructing degree-preserved null models, Networkx (https://networkx.org/) for constructing fully random networks, and Neuromaps (https://netneurolab.github.io/neuromaps/) for comparing brain maps. A plug-and-play tutorial for the game-theoretic generative model, including features that were not explored here, is also available at: https://github.com/kuffmode/YANAT/blob/main/examples/generative_game_theoric.ipynb.

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, 9 authors, 6 MeSH terms, 2 funders, 99 references.

Cite

This paper

Fakhar, K., Akarca, D., Luppi, A. I., Oldham, S., Hadaeghi, F., Vértes, P. E., Bullmore, E., Hilgetag, C., & Astle, D. (2026). Human cortical networks trade communication efficiency for computational reliability. Science advances, 12(36), eaef2894. https://doi.org/10.1126/sciadv.aef2894

BibTeX

@article{fakhar2026human,
author = {Fakhar, Kayson and Akarca, Danyal and Luppi, Andrea I and Oldham, Stuart and Hadaeghi, Fatemeh and Vértes, Petra E and Bullmore, Ed and Hilgetag, Claus and Astle, Duncan},
title = {{Human cortical networks trade communication efficiency for computational reliability}},
journal = {Science advances},
year = {2026},
month = sep,
volume = {12},
number = {36},
pages = {eaef2894},
publisher = {American Association for the Advancement of Science},
issn = {2375-2548},
doi = {10.1126/sciadv.aef2894},
url = {https://doi.org/10.1126/sciadv.aef2894},
pmid = {42685191},
pmcid = {PMC13537246}
}

RIS

TY - JOUR
AU - Fakhar, Kayson
AU - Akarca, Danyal
AU - Luppi, Andrea I
AU - Oldham, Stuart
AU - Hadaeghi, Fatemeh
AU - Vértes, Petra E
AU - Bullmore, Ed
AU - Hilgetag, Claus
AU - Astle, Duncan
TI - Human cortical networks trade communication efficiency for computational reliability
T2 - Science advances
J2 - Sci Adv
PY - 2026
DA - 2026/09/02
VL - 12
IS - 36
SP - eaef2894
SN - 2375-2548
PB - American Association for the Advancement of Science
DO - 10.1126/sciadv.aef2894
UR - https://doi.org/10.1126/sciadv.aef2894
LA - en
ER -

CSL-JSON

{
"id": "10.1126/sciadv.aef2894",
"type": "article-journal",
"title": "Human cortical networks trade communication efficiency for computational reliability",
"container-title": "Science advances",
"author": [
{
"family": "Fakhar",
"given": "Kayson"
},
{
"family": "Akarca",
"given": "Danyal"
},
{
"family": "Luppi",
"given": "Andrea I"
},
{
"family": "Oldham",
"given": "Stuart"
},
{
"family": "Hadaeghi",
"given": "Fatemeh"
},
{
"family": "Vértes",
"given": "Petra E"
},
{
"family": "Bullmore",
"given": "Ed"
},
{
"family": "Hilgetag",
"given": "Claus"
},
{
"family": "Astle",
"given": "Duncan"
}
],
"container-title-short": "Sci Adv",
"volume": "12",
"issue": "36",
"page": "eaef2894",
"DOI": "10.1126/sciadv.aef2894",
"PMID": "42685191",
"PMCID": "PMC13537246",
"ISSN": "2375-2548",
"publisher": "American Association for the Advancement of Science",
"URL": "https://doi.org/10.1126/sciadv.aef2894",
"language": "en",
"issued": {
"date-parts": [
[
2026,
9,
2
]
]
}
}

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.64898/2025.12.11.693716 [code]
Human cortical networks trade communication efficiency for computational reliability.
Journal: bioRxiv (preprint)
In common: humanconnectome.org/study/hcp-young-adult, 53 references, 9 authors
[2] doi:10.7554/elife.101780 [code]
A general framework for characterizing optimal communication in brain networks.
Journal: eLife
In common: netneurotools, seaborn, SciPy, 2 other tools, 27 references, 2 authors
[3] doi:10.1038/s41551-024-01242-2 [code]
Contributions of network structure, chemoarchitecture and diagnostic categories to transitions between cognitive topographies.
Journal: Nature biomedical engineering
In common: seaborn, SciPy, Matplotlib, 1 other tool, humanconnectome.org/study/hcp-young-adult, 22 references, author Andrea I Luppi
[4] doi:10.1162/netn_a_00318 [code]
Resolving inter-regional communication capacity in the human connectome.
Journal: Network neuroscience (Cambridge, Mass.)
In common: netneurotools, seaborn, SciPy, 2 other tools, 20 references
[5] doi:10.1162/netn.a.35 [code]
Coming up short: Generative network models fail to accurately capture long-range connectivity.
Journal: Network neuroscience (Cambridge, Mass.)
In common: computational modeling (no new data), 23 references
[6] doi:10.1038/s41467-023-38585-4 [code]
Assortative mixing in micro-architecturally annotated brain connectomes.
Journal: Nature communications
In common: netneurotools, seaborn, SciPy, 2 other tools, computational modeling (no new data), 21 references
[7] doi:10.1038/s41467-026-74466-2 [code]
Neuromorphic hierarchical modular reservoirs.
Journal: Nature communications
In common: netneurotools, seaborn, SciPy, 2 other tools, 15 references, author Andrea I Luppi
[8] doi:10.1038/s42003-026-09560-8 [code]
Controlling the human connectome with spatially diffuse input signals.
Journal: Communications biology
In common: SciPy, Matplotlib, NumPy, humanconnectome.org/study/hcp-young-adult, 18 references, author Andrea I Luppi
[9] doi:10.1038/s41593-026-02205-3 [code]
Competitive interactions shape mammalian brain network dynamics and computation.
Journal: Nature neuroscience
In common: seaborn, SciPy, Matplotlib, 1 other tool, computational modeling (no new data), 16 references, author Andrea I Luppi
[10] doi:10.1038/s41592-025-02704-4 [code]
Benchmarking methods for mapping functional connectivity in the brain.
Journal: Nature methods
In common: netneurotools, seaborn, SciPy, 2 other tools, 16 references, author Andrea I Luppi

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.1126/sciadv.aef2894.svg)](https://openscicode.org/badge/doi/10.1126/sciadv.aef2894)
<!-- oscr-badge:end -->
reStructuredText
.. oscr-badge:start

.. image:: https://openscicode.org/badge/doi/10.1126/sciadv.aef2894.svg
   :target: https://openscicode.org/badge/doi/10.1126/sciadv.aef2894
   :alt: OSCR

.. oscr-badge:end
HTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1126/sciadv.aef2894"><img src="https://openscicode.org/badge/doi/10.1126/sciadv.aef2894.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.