Communicability Characterization of Structural DWI Subcortical Networks in Alzheimer’s Disease
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we investigate the connectivity alterations of the subcortical brain network due to Alzheimer's disease (AD). Mostly, the literature investigated AD connectivity abnormalities at the whole brain level or at the cortex level, while very few studies focused on the sub-network composed only by the subcortical regions, especially using diffusion-weighted imaging (DWI) data. In this work, we examine a mixed cohort including 46 healthy controls (HC) and 40 AD patients from the Alzheimer's Disease Neuroimaging Initiative (ADNI) data set. We reconstruct the brain connectome through the use of state of the art tractography algorithms and we propose a method based on graph communicability to enhance the information content of subcortical brain regions in discriminating AD. We develop a classification framework, achieving 77% of area under the receiver operating characteristic (ROC) curve in the binary discrimination AD vs. HC only using a 12 × 12 subcortical features matrix. We find some interesting AD-related connectivity patterns highlighting that subcortical regions tend to increase their communicability through cortical regions to compensate the physical connectivity reduction between them due to AD. This study also suggests that AD connectivity alterations mostly regard the inter-connectivity between subcortical and cortical regions rather than the intra-subcortical connectivity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it