Evidence map›Paper›PMID 40749040›Full record

ArticlePLoS computational biology2025

Continual familiarity decoding from recurrent connections in spiking networks.

Viktoria Zemliak, Gordon Pipa, Pascal Nieters

Abstract read
In one paragraph

Article in PLoS computational biology, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Viktoria ZemliakInstitute of Cognitive Science, Osnabrück University, Osnabrück, Germany.ORCID 0000-0003-2050-7290
Gordon PipaInstitute of Cognitive Science, Osnabrück University, Osnabrück, Germany.
Pascal NietersInstitute of Cognitive Science, Osnabrück University, Osnabrück, Germany.ORCID 0000-0003-0538-6670

Funding

Deutsche Forschungsgemeinschaft (DFG)Volkswagen Foundation
6 · The paper itself

Abstract

Familiarity memory enables recognition of previously encountered inputs as familiar without recalling detailed stimuli information, which supports adaptive behavior across various timescales. We present a spiking neural network model with lateral connectivity shaped by unsupervised spike-timing-dependent plasticity (STDP) that encodes familiarity via local plasticity events. We show that familiarity can be decoded from network activity using both frequency (spike count) and temporal (spike synchrony) characteristics of spike trains. Temporal coding demonstrates enhanced performance under sparse input conditions, consistent with the principles of sparse coding observed in the brain. We also show how connectivity structure supports each decoding strategy, revealing different plasticity regimes. Our approach outperforms LSTM in temporal generalizability on the continual familiarity detection task, with input stimuli being naturally encoded in the recurrent connectivity without a separate training stage.

Indexed as

Action PotentialsModels, NeurologicalNerve NetRecognition, PsychologyAnimalsBrainComputational BiologyHumansNeural Networks, ComputerNeuronal PlasticityNeurons

Identifiers

PMID40749040
PMCPMC12334059

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.