Neural heterogeneity enables adaptive encoding of time sequences
Bibliographic record
Abstract
The timing mechanisms in biological systems operate across a vast range of scales, from microsecond precision for sound localization to annual cycles. A key open question concerns the mechanisms for encoding intermediate time intervals–hundreds of milliseconds to minutes–that are essential for navigation, communication, memory, and prediction. Here we present a theoretical framework that explains how neurons can represent such intervals using a common biophysical property: neural fatigue, where activity diminishes during sustained stimulation. Our Bayesian framework combines parametrically heterogeneous stochastic dynamical modeling with interval priors to predict available timing information independent of the actual decoding mechanism. We find that a trade-off emerges between accurately representing the most recent interval and retaining information about previous ones. We show that cellular diversity is not just tolerated but required to encode sequences of time intervals. Our work highlights the computational role of biological heterogeneity in shaping memory for time, with implications for understanding temporal processing in neural circuits. Biological systems must encode time intervals crucial for tasks like navigation and communication, yet mechanisms for intervals of hundreds of milliseconds to minutes remain unclear. The authors develop a Bayesian framework using neural fatigue and cellular heterogeneity to optimize interval representation, enhancing our understanding of timing memory and its computational roles.
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.005 |
| 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.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".