{"as_of":"2026-08-20T06:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f2aaee9a2526e7dda40023f6b06ab8aee1bc2e641c10d6150cbf75358441ff2","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T19:39:12.548434Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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-06-26T18:12:05.545872Z","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-07-04T03:19:31.059537Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"cited_work":{"arxiv_id":"2511.23347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2511.23347","snapshot_observed_at":"2026-07-09T01:19:05.442424Z","title":null,"venue":null,"work_id":"c03675cd-2929-4ed1-b9c0-b371460505e4","year":2025},"citing_paper":{"arxiv_id":"2606.19537","last_updated":"2026-06-21T17:52:14Z","snapshot_observed_at":"2026-08-12T19:06:26.724054Z","submitted_at":"2026-06-17T19:29:19Z","title":"Mesh Inference: A Formal Model of Collective Inference Without a Center","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T18:12:05.545872Z"},"links":{"cited_paper":"/paper/2511.23347","citing_paper":"/paper/2606.19537"},"observation_digest":"sha256:034254963e64c7a55b0c0739b6b04556a082fe32b3fffaf06c403bc3e2cc6107","observation_id":"7c5b0650-eb5f-445d-8578-56fc8bdd8063","resolution":{"observed_at":"2026-07-09T01:19:05.442424Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2511.23347/citation-record","integrity":"/paper/2511.23347/integrity","json":"/paper/2511.23347/citation-record.json","paper":"/paper/2511.23347"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.22321","last_updated":"2026-04-23T14:46:53Z","snapshot_observed_at":"2026-07-06T22:30:55.313733Z","submitted_at":"2025-09-26T13:20:15Z","title":"Distributed Associative Memory via Online Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.22321","snapshot_observed_at":"2026-08-03T19:39:07.117381Z","title":"Distributed associative memory via online convex optimization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:07.117381Z"},"links":{"cited_paper":"/paper/2509.22321","citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:0d499e7b2e4fc24e16a242cf2611bbe2a2d05de9b8525a6ed81ad97ebcc5c661","observation_id":"c1337b0f-4744-42c3-ade8-c8e9ea665c4c","resolution":{"observed_at":"2026-08-03T19:39:07.117381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:07.283251Z","title":"Episodic and semantic memory,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:07.283251Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:e53e0cf23f7d068a16a67e56763cb752d738f70fd6f150c7c59ddfe0c8298d6d","observation_id":"bb6ad0ba-50a0-43b6-9249-d782210a656d","resolution":{"observed_at":"2026-08-03T19:39:07.283251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:07.500037Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:07.500037Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:a7f51c2794b7d1110452fe2262b0e859119d952eb6c90ca150c6bae46099290e","observation_id":"4c648664-f40c-4139-9b57-e717d94fd6a1","resolution":{"observed_at":"2026-08-03T19:39:07.500037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.13173","last_updated":"2025-04-17T17:59:33Z","snapshot_observed_at":"2026-08-16T19:21:51.005421Z","submitted_at":"2025-04-17T17:59:33Z","title":"It's All Connected: A Journey Through Test-Time Memorization, Attentional Bias, Retention, and Online Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.13173","snapshot_observed_at":"2026-08-03T19:39:07.679820Z","title":"It’s all connected: A journey through test-time memorization, attentional bias, retention, and online optimization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:07.679820Z"},"links":{"cited_paper":"/paper/2504.13173","citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:cf98c3fbc2f4f66c2c9ebee93656b269b753c58bda5437022ae0a088c1cd237d","observation_id":"e86a9ef4-f72a-40ca-bb17-332334e5e7a0","resolution":{"observed_at":"2026-08-03T19:39:07.679820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12352","last_updated":"2025-05-02T02:07:05Z","snapshot_observed_at":"2026-08-16T08:25:55.350315Z","submitted_at":"2025-01-21T18:32:31Z","title":"Test-time regression: a unifying framework for designing sequence models with associative memory","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12352","snapshot_observed_at":"2026-08-03T19:39:07.814680Z","title":"Test-time regression: a unifying framework for designing sequence models with associative memory,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:07.814680Z"},"links":{"cited_paper":"/paper/2501.12352","citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:e26d94f7a445fa78fa618bd322be59c14fe78a308a8dd3974aa4cd563316e268","observation_id":"3a979f6e-0bd4-45f0-9e7b-00f41186e53c","resolution":{"observed_at":"2026-08-03T19:39:07.814680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.19488","last_updated":"2025-05-26T04:15:38Z","snapshot_observed_at":"2026-08-18T15:48:24.987522Z","submitted_at":"2025-05-26T04:15:38Z","title":"Understanding Transformer from the Perspective of Associative Memory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.19488","snapshot_observed_at":"2026-08-03T19:39:07.995630Z","title":"Understanding trans- former from the perspective of associative memory,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:07.995630Z"},"links":{"cited_paper":"/paper/2505.19488","citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:2be9d50b44a0fa3220a7fa04937792d42ef9829998fa388d57b7e3f052c9e7a1","observation_id":"7847bc42-780b-4ca8-9d96-82177ccb22e6","resolution":{"observed_at":"2026-08-03T19:39:07.995630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-08-15T05:32:55.984958Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-03T19:39:08.164697Z","title":"A modern introduction to online learning,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:08.164697Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:16b88f925e1a2c7062e6f5bb14fd71e9737839d2132427127feefe5deeef4a7d","observation_id":"95c83574-d974-421d-98fc-a8fc4c63a3d0","resolution":{"observed_at":"2026-08-03T19:39:08.164697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:08.319738Z","title":"Online learning and online convex optimiza- tion,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:08.319738Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:19d422f5fcc30e7da6dd74749c53f91240837c4423bd9b668bdb8348ae3078f7","observation_id":"67e36490-e91a-406e-a412-cfb2d12638ef","resolution":{"observed_at":"2026-08-03T19:39:08.319738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:08.466906Z","title":"Localization via ultra-wideband radios: a look at positioning aspects for future sensor networks,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:08.466906Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:d17da9599b8995625ca4393ecc6294be7bb31bd0f0d2b3715f4292f094889383","observation_id":"f46e8bce-2230-4fe4-931f-e364b627594f","resolution":{"observed_at":"2026-08-03T19:39:08.466906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:08.669114Z","title":"Machine learning for resource management in cellular and IoT networks: Potentials, current solutions, and open challenges,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:08.669114Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:8d5fa5fbf1cc04b9ecc5a17a0c0878d89fb3a240421b5acd06713877c4ed3827","observation_id":"f818fc43-b00e-4e7a-b811-2a7cc1b29d4c","resolution":{"observed_at":"2026-08-03T19:39:08.669114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:08.850269Z","title":"5G wire- less network slicing for eMBB, URLLC, and mMTC: A communication- theoretic view,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:08.850269Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:2733e22bbd7540c488eaf0ebeb5e17a4d89445ae76c87dbd7c482e1d044fb591","observation_id":"7bdd6241-12ce-4450-9867-6773d1fa15ab","resolution":{"observed_at":"2026-08-03T19:39:08.850269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:08.985767Z","title":"Distributed optimization in sensor networks,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:08.985767Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:0bf1e1a98b18795197d6220adad1e28d7c60e9b76d4ab160f1bd35eead233361","observation_id":"4a9f7e8a-ef9a-40ce-aa01-772d89cd3568","resolution":{"observed_at":"2026-08-03T19:39:08.985767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:09.163645Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:09.163645Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:cc37129ed519718974dfe7090306a31b5926be1677d809bc9b56b666864f7035","observation_id":"f2380a18-85e9-4c8b-ab94-ab1d84739f88","resolution":{"observed_at":"2026-08-03T19:39:09.163645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:09.302182Z","title":"Wireless traffic usage forecasting using real enterprise network data: Analysis and methods,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:09.302182Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:49d2792e558b7b8164d66ce6480f5fdfdc71e84b9ba6b445a8dc80755228eb68","observation_id":"6b3ee25e-6700-4dad-b0ba-fa8082ebb2f0","resolution":{"observed_at":"2026-08-03T19:39:09.302182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:09.450630Z","title":"Neural networks and physical systems with emergent collective computational abilities","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:09.450630Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:bdbe06cdb037b0c5c71d15786e017516efc24770f3339e766cadffb9d6fc300d","observation_id":"a9dce7af-f7a5-4e8c-b24f-b3b0b5ee57b4","resolution":{"observed_at":"2026-08-03T19:39:09.450630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:09.583792Z","title":"Dense associative memory for pattern recognition,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:09.583792Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:8ec51d5be472fe4b66f96f0259ef440d5645602ae492485f575689745eeee2d8","observation_id":"28d4b5fc-72b0-42c7-a99a-c05dfc13240c","resolution":{"observed_at":"2026-08-03T19:39:09.583792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.06996","last_updated":"2021-04-27T22:20:05Z","snapshot_observed_at":"2026-08-19T23:44:20.369687Z","submitted_at":"2020-08-16T21:03:52Z","title":"Large Associative Memory Problem in Neurobiology and Machine Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.06996","snapshot_observed_at":"2026-08-03T19:39:09.731749Z","title":"Large associative memory problem in neuro- biology and machine learning, arxiv,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:09.731749Z"},"links":{"cited_paper":"/paper/2008.06996","citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:4c7a3bb3f762a8ac31fdc41ea94710df7189c3bcad175273060be7b38fc2e3db","observation_id":"1aaac47a-4e08-4bb3-aa80-cc1dbb23e034","resolution":{"observed_at":"2026-08-03T19:39:09.731749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.02217","last_updated":"2021-04-28T07:24:49Z","snapshot_observed_at":"2026-08-13T03:08:20.485293Z","submitted_at":"2020-07-16T17:52:37Z","title":"Hopfield Networks is All You Need","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.02217","snapshot_observed_at":"2026-08-03T19:39:09.944598Z","title":"Hopfield networks is all you need,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:09.944598Z"},"links":{"cited_paper":"/paper/2008.02217","citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:e1f82e0943d29e2e14d634395c27f0b1bf60d1ced0ee872321ac319dcf9541fc","observation_id":"ff28ea89-e6ca-4bef-96ab-28bce1b17dc3","resolution":{"observed_at":"2026-08-03T19:39:09.944598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:10.088726Z","title":"Transformers are RNNs: Fast autoregressive transformers with linear attention,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:10.088726Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:4d4ff88fc5fc87701687efe2005aecbc5f27e66943cfd29d4656ee4f4f2217b0","observation_id":"a8041698-d4ce-4d26-bf43-c26f72c3157c","resolution":{"observed_at":"2026-08-03T19:39:10.088726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.06635","last_updated":"2024-08-27T01:27:29Z","snapshot_observed_at":"2026-08-17T21:47:46.144942Z","submitted_at":"2023-12-11T18:51:59Z","title":"Gated Linear Attention Transformers with Hardware-Efficient Training","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.06635","snapshot_observed_at":"2026-08-03T19:39:10.304947Z","title":"Gated linear attention transformers with hardware-efficient training,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:10.304947Z"},"links":{"cited_paper":"/paper/2312.06635","citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:8b5d71f2d0e4417f1b23b23a5b0028681b1eb5e6ea7549c5b8ea3f1246eda7b7","observation_id":"c817300a-6aa0-4756-b508-60325838d353","resolution":{"observed_at":"2026-08-03T19:39:10.304947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:10.444382Z","title":"Linear transformers are secretly fast weight programmers,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:10.444382Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:b73e7ddf31e58747a2a3eebade3ec739bedc9bf8c4690f72693458f4e02ad0d1","observation_id":"5a9003e7-ab44-433c-9ac6-9209e45ec35b","resolution":{"observed_at":"2026-08-03T19:39:10.444382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02130","last_updated":"2025-03-31T19:41:52Z","snapshot_observed_at":"2026-08-16T12:53:24.811443Z","submitted_at":"2025-03-03T23:35:23Z","title":"Forgetting Transformer: Softmax Attention with a Forget Gate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02130","snapshot_observed_at":"2026-08-03T19:39:10.606079Z","title":"Forgetting transformer: Softmax attention with a forget gate,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:10.606079Z"},"links":{"cited_paper":"/paper/2503.02130","citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:e0e37896de9451423ac77d6b6757151021aa8c462799cefd4b8ee58a5971615d","observation_id":"2b16414b-ba7c-46af-918c-f79f2bef3ac9","resolution":{"observed_at":"2026-08-03T19:39:10.606079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:10.755084Z","title":"Online convex programming and generalized infinitesi- mal gradient ascent,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:10.755084Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:5b7d1fdebf055a31aeab32bd7e902df5dc15e80d65b490c84e568c5bdf9a90a7","observation_id":"523570d4-ff96-4a08-bf28-c1b5563304bb","resolution":{"observed_at":"2026-08-03T19:39:10.755084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:10.910089Z","title":"Tracking slowly moving clair- voyant: Optimal dynamic regret of online learning with true and noisy gradient,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:10.910089Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:221ef6c75bbf5ad208df88fdad1725776f8388569f581140ce6d091ad14da2db","observation_id":"357a4be6-1bfb-4fe7-8d92-70026ebf4670","resolution":{"observed_at":"2026-08-03T19:39:10.910089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:11.062686Z","title":"Dynamic regret of convex and smooth functions,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:11.062686Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:14e7fba7eb3e39c240f347108019797024779e5283dbff0f40c182dda40cf7f7","observation_id":"141bd73e-d6c5-4a1d-8ef0-6f0c1f38a374","resolution":{"observed_at":"2026-08-03T19:39:11.062686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:11.229009Z","title":"Adaptive regret of convex and smooth functions,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:11.229009Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:9544ae69e118f858c30c44a84e79a38bfd5f80fa2f649d37650dd156559a26ab","observation_id":"50787910-f935-4440-8962-65abf41ced20","resolution":{"observed_at":"2026-08-03T19:39:11.229009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:11.393820Z","title":"Communication-efficient distributed learning: An overview,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:11.393820Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:251e7d973aa02d0479062b3809deed3a09dc233c816f46bc4280449284ca7b22","observation_id":"e95f0b16-12cd-4698-9b3a-5ae082845e29","resolution":{"observed_at":"2026-08-03T19:39:11.393820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:11.606999Z","title":"Advances and open problems in federated learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:11.606999Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:8103a8dabf4da82179ac6d18d5713b15b9e495b3dc725dafd735163877b613ba","observation_id":"7d279095-6f83-49be-a2bd-7f518c48b58d","resolution":{"observed_at":"2026-08-03T19:39:11.606999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:11.758898Z","title":"A general framework for decentralized optimization with first-order methods,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:11.758898Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:ae7537c373c4b25afd7780d78794c5c56fc6d53c2f4b2aed4256e74b246347d2","observation_id":"2212d645-464c-4e96-be33-46f1c14e9585","resolution":{"observed_at":"2026-08-03T19:39:11.758898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:11.876247Z","title":"Gossip algorithms for distributed signal processing,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:11.876247Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:4f6821dd449212cac21b7adfab533e6958f1cb2a962a2a438b23f5f207b7f485","observation_id":"316a4363-0978-4627-91cf-17c911d565d9","resolution":{"observed_at":"2026-08-03T19:39:11.876247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:12.030441Z","title":"A survey on multi-task learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:12.030441Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:827ac8ac4d4e3565872261e8ba6316a27fb903a3b66083b717b043f4e789aa64","observation_id":"32dc2d70-4d49-431f-aef9-185937b8da9b","resolution":{"observed_at":"2026-08-03T19:39:12.030441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:12.170050Z","title":"Distributed multi-task relationship learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:12.170050Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:9107bb79a55fba69cdaa4e7469806c1d01c4127e2aa979a4eb9842a701919c7e","observation_id":"5c6c7f79-e504-4dde-bee4-cabb208c9aa4","resolution":{"observed_at":"2026-08-03T19:39:12.170050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:12.280163Z","title":"Multitask learning over graphs: An approach for distributed, streaming machine learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:12.280163Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:3be8a9ec290c7fd51745908f63c6a9a487911905e30fe977e5b9c2a72da8fcf5","observation_id":"6feec775-2009-4bba-9e37-c31532b4d906","resolution":{"observed_at":"2026-08-03T19:39:12.280163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:12.416708Z","title":"Distributed au- tonomous online learning: Regrets and intrinsic privacy-preserving prop- erties,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:12.416708Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:b759041901607dbfacfd3eff1fb12b5089a4ca5f34294ce405cb17ea463de2da","observation_id":"174e145c-84dd-4a57-b9a3-a0f87b8d9019","resolution":{"observed_at":"2026-08-03T19:39:12.416708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:39:12.548434Z","title":"Coin betting and parameter-free online learn- ing,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T19:39:12.548434Z"},"links":{"citing_paper":"/paper/2511.23347"},"observation_digest":"sha256:e7f76a500c0ccc23df619a82826d5d8ffabcf1f0e8d7c0ff7fd92bc7b179c551","observation_id":"e6f7e78a-3ce0-44d3-a0ad-07f3a65398f8","resolution":{"observed_at":"2026-08-03T19:39:12.548434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.23347","last_updated":"2026-07-07T19:07:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T21:02:47.099590Z","submitted_at":"2025-11-28T16:56:18Z","title":"Distributed Dynamic Associative Memory via Online Convex Optimization"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":35},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 1 inbound Pith citation observation for arXiv:2511.23347."}