Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Efficient and optimal binary Hopfield associative memory storage using minimum probability flow
As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1204.2916.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-04T00:14:41.591186Z
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 0c69128e-93af-4c9a-94a3-367f57ce0fbd · inbound
Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks cites this paper.
Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks Efficient and optimal binary Hopfield associative memory storage using minimum probability flow
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:14:41.591186Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.