{"as_of":"2026-08-04T21:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea5b8bd3a222d7ef3c5e2bb9fd4930d7df7bc2fe8ea10a2b3854db8fc489c9d2","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T16:23:37.393165Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T04:13:59.594279Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-12T06:31:25.657120Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2605.05189","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.05189","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval","venue":"stat.ML","work_id":"d13d2635-934f-4897-93ae-e9d289869e52","year":2026},"citing_paper":{"arxiv_id":"2605.10795","last_updated":"2026-05-11T16:24:02Z","snapshot_observed_at":"2026-07-06T23:22:42.512039Z","submitted_at":"2026-05-11T16:24:02Z","title":"Factual recall in linear associative memories: sharp asymptotics and mechanistic insights","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-12T04:13:59.594279Z"},"links":{"cited_paper":"/paper/2605.05189","citing_paper":"/paper/2605.10795"},"observation_digest":"sha256:07a7363ce790968da325e261036ea34d435ce501b40300657cfc777e624ccbf6","observation_id":"28919e21-68a3-449c-912f-8e3770ef527e","resolution":{"observed_at":"2026-05-12T06:31:25.660164Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.05189/citation-record","integrity":"/paper/2605.05189/integrity","json":"/paper/2605.05189/citation-record.json","paper":"/paper/2605.05189"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c199ab04-0069-472e-a963-c485a0890042","year":null},"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":1,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:7a0b1730526d1582f5d3c1e72148eea0417a5d9b80a84df2d413dc726b757f83","observation_id":"effd35aa-24e7-4524-b898-cac0453ca8d2","resolution":{"observed_at":"2026-05-26T10:07:09.449634Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T16:27:47.445841Z","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:cefb051a9b6da8bdafafa4a49bd4d4022f985eee43ab33819c20724e350672af","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-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06538","last_updated":"2024-12-09T14:48:14Z","snapshot_observed_at":"2026-07-06T20:03:56.309640Z","submitted_at":"2024-12-09T14:48:14Z","title":"Understanding Factual Recall in Transformers via Associative Memories","version":1},"cited_work":{"arxiv_id":"2412.06538","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.06538","snapshot_observed_at":"2026-07-10T01:36:44.301678Z","title":"Understanding factual recall in transformers via associative memories","venue":"cs.LG","work_id":"35a95075-3fb2-463f-9082-33da2c36f958","year":2024},"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":3,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2412.06538","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:176191dc1dbb86f84677fd071a247f572194787a9da24d6e95cbe51a3a4f3aa1","observation_id":"4c23b168-17e3-4984-a6e7-2d6d183ef263","resolution":{"observed_at":"2026-05-11T18:16:10.005297Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00802","last_updated":"2023-11-06T22:51:51Z","snapshot_observed_at":"2026-08-04T02:06:18.573409Z","submitted_at":"2023-06-01T15:30:33Z","title":"Birth of a Transformer: A Memory Viewpoint","version":2},"cited_work":{"arxiv_id":"2306.00802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.00802","snapshot_observed_at":"2026-07-11T01:27:45.888651Z","title":"Gregor Bachmann and Vaishnavh Nagarajan","venue":"stat.ML","work_id":"f5ae8ffd-8047-45a5-b02e-1fa830687493","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":4,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2306.00802","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:c2593895a662a6a48c697589adf676a88103ddd24310b77ac480e9b4693a5d93","observation_id":"90d742bf-299f-4abf-88bd-f200b4babff7","resolution":{"observed_at":"2026-05-11T18:16:10.087460Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.26554","last_updated":"2026-04-28T07:36:37Z","snapshot_observed_at":"2026-07-06T22:50:46.243903Z","submitted_at":"2026-03-27T16:13:18Z","title":"Sharp Capacity Scaling of Spectral Optimizers in Learning Associative Memory","version":2},"cited_work":{"arxiv_id":"2603.26554","doi":null,"metadata_source":"pith","pith_arxiv_id":"2603.26554","snapshot_observed_at":"2026-07-04T06:29:38.170656Z","title":"Sharp Capacity Scaling of Spectral Optimizers in Learning Associative Memory","venue":"cs.LG","work_id":"27b10d69-3108-497a-9be8-937bfa7571d9","year":2026},"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":5,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2603.26554","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:fe95b33776d6d570896fd7609ec1313dda18d59986ab6c2fc8c05e2e43a9b241","observation_id":"4043c371-ee47-4af6-8152-efe3a5407f4c","resolution":{"observed_at":"2026-05-11T18:16:10.033987Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"1972 , volume=","venue":null,"work_id":"faaf090a-1888-4ea4-86b2-63ec806bc278","year":1972},"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":6,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:f8fece63ce7d83259616fbdae7b8ee981522475bd12b7d8e13c7142b3c4044fa","observation_id":"97026a0a-e52c-49f0-b6cf-44ca9c43ad88","resolution":{"observed_at":"2026-05-26T10:07:09.456405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"journal=","venue":null,"work_id":"15687137-22b6-41e0-8afc-1918bb251f76","year":1972},"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":7,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:bd81e5f61bf31e89b13816eb2a5b60f17418d59aabfeb192c477297f695747e4","observation_id":"536dc822-2c09-48b1-8350-68147b13b0e6","resolution":{"observed_at":"2026-05-26T10:07:09.439728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"year =","venue":null,"work_id":"d09f5855-a820-4282-8fe5-0e18cef4f4b6","year":null},"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":8,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:d1d0f608c852df651de69c43ce30413fb4571977824a2e82611c5e96c7459786","observation_id":"2b113155-0e8e-4a80-9fd5-9223acf5c350","resolution":{"observed_at":"2026-05-26T10:07:09.446076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Kaiser","venue":null,"work_id":"d794744d-fc3d-4b61-be59-ed7939bc0bd9","year":2017},"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":9,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:783ae7fd3c5a6e64607b23f2cdffb33a99b73f9cb33ff18169da670c99ee6332","observation_id":"dc350cf4-ba5e-4cf0-83d3-f562e262ad0e","resolution":{"observed_at":"2026-05-26T10:07:09.432788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02950","last_updated":"2025-03-04T03:10:09Z","snapshot_observed_at":"2026-08-04T06:23:17.853986Z","submitted_at":"2025-01-06T11:46:40Z","title":"Key-value memory in the brain","version":2},"cited_work":{"arxiv_id":"2501.02950","doi":"10.48550/arxiv.2501.02950","metadata_source":"pith","pith_arxiv_id":"2501.02950","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Key-value memory in the brain","venue":"q-bio.NC","work_id":"62dd20d3-f4c2-4888-83d2-9cb687fe7fb5","year":2025},"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":10,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2501.02950","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:6259620378fc5ee848037b895c1d321c114dab0c8131cbbf138a71993d289e5c","observation_id":"244b94d9-9b16-423a-bc56-dc2354202bce","resolution":{"observed_at":"2026-05-11T18:16:09.946205Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-18T08:51:26.908338+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T08:51:26.908338+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.02217","last_updated":"2021-04-28T07:24:49Z","snapshot_observed_at":"2026-07-29T23:03:53.079001Z","submitted_at":"2020-07-16T17:52:37Z","title":"Hopfield Networks is All You Need","version":3},"cited_work":{"arxiv_id":"2008.02217","doi":"10.48550/arxiv.2008.02217","metadata_source":"pith","pith_arxiv_id":"2008.02217","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hopfield Networks is All You Need","venue":"cs.NE","work_id":"d543a17d-a7d0-42ab-9530-af90c3e63067","year":2020},"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":11,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2008.02217","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:d39a1c1e8d5dbd61c2b50cea3bd8f3477b035468dc9191800386aff5873549d4","observation_id":"3d71dfb7-aef8-40f6-be19-78353bc7d56d","resolution":{"observed_at":"2026-05-17T05:48:07.671009Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18400","last_updated":"2024-11-27T22:41:03Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:49:54Z","title":"Do LLMs dream of elephants (when told not to)? Latent concept association and associative memory in transformers","version":2},"cited_work":{"arxiv_id":"2406.18400","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.18400","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2406.18400 , archivePrefix=","venue":null,"work_id":"bc2bf7eb-f777-4228-a1ea-3a97e1ab8070","year":null},"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":12,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2406.18400","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:0cb3dcf315479735f01b312e545416dcf793194eeb86c2b0ffd34c5a12e99bb7","observation_id":"4999bcbe-892c-498f-8632-96e3a5e8d59a","resolution":{"observed_at":"2026-05-11T18:16:10.139438Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0025-5564(72)90075-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T09:51:50.284796Z","title":"1972 , issn =","venue":null,"work_id":"065c778f-8ccf-43d4-b9e0-c61b14990d92","year":1972},"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":13,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:d2fc34139127f356d5c471d31d9a1c5966ae2807fe783054845b5ccefb0f2b82","observation_id":"1ba78d2f-af96-49c7-8b4c-d2bcd4943df9","resolution":{"observed_at":"2026-05-08T20:19:09.990009Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T13:56:19.898734Z","title":"Locating and Editing Factual Associations in","venue":null,"work_id":"fe4a5a40-b31d-4c7c-820e-ece1c981c29e","year":null},"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":14,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:f7dd0f49c66dac3712721c2092759a8f4c39ceffcd566b63063bed619f740a1f","observation_id":"9c2a25c8-168c-48cc-95ea-303f9a1a7f5b","resolution":{"observed_at":"2026-05-26T10:07:09.497878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.14913","last_updated":"2021-09-05T17:32:27Z","snapshot_observed_at":"2026-08-02T07:29:08.108809Z","submitted_at":"2020-12-29T19:12:05Z","title":"Transformer Feed-Forward Layers Are Key-Value Memories","version":2},"cited_work":{"arxiv_id":"2012.14913","doi":"10.18653/v1/2021.emnlp-main.446","metadata_source":"pith","pith_arxiv_id":"2012.14913","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Transformer Feed-Forward Layers Are Key-Value Memories","venue":"cs.CL","work_id":"af95ed34-d603-4b8d-b5d5-582dd09e9938","year":2020},"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":15,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2012.14913","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:3cd8d976591a1dcea7a36d4d3e697a846e4c2f8e6e2eb381674fd9592779cb2b","observation_id":"d7ac6e75-a811-445e-ae31-cb332fa05a0e","resolution":{"observed_at":"2026-05-13T23:35:50.837220Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-03T23:38:07.231994+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T23:38:07.231994+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.10652","last_updated":"2022-09-21T20:49:26Z","snapshot_observed_at":"2026-07-06T13:54:56.779166Z","submitted_at":"2022-09-21T20:49:26Z","title":"Toy Models of Superposition","version":1},"cited_work":{"arxiv_id":"2209.10652","doi":"10.48550/arxiv.2209.10652","metadata_source":"pith","pith_arxiv_id":"2209.10652","snapshot_observed_at":"2026-07-10T13:57:06.883449Z","title":"Toy Models of Superposition","venue":"cs.LG","work_id":"43875dbe-bc2d-4ab5-af63-744411533ff7","year":2022},"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":16,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2209.10652","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:83d489b1e473997fd4ccfc18a0c3e34318cd675c02cabfec7ba37b20e41c4c8b","observation_id":"b5ef011f-cd8c-4cf0-9f16-bff5aee9ff80","resolution":{"observed_at":"2026-05-11T22:44:43.591728Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.01863","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"[Lac23] Daniel Lacker","venue":null,"work_id":"b7a58e9e-204d-4c6d-90c0-74e72c914838","year":2026},"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":17,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:cdd97bdb36980770e4c47841a71107a65609cbe45e4626ef997bf43c457f03bf","observation_id":"7b637b87-85e6-4f3e-b799-2a8bccc8300e","resolution":{"observed_at":"2026-05-11T18:16:09.997242Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tyrrell and Uryasev, Stanislav , year =","venue":null,"work_id":"473d207c-f5d3-400d-b614-530a3d4dc6e5","year":null},"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":18,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:48f29e9518f200464db219e2f5839bc3696b78aab666cf8dc7f0af3153b8d498","observation_id":"7d5087d2-6601-4d87-b06c-09063fe1fbfd","resolution":{"observed_at":"2026-05-26T10:07:09.422471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tyrrell and Uryasev, Stanislav , year =","venue":null,"work_id":"960af95a-2b2b-4036-941d-540b3fe2c126","year":null},"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":19,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:b1ed17940d32fa1ebd5503f6d541f1abd226202715f2f3f1ba506840aa8cc454","observation_id":"768688d5-7bdc-4a60-a9de-f34fc947ba7e","resolution":{"observed_at":"2026-05-26T10:07:09.425786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Lim, Chinghway and Yu, Bin , title =","venue":null,"work_id":"9c576f45-0939-48a5-bc4e-fbd447ad90ec","year":2013},"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":20,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:cb23a6c1f48cb174c90dab28a6dfafa37bc5b75694b29729128970485a14184c","observation_id":"8f564f63-f79f-44d8-9da8-6e284cfac67f","resolution":{"observed_at":"2026-05-26T10:07:09.429623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and El Karoui, Noureddine , title =","venue":null,"work_id":"88d031c4-bccd-4d8f-9bf1-d3f9507eaa68","year":2018},"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":21,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:662245b4020aa15372762ba0d99a5dd2edda5b9256517a3199fe2bd41828d7b1","observation_id":"f6f73f50-4e59-4556-b4b8-9c6ef6c1d22c","resolution":{"observed_at":"2026-05-26T10:07:09.443051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Probability Theory and Related Fields , volume =","venue":null,"work_id":"5b28491c-35d3-471b-8f13-670538522d3b","year":2018},"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":22,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:464335a2fd535a2dbe02c4e394c631ab50fd1f1501381bd47e879fc1b8163e02","observation_id":"c3e0fe83-4063-4a37-aa16-8d317c79d78e","resolution":{"observed_at":"2026-05-26T10:07:09.415653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7bd3a8dd-b2c9-4af6-93c9-562856b46eb5","year":null},"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":23,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:83809382b67c75c07a30193456ec2213789ba3ea922c23f1f02493b76e6614cd","observation_id":"fb2d64d1-8ece-4d73-8f18-df0f65c5e147","resolution":{"observed_at":"2026-05-26T10:07:09.409209Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Foundations and Trends in Theoretical Computer Science , volume =","venue":null,"work_id":"7ce431cd-95b2-4866-980f-b687f928eb9c","year":2007},"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":24,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:e73557a19e908c2ecc965a52ffe932e504f24033cf05f2e9c8a781ce3e77f742","observation_id":"1c710cdf-afd4-454a-bf14-3e23ff8ba397","resolution":{"observed_at":"2026-05-26T10:07:09.419006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 24th International Conference on Machine Learning , pages =","venue":null,"work_id":"cd181ad2-2ff7-4c82-bca5-a90ab6bd8b06","year":2007},"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":25,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:3ef92667cee73343361d9e9e14f384d783d1757654380f0f54c6fdabe5fa1655","observation_id":"e49209cd-52af-40f3-872f-c704f6f7a2e6","resolution":{"observed_at":"2026-05-26T10:07:09.412285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tsmc.1972.4309133","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T18:15:00.863488Z","title":"1972 , volume=","venue":null,"work_id":"4e689d48-b705-40a0-a5ab-cfbcd552f146","year":1972},"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":26,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:5facf513e79b2c0e1624923a3ce0c3308d1501fb44eb33760ba92787876b14bf","observation_id":"36de966d-e016-4390-9fd4-d20c93e734e7","resolution":{"observed_at":"2026-05-08T20:19:09.985870Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d0c49212-bd3c-49cc-8b78-c672de4b4995","year":1949},"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":27,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:ce6636d3d081cfe0bdf51352b0ef8bdb782f1a719748b620a166a16cb2fd4bd4","observation_id":"a1394f65-c01d-4b6b-b279-49119e439689","resolution":{"observed_at":"2026-05-26T10:07:09.436254Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"32bdf6ba-9293-4dff-bc4e-7c18d41e1846","year":1969},"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":28,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:a691449820b878232557350f8d00d160388a5f9dcac09f51243fdfe62a0e00df","observation_id":"f2357003-c3dc-4793-9743-0999ff3653cd","resolution":{"observed_at":"2026-05-26T10:07:09.460109Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1209/0295-5075/4/4/016","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T07:01:44.276741Z","title":"Gardner , title =","venue":null,"work_id":"9e69b393-73c7-444c-8b12-88cb78b2e502","year":1987},"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":29,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:2caa25afe933acb17330dcd7b405f6b7daf33193e94698dbed17835c9c681dfa","observation_id":"40c94373-bb27-4d33-b4b2-59ccb304c8da","resolution":{"observed_at":"2026-05-08T20:19:09.969494Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"title=","venue":null,"work_id":"de57609b-43db-4f16-8a01-4b3f740aaa9d","year":null},"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":30,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:95b1a1e5b9088e61dfbfc17947e7d393c197f0390de246cec439996f973512c4","observation_id":"690e6774-a46f-4ded-933a-1d2763a274d1","resolution":{"observed_at":"2026-05-26T10:07:09.483443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gardner , title=","venue":null,"work_id":"9b6132e1-3add-4264-8cf2-606f95c38b11","year":null},"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":31,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:a3e0bb1205a6a4dbffff1d2a79b6381e3d1e2ae2d6c7edd5c02028214c318c2a","observation_id":"251e17e8-dfc3-404d-b08a-a89745a2724b","resolution":{"observed_at":"2026-05-26T10:07:09.501338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.5401","last_updated":"2014-12-10T16:01:39Z","snapshot_observed_at":"2026-08-01T22:22:04.725773Z","submitted_at":"2014-10-20T19:28:26Z","title":"Neural Turing Machines","version":2},"cited_work":{"arxiv_id":"1410.5401","doi":"10.48550/arxiv.1410.5401","metadata_source":"pith","pith_arxiv_id":"1410.5401","snapshot_observed_at":"2026-07-11T00:57:41.808702Z","title":"Neural Turing Machines","venue":"cs.NE","work_id":"0a5ce53c-9670-42b9-8be5-386de7eed50c","year":2014},"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":32,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/1410.5401","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:12d7154ebf83b661fdadfb94a02aed18e9e7440aa2c84406135ca2db74789c3c","observation_id":"f6173546-b373-4fd1-b917-0728fbdefb0f","resolution":{"observed_at":"2026-05-13T07:34:44.411886Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-12T23:19:27.735387+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T23:19:27.735387+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.3916","last_updated":"2015-11-29T07:00:41Z","snapshot_observed_at":"2026-07-06T03:57:23.878683Z","submitted_at":"2014-10-15T03:13:18Z","title":"Memory Networks","version":11},"cited_work":{"arxiv_id":"1410.3916","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.3916","snapshot_observed_at":"2026-07-04T01:09:18.555961Z","title":"Memory Networks","venue":"cs.AI","work_id":"a1b36ec8-6f26-40c2-92cc-790c4e8f63bd","year":2014},"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":33,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/1410.3916","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:7dfe8f8db8470b62e9927f544bdc7c55240e3b1d778c75393a9c62651db0404c","observation_id":"85f14ea2-7bf2-485a-a6aa-32d3c7526fd2","resolution":{"observed_at":"2026-05-11T18:16:09.988795Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.01164","last_updated":"2016-09-27T16:05:36Z","snapshot_observed_at":"2026-07-06T04:58:42.267198Z","submitted_at":"2016-06-03T16:17:01Z","title":"Dense Associative Memory for Pattern Recognition","version":2},"cited_work":{"arxiv_id":"1606.01164","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1606.01164","snapshot_observed_at":"2026-07-04T21:50:43.575477Z","title":"1606.01164 , archivePrefix=","venue":null,"work_id":"51e19f0b-6042-44a6-8ac4-77b8ca06ae48","year":null},"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":34,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/1606.01164","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:19d9398bfa464cc31bd3350f3914154913b045dd47ba8196abb0c9ff0c6ebe20","observation_id":"e51c7ab3-bfe2-4b42-854a-11bc39137eee","resolution":{"observed_at":"2026-07-04T21:50:43.575477Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , year=","venue":null,"work_id":"2d945b79-45cd-4491-917b-01ced979d3e8","year":null},"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":35,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:3f33d4acd95d34c7ba96f2f084478b440c5383459a422bcddcdc92c64bbde9c6","observation_id":"81a2b5e3-34ed-42d2-b6dd-504d568d5fb1","resolution":{"observed_at":"2026-05-26T10:07:09.505271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.04557","last_updated":"2022-06-17T16:05:47Z","snapshot_observed_at":"2026-08-04T11:27:55.515323Z","submitted_at":"2022-02-09T16:48:06Z","title":"Universal Hopfield Networks: A General Framework for Single-Shot Associative Memory Models","version":2},"cited_work":{"arxiv_id":"2202.04557","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.04557","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2202.04557 , archivePrefix=","venue":null,"work_id":"93cb3cc8-cd56-457d-ae7c-9ae065318640","year":null},"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":36,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2202.04557","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:dc0da5993a2f84f98bfeb55df02c9b8ebc0c9df36fd9a4ef3df1899345b8e20f","observation_id":"a82d48ab-f1ae-422c-84b8-198958ed622b","resolution":{"observed_at":"2026-05-11T18:16:09.907049Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05405","last_updated":"2024-04-08T11:11:31Z","snapshot_observed_at":"2026-07-06T17:57:06.330791Z","submitted_at":"2024-04-08T11:11:31Z","title":"Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws","version":1},"cited_work":{"arxiv_id":"2404.05405","doi":"10.48550/arxiv.2404.05405","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.05405","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Physics of language models: Part 3.3, knowledge capacity scaling laws","venue":null,"work_id":"316d7b8f-344c-4c99-a387-d012a17b5c50","year":2025},"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":37,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2404.05405","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:58ad8654d6ae3be560800398d60f21ec1b97a07e77fca9ed554cbf4e904bdd5e","observation_id":"c8b17a7a-e22b-4e42-bde3-aab89807ec82","resolution":{"observed_at":"2026-05-11T18:16:09.968352Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physrevlett.132.077301","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T06:05:28.487517Z","title":"Physical Review Letters , publisher=","venue":null,"work_id":"f547df60-bbe9-419c-8630-f9b9eeea87d1","year":2024},"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":38,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:9452ca913f49f693e95ec5a705ed7e16caa7ed6ebd301d6de63ab6d907a16c72","observation_id":"5a4c6742-2a1a-4c55-9321-5472a12b08d7","resolution":{"observed_at":"2026-05-08T20:19:09.974044Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3389/fncom.2016.00144","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T00:15:00.872479Z","title":"Frontiers in Computational Neuroscience , year =","venue":null,"work_id":"9742bd5a-6227-4871-a4a2-533ff99fb7df","year":2016},"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":39,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:9b689ae5c6fad09217639efd6efcfb57a3bfbf8df9a6cbfbd57d8cbdf87c381f","observation_id":"6682463b-b491-4b85-8cfb-e827b819d1c1","resolution":{"observed_at":"2026-05-08T20:19:09.966137Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"IEEE Transactions on Information Theory , year=","venue":null,"work_id":"57211a25-4ced-407c-80ef-f501409e322c","year":null},"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":40,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:4cc857425470ca9345b2af01803d52a412c72cec8f1d7a873e3e221a30f11193","observation_id":"d945925d-d64b-4a43-bf56-7c46ae8e673f","resolution":{"observed_at":"2026-05-26T10:07:09.476794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.15923","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2603.15923 , archivePrefix=","venue":null,"work_id":"6240e673-100a-45a3-a0a7-13718abe779b","year":null},"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":41,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:4ba72cdccc893ce71239046ccaed4eccc264463e012837c3db699dd226aac809","observation_id":"3fd43785-8a34-4790-9fac-b5e766f7b680","resolution":{"observed_at":"2026-05-11T18:16:10.145530Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.09753","last_updated":"2018-04-25T18:53:11Z","snapshot_observed_at":"2026-07-06T06:35:28.999576Z","submitted_at":"2018-04-25T18:53:11Z","title":"The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression","version":1},"cited_work":{"arxiv_id":"1804.09753","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1804.09753","snapshot_observed_at":"2026-07-04T22:43:44.669896Z","title":"Candes and Pragya Sur , year=","venue":null,"work_id":"03d6902e-46b8-4c01-83b9-9afbbd8dcd03","year":null},"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":42,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/1804.09753","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:18a597b4ab9256268b768535ce7c41916818db7c2147728a9dd65bc1d1a5a05b","observation_id":"ce51becf-2590-428c-8a2e-43ea8d5254bd","resolution":{"observed_at":"2026-07-04T22:43:44.669896Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the National Academy of Sciences , year=","venue":null,"work_id":"5daafbbc-8070-40d9-9cfa-7f050a8024c7","year":null},"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":43,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:42f1c9c4708f6212e188cf9187d940f67df5718bffd5952567795fe5f3643292","observation_id":"e6c7dc7e-e906-4b59-8f39-ef5249d2d269","resolution":{"observed_at":"2026-05-26T10:07:09.480254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the National Academy of Sciences , year=","venue":null,"work_id":"ce57e7d4-8bf9-4e1e-9d13-cc20f6eea9ee","year":null},"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":44,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:94735b98b026009ffa85798b9c7f52a8bae78b8a155dd5464e8038218f09ab5c","observation_id":"0b21fd58-4507-4323-a226-2161d24ced6f","resolution":{"observed_at":"2026-05-26T10:07:09.486596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Zdeborov","venue":null,"work_id":"6d0563f1-42d5-42db-98b9-94e15c3a6470","year":null},"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":45,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:19c9322c74df4c3d906340e8d428f804423d98da08dff047f207e7f8496ba394","observation_id":"e0d4248a-5298-4a41-8e2b-e1b58dc184c0","resolution":{"observed_at":"2026-05-26T10:07:09.493591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"International conference on machine learning , pages=","venue":null,"work_id":"c26314b9-9241-46b8-9a5c-dd65177c2659","year":null},"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":46,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:0fd9c7c6255189082e1b25d50952203ba4ab37b3d550f308e486b3bae1f8667b","observation_id":"713ff5c1-3a15-4c6e-b1bd-3f388b0369a0","resolution":{"observed_at":"2026-05-26T10:07:09.473428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18724","last_updated":"2024-02-28T21:47:30Z","snapshot_observed_at":"2026-08-04T18:39:27.530283Z","submitted_at":"2024-02-28T21:47:30Z","title":"Learning Associative Memories with Gradient Descent","version":1},"cited_work":{"arxiv_id":"2402.18724","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.18724","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning associative memories with gradient descent","venue":null,"work_id":"b9611efc-d70a-4ee6-b02d-b2d42c4019cf","year":2024},"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":47,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"cited_paper":"/paper/2402.18724","citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:41c36d86b49bd806f0531706a9af03a20bb56622abdbdb7da5ac3f8423960cec","observation_id":"64cd932e-b9f1-48c3-b178-762813e8b388","resolution":{"observed_at":"2026-05-11T18:16:10.107695Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"af6da72a-21cb-4a66-b535-bb369b8b042f","year":null},"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":48,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:4d3f9c3440a3cad5538d571b6fe83eb4b09c295e7bdd5720f4f38dfb2439499f","observation_id":"7d67fc30-f793-4c2a-99c3-7917b902bd15","resolution":{"observed_at":"2026-05-26T10:07:09.467004Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"1973 , volume=","venue":null,"work_id":"6037a7bb-deb6-41ec-b97c-a1702b22383e","year":1973},"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":49,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:67bf7bbd3ccf000dd2e70ae8801948f822fdf41214641116f246c5a47c010ef4","observation_id":"ec1ca4ac-590d-436e-9e0f-05d1d321accd","resolution":{"observed_at":"2026-05-26T10:07:09.470229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"journal=","venue":null,"work_id":"2d96ada5-a214-4625-8471-b8fbea477d4b","year":1988},"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":50,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:dc34c8675b53f095ad81bea4fae2b894cd7c88d5b8c14d7ff35e8f9775655d36","observation_id":"606bd394-6abc-4038-b946-0003f15cfdab","resolution":{"observed_at":"2026-05-26T10:07:09.490125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"07dab530-9fc0-45f8-b864-5c3ee6981a42","year":null},"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":51,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:4e440bdba51d861a62ee76122c6d0b4a70eae9f4f6e7a6e8eee29418696597ca","observation_id":"20d4f791-e372-4e46-b222-3cf7425d83ed","resolution":{"observed_at":"2026-05-26T10:07:09.463847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Journal of Statistical Physics , volume=","venue":null,"work_id":"29ba0ad1-a69b-4cf8-87a7-048064e8ee9c","year":2017},"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":52,"source":"arxiv_source","source_observed_at":"2026-05-08T16:23:37.393165Z"},"links":{"citing_paper":"/paper/2605.05189"},"observation_digest":"sha256:43728094d0148102d0920614ef4d0d2d83f198486618a22c39d937d54d5e9397","observation_id":"0ae4cf97-23b9-40f6-bcb5-607187610ea7","resolution":{"observed_at":"2026-05-26T10:07:09.452979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.05189","last_updated":"2026-05-06T17:53:20Z","latest_version":1,"primary_category":"stat.ML","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"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":12,"parse_uncertain":2,"unresolved":4,"verified_exact":11,"verified_fuzzy":23},"total_outbound_references":52},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 1 inbound Pith citation observation for arXiv:2605.05189."}