{"as_of":"2026-08-10T02:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:49276ccea16e501550a1800857cb074cc923e10abf388c40bab319755bbea4a1","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:31:19.171471Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T23:10:44.860801Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.02984","last_updated":"2024-02-20T19:17:52Z","snapshot_observed_at":"2026-08-09T04:40:43.234558Z","submitted_at":"2023-10-04T17:20:34Z","title":"Scaling Laws for Associative Memories","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02984","snapshot_observed_at":"2026-08-06T19:31:19.171471Z","title":"Cabannes, E","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.05644","last_updated":"2025-09-05T01:58:57Z","snapshot_observed_at":"2026-08-09T17:06:53.067923Z","submitted_at":"2025-07-08T03:52:48Z","title":"The Features at Convergence Theorem: a first-principles alternative to the Neural Feature Ansatz for how networks learn representations","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:31:19.171471Z"},"links":{"cited_paper":"/paper/2310.02984","citing_paper":"/paper/2507.05644"},"observation_digest":"sha256:34d98f40e5d000ea8fef096a36b6d1a938e04a2a43b5dce6398f16867836922a","observation_id":"b81b91af-df0c-4091-a82e-b4c499256fed","resolution":{"observed_at":"2026-08-06T19:31:19.171471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02984","last_updated":"2024-02-20T19:17:52Z","snapshot_observed_at":"2026-08-09T04:40:43.234558Z","submitted_at":"2023-10-04T17:20:34Z","title":"Scaling Laws for Associative Memories","version":2},"cited_work":{"arxiv_id":"2310.02984","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.02984","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scaling laws for associative memories","venue":null,"work_id":"622e7ff2-595e-4cd8-8d2c-a3141b4b0301","year":2023},"citing_paper":{"arxiv_id":"2508.00901","last_updated":"2026-05-18T13:04:24Z","snapshot_observed_at":"2026-08-02T13:13:12.421550Z","submitted_at":"2025-07-28T17:24:57Z","title":"Provable Knowledge Acquisition and Extraction in One-Layer Transformers","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T23:05:56.687644Z"},"links":{"cited_paper":"/paper/2310.02984","citing_paper":"/paper/2508.00901"},"observation_digest":"sha256:f513b2b967c16a05d221b09eded9403b1a00bd42a945ccdce5d7eecad9e71729","observation_id":"e3e4f27d-6cd1-488b-ac03-dc1803f1a87a","resolution":{"observed_at":"2026-05-21T23:10:44.862743Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02984","last_updated":"2024-02-20T19:17:52Z","snapshot_observed_at":"2026-08-09T04:40:43.234558Z","submitted_at":"2023-10-04T17:20:34Z","title":"Scaling Laws for Associative Memories","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02984","snapshot_observed_at":"2026-08-03T16:34:33.084703Z","title":"Cabannes, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.13491","last_updated":"2026-06-22T06:30:05Z","snapshot_observed_at":"2026-08-07T23:56:10.506186Z","submitted_at":"2025-12-15T16:25:06Z","title":"From Zipf's Law to Neural Scaling through Heaps' Law and Hilberg's Hypothesis","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T16:34:33.084703Z"},"links":{"cited_paper":"/paper/2310.02984","citing_paper":"/paper/2512.13491"},"observation_digest":"sha256:7cba2a1bb3309c518dd345266aeb24a51984b7ad98ad3acee286cc678a8000b2","observation_id":"a31b80b2-5637-44a4-b8dc-16a9dfbc3ce1","resolution":{"observed_at":"2026-08-03T16:34:33.084703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02984","last_updated":"2024-02-20T19:17:52Z","snapshot_observed_at":"2026-08-09T04:40:43.234558Z","submitted_at":"2023-10-04T17:20:34Z","title":"Scaling Laws for Associative Memories","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02984","snapshot_observed_at":"2026-08-03T04:14:13.432391Z","title":", Dohmatob, E","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.05725","last_updated":"2026-06-03T16:40:26Z","snapshot_observed_at":"2026-08-03T04:14:09.367178Z","submitted_at":"2026-02-05T14:49:40Z","title":"Muon in Associative Memory Learning: Training Dynamics and Scaling Laws","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-03T04:14:13.432391Z"},"links":{"cited_paper":"/paper/2310.02984","citing_paper":"/paper/2602.05725"},"observation_digest":"sha256:c51143c10cd5e430143007177983ec7d2c4c151f42046c87d882413f40c1f806","observation_id":"4f65800a-3e51-44f0-8c5c-5c7099804397","resolution":{"observed_at":"2026-08-03T04:14:13.432391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02984","last_updated":"2024-02-20T19:17:52Z","snapshot_observed_at":"2026-08-09T04:40:43.234558Z","submitted_at":"2023-10-04T17:20:34Z","title":"Scaling Laws for Associative Memories","version":2},"cited_work":{"arxiv_id":"2310.02984","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.02984","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scaling laws for associative memories","venue":null,"work_id":"622e7ff2-595e-4cd8-8d2c-a3141b4b0301","year":2023},"citing_paper":{"arxiv_id":"2605.05189","last_updated":"2026-05-06T17:53:20Z","snapshot_observed_at":"2026-07-06T23:17:52.987860Z","submitted_at":"2026-05-06T17:53:20Z","title":"Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2310.02984","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:995148ad8dd32a1a30fbc6c72a8b21b3ef3301ee0933dd2adfb2198d88ed311c","observation_id":"6b9f30fd-ad69-4e47-b955-19eea330bd0c","resolution":{"observed_at":"2026-05-11T18:16:09.982062Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02984","last_updated":"2024-02-20T19:17:52Z","snapshot_observed_at":"2026-08-09T04:40:43.234558Z","submitted_at":"2023-10-04T17:20:34Z","title":"Scaling Laws for Associative Memories","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02984","snapshot_observed_at":"2026-07-14T04:23:21.000846Z","title":"arXiv preprint arXiv:2310.02984 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11614","last_updated":"2026-07-13T14:37:24Z","snapshot_observed_at":"2026-08-07T12:33:44.646398Z","submitted_at":"2026-07-13T14:37:24Z","title":"Extending LLM Context via Associative Recurrent Memory","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-14T04:23:21.000846Z"},"links":{"cited_paper":"/paper/2310.02984","citing_paper":"/paper/2607.11614"},"observation_digest":"sha256:7673407873921e318d32081de3ff972ef2566d7bed643775238db86ff55822d7","observation_id":"2471482c-4825-4f4d-a37f-772602908ce0","resolution":{"observed_at":"2026-07-14T04:23:21.000846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.02984/citation-record","integrity":"/paper/2310.02984/integrity","json":"/paper/2310.02984/citation-record.json","paper":"/paper/2310.02984"},"outbound":[],"paper":{"arxiv_id":"2310.02984","last_updated":"2024-02-20T19:17:52Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-09T04:40:43.234558Z","submitted_at":"2023-10-04T17:20:34Z","title":"Scaling Laws for Associative Memories"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2310.02984."}