{"as_of":"2026-08-09T11:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd27e141e64d2491c666122336ff02878ab3feb1df7fa38ede47fd8eb66a967d","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:52:16.392102Z","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-04T19:30:07.247439Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":"2407.05483","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-07-04T19:30:07.247439Z","title":"Simple linear attention language models balance the recall-throughput tradeoff","venue":null,"work_id":"0700c833-caaf-47d2-b97c-2f4a50eed025","year":2024},"citing_paper":{"arxiv_id":"2412.06464","last_updated":"2025-03-06T06:57:34Z","snapshot_observed_at":"2026-08-03T00:27:18.402796Z","submitted_at":"2024-12-09T13:09:04Z","title":"Gated Delta Networks: Improving Mamba2 with Delta Rule","version":3},"reference_index":297,"source":"arxiv_source","source_observed_at":"2026-05-13T14:50:23.991809Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2412.06464"},"observation_digest":"sha256:43ab7bbbcb5175176ac44daec75bcfab763c17e268f8b62ffd1739e94008d3f0","observation_id":"96709be4-6d70-4dfa-8038-31a303768764","resolution":{"observed_at":"2026-05-13T14:50:24.355897Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-08-05T15:52:16.392102Z","title":"Just read twice: closing the recall gap for recurrent language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19242","last_updated":"2025-08-26T17:59:13Z","snapshot_observed_at":"2026-08-08T07:54:20.948687Z","submitted_at":"2025-08-26T17:59:13Z","title":"Autoregressive Universal Video Segmentation Model","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T15:52:16.392102Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2508.19242"},"observation_digest":"sha256:ab1c29960347fd6139703cb2000e97ddf5b083f97fe40fd4549b2f5d74fce804","observation_id":"86b416ae-2ac7-42d1-906c-40a7941ad941","resolution":{"observed_at":"2026-08-05T15:52:16.392102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":"2407.05483","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-07-04T19:30:07.247439Z","title":"Simple linear attention language models balance the recall-throughput tradeoff","venue":null,"work_id":"0700c833-caaf-47d2-b97c-2f4a50eed025","year":2024},"citing_paper":{"arxiv_id":"2509.22630","last_updated":"2026-04-24T05:03:12Z","snapshot_observed_at":"2026-07-06T22:30:55.313733Z","submitted_at":"2025-09-26T17:55:22Z","title":"StateX: Enhancing RNN Recall via Post-training State Expansion","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T12:27:06.616920Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2509.22630"},"observation_digest":"sha256:ec18901ff8392fe5d43ee85bda20d9314e155b75b8cce30116258408e0fb1b61","observation_id":"098d6866-3cb3-4c4f-842e-fd8db4b92909","resolution":{"observed_at":"2026-05-18T12:31:22.205582Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-08-03T23:33:52.586902Z","title":"Just read twice: closing the recall gap for recurrent language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.05313","last_updated":"2026-07-13T06:02:36Z","snapshot_observed_at":"2026-08-07T04:09:13.749315Z","submitted_at":"2025-11-07T15:13:28Z","title":"Controllably Efficient Language Models","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-03T23:33:52.586902Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2511.05313"},"observation_digest":"sha256:37fd88d810530e8740cd8198c9ef1a7fab3f3952280adf650e37ac643b81952c","observation_id":"6e049d7e-d541-4901-a43f-5631b65a9810","resolution":{"observed_at":"2026-08-03T23:33:52.586902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-08-03T15:22:46.912619Z","title":"Just read twice: closing the recall gap for recurrent language models.arXiv preprint arXiv:2407.05483, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.17351","last_updated":"2026-07-28T16:53:50Z","snapshot_observed_at":"2026-08-03T18:14:53.588030Z","submitted_at":"2025-12-19T08:47:28Z","title":"Physics of Language Models: Part 4.1, Architecture Design and the Magic of Canon Layers","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T15:22:46.912619Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2512.17351"},"observation_digest":"sha256:2947e81ba965b58fca4634d80240421e33c05a7519c2658a44f2668dc20b38ac","observation_id":"4dd7e7e3-acac-4748-8680-85f607e66a8b","resolution":{"observed_at":"2026-08-03T15:22:46.912619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":"2407.05483","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-07-04T19:30:07.247439Z","title":"Simple linear attention language models balance the recall-throughput tradeoff","venue":null,"work_id":"0700c833-caaf-47d2-b97c-2f4a50eed025","year":2024},"citing_paper":{"arxiv_id":"2605.03953","last_updated":"2026-05-06T01:32:44Z","snapshot_observed_at":"2026-07-06T23:16:49.553583Z","submitted_at":"2026-05-05T16:38:29Z","title":"Transformers with Selective Access to Early Representations","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-07T16:16:42.491035Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2605.03953"},"observation_digest":"sha256:7466bf671c4282ccfae701c35c7cb732dc1df8b84d0e2cf7184fbe12eb5467c1","observation_id":"6bf7e841-3e84-4fba-a1aa-67913bcc7bcc","resolution":{"observed_at":"2026-05-11T23:46:54.778750Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":"2407.05483","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-07-04T19:30:07.247439Z","title":"Simple linear attention language models balance the recall-throughput tradeoff","venue":null,"work_id":"0700c833-caaf-47d2-b97c-2f4a50eed025","year":2024},"citing_paper":{"arxiv_id":"2605.03953","last_updated":"2026-05-06T01:32:44Z","snapshot_observed_at":"2026-07-06T23:16:49.553583Z","submitted_at":"2026-05-05T16:38:29Z","title":"Transformers with Selective Access to Early Representations","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-08T18:10:31.448311Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2605.03953"},"observation_digest":"sha256:52fe9a60dba6383cd0bf3e2745ab85cbed3639dbc44a167127b44dd73bc1ceaa","observation_id":"6b988dba-1c42-4798-b278-a40b34554178","resolution":{"observed_at":"2026-05-09T06:45:40.984693Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":"2407.05483","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-07-04T19:30:07.247439Z","title":"Simple linear attention language models balance the recall-throughput tradeoff","venue":null,"work_id":"0700c833-caaf-47d2-b97c-2f4a50eed025","year":2024},"citing_paper":{"arxiv_id":"2605.13473","last_updated":"2026-05-13T12:59:26Z","snapshot_observed_at":"2026-08-02T14:44:34.058937Z","submitted_at":"2026-05-13T12:59:26Z","title":"OSDN: Improving Delta Rule with Provable Online Preconditioning in Linear Attention","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-14T19:08:18.768344Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2605.13473"},"observation_digest":"sha256:ecbfccd238cacc9ccf2be284810d7277bd5a85ec0edfc94ee6fc05d8f5baf27f","observation_id":"e38bb359-6662-46c6-8417-47f9135820ca","resolution":{"observed_at":"2026-05-14T19:09:23.225904Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":"2407.05483","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-07-04T19:30:07.247439Z","title":"Simple linear attention language models balance the recall-throughput tradeoff","venue":null,"work_id":"0700c833-caaf-47d2-b97c-2f4a50eed025","year":2024},"citing_paper":{"arxiv_id":"2606.25342","last_updated":"2026-06-24T03:14:20Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T03:14:20Z","title":"Lifelong In-Context Learning with Transformers Requires Parametric Forms of Attention","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-25T21:19:30.138022Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2606.25342"},"observation_digest":"sha256:a8f7227b7662ce6325a4d902a71527d584319cfb733dad39ece2c237774f887e","observation_id":"af400358-f4b6-4868-9c6c-bedff45e27d8","resolution":{"observed_at":"2026-07-04T19:30:07.248922Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models","version":1},"cited_work":{"arxiv_id":"2407.05483","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.05483","snapshot_observed_at":"2026-07-04T19:30:07.247439Z","title":"Simple linear attention language models balance the recall-throughput tradeoff","venue":null,"work_id":"0700c833-caaf-47d2-b97c-2f4a50eed025","year":2024},"citing_paper":{"arxiv_id":"2607.01792","last_updated":"2026-07-02T07:07:28Z","snapshot_observed_at":"2026-08-02T06:00:18.508703Z","submitted_at":"2026-07-02T07:07:28Z","title":"PARTREP: Learning What to Repeat for Decoder-only LLMs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-03T15:15:07.275852Z"},"links":{"cited_paper":"/paper/2407.05483","citing_paper":"/paper/2607.01792"},"observation_digest":"sha256:0a5b625c02db43a275612b76683e411d736e09f87a9aa190a5dd88edf9140ce3","observation_id":"dce9d604-c3c5-43ce-9d00-ce7b969e388c","resolution":{"observed_at":"2026-07-03T15:18:32.806728Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.05483/citation-record","integrity":"/paper/2407.05483/integrity","json":"/paper/2407.05483/citation-record.json","paper":"/paper/2407.05483"},"outbound":[],"paper":{"arxiv_id":"2407.05483","last_updated":"2024-07-07T19:55:09Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-02T03:13:14.123634Z","submitted_at":"2024-07-07T19:55:09Z","title":"Just read twice: closing the recall gap for recurrent language models"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2407.05483."}