Tuned geometries of hippocampal representations meet the demands of social memory
Bibliographic record
Abstract
Abstract Social recognition consists of multiple memory processes, including the detection of familiarity – the ability to rapidly distinguish familiar from novel individuals – and recollection – the effortful recall of where a social episode occurred and who was present. At present, the neural mechanisms for these different social memory processes remain unknown. Here, we investigate the population code for novel and familiar individuals in mice using calcium imaging of neural activity in a region crucial for social memory, the dorsal CA2 area of the hippocampus. We report that familiarity changes CA2 representations of social encounters to meet the different demands of social memory. While novel individuals are represented in a low-dimensional geometry that allows for rapid generalization, familiar individuals are represented in a higher-dimensional geometry that supports high-capacity memory storage. The magnitude of the change in dimensionality of CA2 representations for a given individual predicts the performance of that individual in a social recognition memory test, suggesting a direct relationship between the representational geometry and memory-guided behavior. Finally, we show that familiarity is encoded as an abstract variable with neural responses generalizing across different identities and spatial locations. Thus, through the tuning of the geometry of structured neural activity, CA2 is able to meet the complex demands of multiple social memory processes.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".