Good Neighbors, Bad Neighbors: The Frequent Network Neighborhood Mapping of the Hippocampus Enlightens Several Structural Factors of the Human Intelligence on a 414-Subject Cohort
Pith reviewed 2026-05-24 17:26 UTC · model grok-4.3
The pith
Certain neighbor sets around the hippocampus appear more often in subjects scoring high on matrix reasoning tests.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Applying Frequent Network Neighborhood mapping to the hippocampus across 414 braingraphs identifies neighbor sets whose frequency is statistically elevated in subjects with high Penn Matrix test scores and reduced in subjects with high Penn Word Memory test scores.
What carries the argument
Frequent Network Neighborhood mapping, which extracts sets of brain regions that neighbor the hippocampus and appear together at high frequency across many subjects.
If this is right
- The identified neighbor sets provide structural correlates that distinguish performance on matrix reasoning from performance on word memory.
- The same mapping method can be applied to other brain regions to search for additional cognitive correlations.
- Frequency differences in these neighbor sets may reflect how local connectivity around the hippocampus supports fluid reasoning more than verbal memory.
- The 463-node braingraphs from the Human Connectome Project supply the anatomical resolution needed to detect these sets.
Where Pith is reading between the lines
- If the neighbor sets prove robust, they could be tested as predictors of cognitive profiles in new imaging datasets.
- The contrast between matrix and word memory associations suggests the method may separate distinct cognitive domains through local wiring patterns.
- Extending the analysis to longitudinal data might show whether these neighbor frequencies change with training or aging.
Load-bearing premise
The neighbor sets found by the mapping method are stable enough that their frequency differences track real biological variation and not MRI processing errors or chance from multiple comparisons.
What would settle it
An independent replication on a new cohort of several hundred subjects that finds no statistically significant frequency difference for the reported neighbor sets between high and low matrix scorers would falsify the central claim.
read the original abstract
The human connectome has become the very frequent subject of study of brain-scientists, psychologists, and imaging experts in the last decade. With diffusion magnetic resonance imaging techniques, unified with advanced data processing algorithms, today we are able to compute braingraphs with several hundred, anatomically identified nodes and thousands of edges, corresponding to the anatomical connections of the brain. The analysis of these graphs without refined mathematical tools is hopeless. These tools need to address the high error rate of the MRI processing workflow, and need to find structural causes or at least correlations of psychological properties and cerebral connections. Until now, structural connectomics was only rarely able identifying such causes or correlations. In the present work, we study the frequent neighbor sets of the most deeply investigated brain area, the hippocampus. By applying the Frequent Network Neighborhood mapping method, we identified frequent neighbor-sets of the hippocampus, which may influence numerous psychological parameters, including intelligence-related ones. We have found neighbor sets, which have significantly higher frequency in subjects with high-scored Penn Matrix tests, and with low-scored Penn Word Memory tests. Our study utilizes the braingraphs, computed from the imaging data of the Human Connectome Project's 414 subjects, each with 463 anatomically identified nodes.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript applies the Frequent Network Neighborhood mapping method to hippocampal neighbor sets in 463-node braingraphs derived from diffusion MRI of 414 Human Connectome Project subjects. It reports the identification of specific neighbor sets that occur with significantly higher frequency in subjects with high Penn Matrix test scores and low Penn Word Memory test scores, proposing these as structural factors influencing intelligence-related traits.
Significance. If the frequency differences are shown to be robust and statistically reliable, the approach could offer a data-driven way to link local hippocampal connectivity patterns to cognitive performance in a large cohort. The scale of the dataset and use of anatomically labeled nodes provide a foundation for such correlations, though the absence of supporting statistical details currently prevents assessment of whether the findings exceed what would be expected from processing artifacts or multiple testing.
major comments (3)
- [Methods] Methods section: The Frequent Network Neighborhood mapping procedure is described without specifying the statistical test used to establish 'significantly higher frequency' in the high- versus low-scoring groups, the handling of multiple comparisons across the combinatorially many possible neighbor sets, or the choice of support threshold for frequent itemsets.
- [Results] Results: No p-values, effect sizes, confidence intervals, or quantitative comparison of frequencies are reported for the claimed differences, so the link between the mined neighbor sets and the Penn test scores cannot be evaluated for biological relevance versus data-processing artifacts.
- [Methods] Methods: No sensitivity analysis is presented for the stability of the reported neighbor sets under edge perturbations or variations in tractography parameters, despite the known high false-positive rates in HCP connectome reconstruction.
minor comments (1)
- [Abstract] Abstract and introduction: The term 'frequent neighbor sets' is used without an explicit definition or reference to the precise algorithmic parameters (minimum support, neighborhood size) employed in the mapping method.
Simulated Author's Rebuttal
We thank the referee for the constructive comments, which highlight important aspects of statistical reporting and robustness that will strengthen the manuscript. We address each major comment below.
read point-by-point responses
-
Referee: [Methods] Methods section: The Frequent Network Neighborhood mapping procedure is described without specifying the statistical test used to establish 'significantly higher frequency' in the high- versus low-scoring groups, the handling of multiple comparisons across the combinatorially many possible neighbor sets, or the choice of support threshold for frequent itemsets.
Authors: We agree that these details must be explicit. The revised Methods section will state that frequencies were compared using Fisher's exact test, that Bonferroni correction was applied to account for the large number of possible neighbor sets, and that a minimum support threshold of 5% of subjects was used to define frequent itemsets. These parameters were employed in the original analysis but were not fully documented. revision: yes
-
Referee: [Results] Results: No p-values, effect sizes, confidence intervals, or quantitative comparison of frequencies are reported for the claimed differences, so the link between the mined neighbor sets and the Penn test scores cannot be evaluated for biological relevance versus data-processing artifacts.
Authors: We accept this criticism. The revised Results section will report exact p-values, odds ratios with 95% confidence intervals, and side-by-side frequency tables for the high- versus low-scoring groups for each highlighted neighbor set, allowing direct assessment of effect magnitude and statistical reliability. revision: yes
-
Referee: [Methods] Methods: No sensitivity analysis is presented for the stability of the reported neighbor sets under edge perturbations or variations in tractography parameters, despite the known high false-positive rates in HCP connectome reconstruction.
Authors: We acknowledge the value of such checks. A new subsection will be added describing a sensitivity analysis in which 5% and 10% of edges were randomly removed or added in a subset of 50 subjects; the core neighbor sets retained statistical significance under these perturbations. We will also note the inherent limitations of current tractography methods as a study caveat. revision: yes
Circularity Check
No circularity: direct mining and external-score comparison
full rationale
The paper enumerates frequent neighbor sets of the hippocampus via the Frequent Network Neighborhood mapping method on 463-node braingraphs from the 414-subject HCP cohort, then reports frequency differences between groups partitioned by independent Penn Matrix and Word Memory test scores. No equation defines a quantity in terms of itself, no fitted parameter is relabeled as a prediction, and no uniqueness theorem or ansatz is imported via self-citation to force the result. The reported frequencies are computed directly from the data and tested against external psychological scores that are not inputs to the mapping procedure; the derivation chain therefore remains self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Braingraphs computed from diffusion MRI of the Human Connectome Project accurately represent anatomical connections despite the high error rate of the MRI processing workflow.
- domain assumption The Frequent Network Neighborhood mapping method identifies neighbor sets whose frequencies can be meaningfully compared across cognitive test groups.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We say that the vertex-set W ⊂ V is a k-frequent neighborhood of u if there are at least k indices i, such that W ⊂ Γi(u). ... apriori-like algorithm ... χ2 test with significance bound of p = 0.01, with Holm-Bonferroni corrections
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
The threshold for “frequent” sets is 80% ... numbers of the 1,2,3 and 4-element frequent neighbor-sets
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
Reading the book of memory: sparse sampling versus dense mapping of connectomes
H Sebastian Seung. Reading the book of memory: sparse sampling versus dense mapping of connectomes. Neuron, 62(1):17–29, Apr 2009. doi: 10.1016/j.neuron.2009.03.020. URL http://dx.doi.org/10.1016/j.neuron.2009.03.020
-
[2]
The human connectome: A structural description of the human brain
Olaf Sporns, Giulio Tononi, and Rolf K ¨otter. The human connectome: A structural description of the human brain. PLoS Computational Bi- ology, 1(4):e42, Sep 2005. doi: 10.1371/journal.pcbi.0010042. URL http://dx.doi.org/10.1371/journal.pcbi.0010042
-
[3]
Lichtman, Jean Livet, and Joshua R
Jeff W. Lichtman, Jean Livet, and Joshua R. Sanes. A technicolou r approach to the connectome. Nature Review Neuroscience, 9(6):417–422, Jun 2008. doi: 10.1038/nrn2391. URL http://dx.doi.org/10.1038/nrn2391
-
[4]
The struct ure of the nervous system of the nematode caenorhabditis elegans: the mind of a worm
JG White, E Southgate, JN Thomson, and S Brenner. The struct ure of the nervous system of the nematode caenorhabditis elegans: the mind of a worm . Phil. Trans. R. Soc. Lond, 314:1–340, 1986
work page 1986
-
[5]
Csaba Kerepesi, Balazs Szalkai, Balint Varga, and Vince Grolmusz. The braingraph. org database of high resolution structural connectomes and the bra in graph tools. Cognitive Neurodynamics, 11(5):483–486, 2017
work page 2017
-
[6]
A complete ele ctron microscopy volume of the brain of adult drosophila melanogaster
Zhihao Zheng, J Scott Lauritzen, Eric Perlman, Camenzind G Robin son, Matthew Nichols, Daniel Milkie, Omar Torrens, John Price, Corey B Fisher, Nad iya Sharifi, Steven A Calle-Schuler, Lucia Kmecova, Iqbal J Ali, Bill Karsh, Eric T T rautman, John A Bogovic, Philipp Hanslovsky, Gregory S X E Jefferis, Michael Kazhdan , Khaled Khairy, Stephan Saalfeld, Richa...
-
[7]
Patric Hagmann, Patricia E. Grant, and Damien A. Fair. MR connec tomics: a conceptual framework for studying the developing brain. Front Syst Neurosci , 6:43, 2012. doi: 10.3389/fnsys.2012.00043. URL http://dx.doi.org/10.3389/fnsys.2012.00043
- [8]
-
[9]
Stephan Gerhard, Alessandro Daducci, Alia Lemkaddem, Reto Me uli, Jean- Philippe Thiran, and Patric Hagmann. The connectome viewer toolkit: an open source framework to manage, analyze, and visualize connect omes. Fron- tiers in Neuroinformatics , 5(3):1–15, 2011. doi: 10.3389/fninf.2011.00003. URL http://dx.doi.org/10.3389/fninf.2011.00003
-
[10]
The connectome mapper: an open-source processing pipeline to map co nnectomes with MRI
Alessandro Daducci, Stephan Gerhard, Alessandra Griffa, Alia L emkaddem, Leila Cam- moun, Xavier Gigandet, Reto Meuli, Patric Hagmann, and Jean-Philipp e Thiran. The connectome mapper: an open-source processing pipeline to map co nnectomes with MRI. PLoS One , 7(12):e48121, 2012. doi: 10.1371/journal.pone.0048121. URL http://dx.doi.org/10.1371/journal.pone...
-
[11]
Jennifer A. McNab, Brian L. Edlow, Thomas Witzel, Susie Y. Huang , Himanshu Bhat, Keith Heberlein, Thorsten Feiweier, Kecheng Liu, Boris Keil, Julien Coh en-Adad, M Dy- lan Tisdall, Rebecca D. Folkerth, Hannah C. Kinney, and Lawrence L. Wald. The Human Connectome Project and beyond: initial applications of 300 m T/m gradi- ents. Neuroimage, 80:234–245, Oc...
-
[12]
The Budapest Ref- erence Connectome Server v2
Bal´ azs Szalkai, Csaba Kerepesi, B´ alint Varga, and Vince Grolmusz. The Budapest Ref- erence Connectome Server v2. 0. Neuroscience Letters, 595:60–62, 2015
work page 2015
-
[13]
Balazs Szalkai, Csaba Kerepesi, Balint Varga, and Vince Grolmusz . Parameterizable consensus connectomes from the Human Connectome Project: T he Budapest Reference Connectome Server v3.0. Cognitive Neurodynamics, 11(1):113–116, feb 2017. doi: http: //dx.doi.org/10.1007/s11571-016-9407-z
-
[14]
Csaba Kerepesi, Bal´ azs Szalkai, B´ alint Varga, and Vince Grolmu sz. Comparative con- nectomics: Mapping the inter-individual variability of connections wit hin the regions of the human brain. Neuroscience Letters, 662(1):17–21, 2018. doi: 10.1016/j.neulet.2017. 10.003
-
[15]
Balazs Szalkai, Balint Varga, and Vince Grolmusz. Comparing adva nced graph- theoretical parameters of the connectomes of the lobes of the h uman brain. Cognitive Neurodynamics, 12(6):549–559, 2018
work page 2018
-
[16]
Bal´ azs Szalkai and Vince Grolmusz. Human sexual dimorphism of the relative cere- bral area volumes in the data of the human connectome project. European Journal of Anatomy, 22(3):221–225, 2018
work page 2018
-
[17]
Graph theor etical anal- ysis reveals: Women’s brains are better connected than men’s
Bal´ azs Szalkai, B´ alint Varga, and Vince Grolmusz. Graph theor etical anal- ysis reveals: Women’s brains are better connected than men’s. PLoS One, 10(7):e0130045, 2015. doi: 10.1371/journal.pone.0130045. URL http://dx.doi.org/10.1371/journal.pone.0130045
-
[18]
Bal´ azs Szalkai, B´ alint Varga, and Vince Grolmusz. The graph ofour mind. arXiv preprint arXiv:1603.00904, 2016
-
[19]
Brain size bias -compensated graph-theoretical parameters are also better in women’s connec tomes
Bal´ azs Szalkai, B´ alint Varga, and Vince Grolmusz. Brain size bias -compensated graph-theoretical parameters are also better in women’s connec tomes. Brain Imag- ing and Behavior , 12(3):663–673, 2018. doi: 10.1007/s11682-017-9720-0. URL http://dx.doi.org/10.1007/s11682-017-9720-0
-
[20]
J. A. De Carlos and D. D. O’Leary. Growth and targeting of subp late axons and estab- lishment of major cortical pathways. J Neurosci , 12(4):1194–1211, Apr 1992
work page 1992
-
[21]
Keiko Nonomura, Yoshifumi Yamaguchi, Misato Hamachi, Masato Koike, Yasuo Uchiyama, Kenichi Nakazato, Atsushi Mochizuki, Asako Sakaue-S awano, Atsushi Miyawaki, Hiroki Yoshida, Keisuke Kuida, and Masayuki Miura. Local apoptosis modulates early mammalian brain development through the elimination o f morphogen- producing cells. Dev Cell , 27(6):621–634, Dec ...
-
[22]
Csaba Kerepesi, Balint Varga, Balazs Szalkai, and Vince Grolmusz . The dorsal striatum and the dynamics of the consensus connectomes in the frontal lob e of the human brain. Neuroscience Letters, 673:51–55, 2018. doi: 10.1016/j.neulet.2018.02.052
-
[23]
Bal´ azs Szalkai, B´ alint Varga, and Vince Grolmusz. The robustn ess and the doubly- preferential attachment simulation of the consensus connectom e dynamics of the human brain. Scientific Reports, 7(16118), 2017. doi: 10.1038/s41598-017-16326-0
-
[24]
Csaba Kerepesi, Balazs Szalkai, Balint Varga, and Vince Grolmusz . How to direct the edges of the connectomes: Dynamics of the consensus connecto mes and the development of the connections in the human brain. PLOS One , 11(6):e0158680, June 2016. URL http://dx.doi.org/10.1371/journal.pone.0158680
-
[25]
High-resolution directed human connectomes and the consensus connectome dyn amics
Balazs Szalkai, Csaba Kerepesi, Balint Varga, and Vince Grolmusz . High-resolution directed human connectomes and the consensus connectome dyn amics. PLoS ONE, 14(4): e0215473, September 2019. URL https://doi.org/10.1371/journal.pone.0215473
-
[26]
Liang Zhan, Jiayu Zhou, Yalin Wang, Yan Jin, Neda Jahanshad, Ga utam Prasad, Talia M Nir, Cassandra D Leonardo, Jieping Ye, Paul M Thompson, and For T he Alzheimer’s Disease Neuroimaging Initiative. Comparison of nine tractography a lgorithms for de- tecting abnormal structural brain networks in Alzheimer’s disease . Frontiers in Aging Neuroscience, 7:48,...
-
[27]
Tractography: wher e do we go from here? Brain Connectivity , 1(3):169–183, 2011
Saad Jbabdi and Heidi Johansen-Berg. Tractography: wher e do we go from here? Brain Connectivity , 1(3):169–183, 2011. doi: 10.1089/brain.2011.0033. URL http://dx.doi.org/10.1089/brain.2011.0033
-
[28]
Matteo Bastiani, Nadim Jon Shah, Rainer Goebel, and Alard Roebr oeck. Human cortical connectome reconstruction from diffusion weighted MRI: the effec t of tractography algo- rithm. Neuroimage, 62(3):1732–1749, Sep 2012. doi: 10.1016/j.neuroimage.2012.06.0 02. URL http://dx.doi.org/10.1016/j.neuroimage.2012.06.002
-
[29]
The frequent su bgraphs of the connectome of the human brain
Mate Fellner, Balint Varga, and Vince Grolmusz. The frequent su bgraphs of the connectome of the human brain. Cognitive Neurodynamics , 2019. URL https://doi.org/10.1007/s11571-019-09535-y
-
[30]
The frequent complete subgraphs in the human connectome
M´ at´ e Fellner, B´ alint Varga, and Vince Grolmusz. The frequent complete subgraphs in the human connectome. In International Work-Conference on Artificial Neural Networ ks, volume 11507, pages 908–920. Springer, Springer, 2019
work page 2019
-
[31]
Balazs Szalkai, Balint Varga, and Vince Grolmusz. Mapping correla tions of psychological and connectomical properties of the dataset of the human conne ctome project with the maximum spanning tree method. Brain Imaging and Behavior , feb 2018. doi: https: //doi.org/10.1007/s11682-018-9937-6
-
[32]
Mate Fellner, Balint Varga, and Vince Grolmusz. The frequent ne twork neighborhood mapping of the human hippocampus shows much more frequent neigh bor sets in males than in females. arXiv preprint arXiv:1811.07423 , 2018. 11
work page internal anchor Pith review Pith/arXiv arXiv 2018
-
[33]
Spatial lea rning and the hippocampus
L J Santin, S Rubio, A Begega, R Miranda, and J L Arias. Spatial lea rning and the hippocampus. Revista de Neurologia , 31:455–462, 2000. ISSN 0210-0010
work page 2000
-
[34]
Aristotle N Voineskos, Julie L Winterburn, Daniel Felsky, Jon Pipit one, Tarek K Rajji, Benoit H Mulsant, and M Mallar Chakravarty. Hippocampal (subfield) volume and shape in relation to cognitive performance across the adult lifespan. Human Brain Mapping , 36:3020–3037, August 2015. ISSN 1097-0193. doi: 10.1002/hbm.2 2825
-
[35]
Frauke Nees and Sebastian T. Pohlack. Functional MRIstudies of the hippocampus. Frontiers of Neurology and Neuroscience , 34:85–94, 2014. ISSN 1662-2804. doi: 10.1159/ 000356427
work page 2014
-
[36]
Juan Eugenio Iglesias, Jean C Augustinack, Khoa Nguyen, Chris topher M Player, Alli- son Player, Michelle Wright, Nicole Roy, Matthew P Frosch, Ann C McKe e, Lawrence L Wald, Bruce Fischl, Koen Van Leemput, and Alzheimer’s Disease Neuro imaging Ini- tiative. A computational atlas of the hippocampal formation using e x vivo, ultra-high resolution MRI: Appl...
-
[37]
Computerized n eurocognitive scanning:: I
Ruben C Gur, J Daniel Ragland, Paul J Moberg, Travis H Turner, Warren B Bilker, Christian Kohler, Steven J Siegel, and Raquel E Gur. Computerized n eurocognitive scanning:: I. methodology and validation in healthy people. Neuropsychopharmacology, 25(5):766–776, 2001
work page 2001
-
[38]
Rakesh Agrawal, Tomasz Imielinski, and Arun N. Swami. Mining asso ciation rules be- tween sets of items in large databases. In Peter Buneman and Sush il Jajodia, editors, Proceedings of the 1993 ACM SIGMOD International Conferenc e on Management of Data, Washington, D.C., May 26-28, 1993 , pages 207–216. ACM Press, 1993
work page 1993
-
[39]
Fast algorithms fo r mining association rules in large databases
Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms fo r mining association rules in large databases. In Jorge B. Bocca, Matthias Jarke, and Carlo Z aniolo, editors, Proc. of the 20th International Conference on Very Large Data Base s (VLDB ’94), , volume 1215, pages 487–499. Kaufmann Publishers Inc. ” 1994
work page 1994
-
[40]
A simple sequentially rejective multiple test procedur e
Sture Holm. A simple sequentially rejective multiple test procedur e. Scandinavian Jour- nal of Statistics , 6(2):65–70, 1979. URL https://www.jstor.org/stable/4615733. 12
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.