{"as_of":"2026-08-06T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6e973094faabd31be8a30cc42301fdfb5112a7e7c82bef4000e3d0164de3d044","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:17:41.998354Z","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-04T01:09:19.454543Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.12364","last_updated":"2025-02-06T09:36:58Z","snapshot_observed_at":"2026-08-04T06:56:33.572912Z","submitted_at":"2024-11-19T09:24:34Z","title":"Ultra-Sparse Memory Network","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.12364","snapshot_observed_at":"2026-08-05T16:17:41.998354Z","title":"Ultra-sparse memory network","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18756","last_updated":"2025-08-26T07:33:11Z","snapshot_observed_at":"2026-08-06T02:00:57.442142Z","submitted_at":"2025-08-26T07:33:11Z","title":"UltraMemV2: Memory Networks Scaling to 120B Parameters with Superior Long-Context Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T16:17:41.998354Z"},"links":{"cited_paper":"/paper/2411.12364","citing_paper":"/paper/2508.18756"},"observation_digest":"sha256:7f48c2ef51b6cf853923cc3bedf511f51239f08b2061e192a96714fd652e1e22","observation_id":"e8ecbb92-aa3c-432f-9a7c-a9f8c04ef171","resolution":{"observed_at":"2026-08-05T16:17:41.998354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12364","last_updated":"2025-02-06T09:36:58Z","snapshot_observed_at":"2026-08-04T06:56:33.572912Z","submitted_at":"2024-11-19T09:24:34Z","title":"Ultra-Sparse Memory Network","version":2},"cited_work":{"arxiv_id":"2411.12364","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.12364","snapshot_observed_at":"2026-07-04T01:09:19.454543Z","title":"Ultra-sparse memory network","venue":null,"work_id":"49f161a5-a12c-426e-9951-672389dcc100","year":2024},"citing_paper":{"arxiv_id":"2512.13751","last_updated":"2026-05-09T08:34:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-12-15T05:50:45Z","title":"MIDUS: Memory-Infused Depth Up-Scaling","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-16T22:02:42.297041Z"},"links":{"cited_paper":"/paper/2411.12364","citing_paper":"/paper/2512.13751"},"observation_digest":"sha256:712ad98f229e102ebc1157d03958e69c219a8aaf791c61b85f3444f3516af3e2","observation_id":"9a4381f8-292a-496d-8f4e-52436d4de2cd","resolution":{"observed_at":"2026-05-16T22:03:36.155671Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12364","last_updated":"2025-02-06T09:36:58Z","snapshot_observed_at":"2026-08-04T06:56:33.572912Z","submitted_at":"2024-11-19T09:24:34Z","title":"Ultra-Sparse Memory Network","version":2},"cited_work":{"arxiv_id":"2411.12364","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.12364","snapshot_observed_at":"2026-07-04T01:09:19.454543Z","title":"Ultra-sparse memory network","venue":null,"work_id":"49f161a5-a12c-426e-9951-672389dcc100","year":2024},"citing_paper":{"arxiv_id":"2605.20948","last_updated":"2026-05-20T09:35:04Z","snapshot_observed_at":"2026-07-06T23:31:27.989406Z","submitted_at":"2026-05-20T09:35:04Z","title":"Memory Grafting: Scaling Language Model Pre-training via Offline Conditional Memory","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T05:49:14.789955Z"},"links":{"cited_paper":"/paper/2411.12364","citing_paper":"/paper/2605.20948"},"observation_digest":"sha256:057c1923bf0003cf331449982b63200bff0b4c0e167a2422f72d4687d0546549","observation_id":"05776b31-66e4-4652-bfcc-c8b9859efb31","resolution":{"observed_at":"2026-05-21T05:49:40.770806Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12364","last_updated":"2025-02-06T09:36:58Z","snapshot_observed_at":"2026-08-04T06:56:33.572912Z","submitted_at":"2024-11-19T09:24:34Z","title":"Ultra-Sparse Memory Network","version":2},"cited_work":{"arxiv_id":"2411.12364","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.12364","snapshot_observed_at":"2026-07-04T01:09:19.454543Z","title":"Ultra-sparse memory network","venue":null,"work_id":"49f161a5-a12c-426e-9951-672389dcc100","year":2024},"citing_paper":{"arxiv_id":"2606.09888","last_updated":"2026-06-03T09:10:06Z","snapshot_observed_at":"2026-08-02T01:54:56.458376Z","submitted_at":"2026-06-03T09:10:06Z","title":"SinkRec: Mitigating Semantic State Sink in Long Sequence Recommendation with Memory-Conditioned Gated Delta Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T07:13:54.031036Z"},"links":{"cited_paper":"/paper/2411.12364","citing_paper":"/paper/2606.09888"},"observation_digest":"sha256:2cc698ec03b2d4c7b3fedaded3881d82c30cc544eeb30d8345891b69ad2a9fc8","observation_id":"4b42034b-fa73-4903-833d-76720aa0da34","resolution":{"observed_at":"2026-07-02T07:06:43.815473Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12364","last_updated":"2025-02-06T09:36:58Z","snapshot_observed_at":"2026-08-04T06:56:33.572912Z","submitted_at":"2024-11-19T09:24:34Z","title":"Ultra-Sparse Memory Network","version":2},"cited_work":{"arxiv_id":"2411.12364","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.12364","snapshot_observed_at":"2026-07-04T01:09:19.454543Z","title":"Ultra-sparse memory network","venue":null,"work_id":"49f161a5-a12c-426e-9951-672389dcc100","year":2024},"citing_paper":{"arxiv_id":"2606.12113","last_updated":"2026-06-10T14:07:18Z","snapshot_observed_at":"2026-07-06T23:51:02.805629Z","submitted_at":"2026-06-10T14:07:18Z","title":"Augmenting Molecular Language Models with Local $n$-gram Memory","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-27T09:57:12.398344Z"},"links":{"cited_paper":"/paper/2411.12364","citing_paper":"/paper/2606.12113"},"observation_digest":"sha256:103f6de639d1dac088c79b85731bef3a27a8f11cad0a84b7a85db28b44c5cd8e","observation_id":"07965896-2fa1-4712-ae28-18f94b5ae216","resolution":{"observed_at":"2026-07-03T10:37:56.681243Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12364","last_updated":"2025-02-06T09:36:58Z","snapshot_observed_at":"2026-08-04T06:56:33.572912Z","submitted_at":"2024-11-19T09:24:34Z","title":"Ultra-Sparse Memory Network","version":2},"cited_work":{"arxiv_id":"2411.12364","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.12364","snapshot_observed_at":"2026-07-04T01:09:19.454543Z","title":"Ultra-sparse memory network","venue":null,"work_id":"49f161a5-a12c-426e-9951-672389dcc100","year":2024},"citing_paper":{"arxiv_id":"2606.19172","last_updated":"2026-06-17T15:15:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-06-17T15:15:19Z","title":"User as Engram: Internalizing Per-User Memory as Local Parametric Edits","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-26T20:37:01.382431Z"},"links":{"cited_paper":"/paper/2411.12364","citing_paper":"/paper/2606.19172"},"observation_digest":"sha256:830ae6e16fe04fcc1eb60788dc9ac4328a549252e8d1e0d5b71a4ab0e8640c2e","observation_id":"3ef7cfa3-82d5-4c3d-af11-1ef9450c970d","resolution":{"observed_at":"2026-07-04T01:09:19.455849Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12364","last_updated":"2025-02-06T09:36:58Z","snapshot_observed_at":"2026-08-04T06:56:33.572912Z","submitted_at":"2024-11-19T09:24:34Z","title":"Ultra-Sparse Memory Network","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.12364","snapshot_observed_at":"2026-07-11T10:45:46.618668Z","title":"Ultra- sparse memory network.arXiv preprint arXiv:2411.12364,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04969","last_updated":"2026-07-06T11:57:32Z","snapshot_observed_at":"2026-07-11T10:45:45.626304Z","submitted_at":"2026-07-06T11:57:32Z","title":"Train Smarter, Not Longer: Memorization-Guided Data Reuse for Efficient LLM Training","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T10:45:46.618668Z"},"links":{"cited_paper":"/paper/2411.12364","citing_paper":"/paper/2607.04969"},"observation_digest":"sha256:11f5ca0c77d0880fdbdafb80a3b99a41b4f36ba8d7e96eab61c9ad91024592bf","observation_id":"e364a06c-7f2d-4cab-aeaf-bc5df9d406ab","resolution":{"observed_at":"2026-07-11T10:45:46.618668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.12364/citation-record","integrity":"/paper/2411.12364/integrity","json":"/paper/2411.12364/citation-record.json","paper":"/paper/2411.12364"},"outbound":[],"paper":{"arxiv_id":"2411.12364","last_updated":"2025-02-06T09:36:58Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T06:56:33.572912Z","submitted_at":"2024-11-19T09:24:34Z","title":"Ultra-Sparse Memory Network"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2411.12364."}