{"as_of":"2026-08-07T22:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f20f32b9681e97ff7cb84d51f49de45cbbba3fdffec3e30cf9e3952341d7fcd4","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":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":19,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T20:56:23.009766Z","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-03T13:28:19.272629Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-07T20:56:23.009766Z","title":"Infini-gram: Scaling unbounded n-gram language models to a trillion tokens","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09622","last_updated":"2025-06-09T02:36:10Z","snapshot_observed_at":"2026-08-07T20:45:35.991821Z","submitted_at":"2025-02-13T18:59:47Z","title":"Theoretical Benefit and Limitation of Diffusion Language Model","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T20:56:23.009766Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2502.09622"},"observation_digest":"sha256:f074775408c20cbf3d5c36fef52bf9ff14d65c3c3734a5f8c75afefe186655d4","observation_id":"98fe0eaf-9983-4524-9b4a-58990c1f93f1","resolution":{"observed_at":"2026-08-07T20:56:23.009766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-07T15:29:07.971245Z","title":"Infini-gram: Scaling unbounded n-gram language models to a trillion tokens","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15024","last_updated":"2025-05-23T01:09:11Z","snapshot_observed_at":"2026-08-07T15:23:09.806231Z","submitted_at":"2025-05-21T02:13:24Z","title":"Diagnosing our datasets: How does my language model learn clinical information?","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:07.971245Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2505.15024"},"observation_digest":"sha256:c651b4a469496f4fcfc41c5b6d8233f01d9cfc30655e17cfdc11c167f7ed3104","observation_id":"f4c6fef2-e7be-4481-bff0-f80443ce7a4a","resolution":{"observed_at":"2026-08-07T15:29:07.971245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-07T12:34:43.877443Z","title":"Infini- gram: Scaling unbounded n-gram language models to a trillion tokens","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24302","last_updated":"2026-07-21T01:12:17Z","snapshot_observed_at":"2026-08-07T16:41:29.098287Z","submitted_at":"2025-05-30T07:28:20Z","title":"ScienceMeter: Tracking Scientific Knowledge Updates in Language Models","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:34:43.877443Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2505.24302"},"observation_digest":"sha256:70a42e7a23495d164173a055ca046ba395a64ba27d3afba405df0e1aff8eac1b","observation_id":"0b49b587-96f2-4f1b-a88e-93b2a2dbd0fe","resolution":{"observed_at":"2026-08-07T12:34:43.877443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-07T11:29:54.081659Z","title":"Infini- gram: Scaling unbounded n-gram language models to a trillion tokens","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02350","last_updated":"2025-06-03T01:09:55Z","snapshot_observed_at":"2026-08-07T21:43:04.280993Z","submitted_at":"2025-06-03T01:09:55Z","title":"Truth over Tricks: Measuring and Mitigating Shortcut Learning in Misinformation Detection","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:29:54.081659Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2506.02350"},"observation_digest":"sha256:9c29a6877a6e8b62559081b151671883e33256c2f6d21bcf415a386d2f5650dc","observation_id":"77dc5525-1e1e-41d4-9f1d-ac100d9f1e10","resolution":{"observed_at":"2026-08-07T11:29:54.081659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-06T20:44:59.481034Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.01844","last_updated":"2025-07-02T15:58:51Z","snapshot_observed_at":"2026-08-06T20:39:18.983264Z","submitted_at":"2025-07-02T15:58:51Z","title":"Low-Perplexity LLM-Generated Sequences and Where To Find Them","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T20:44:59.481034Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2507.01844"},"observation_digest":"sha256:9cd4b31dd8caeb064ca78b2eee75c2080d58d6406fdf648fdae540ed87a3280f","observation_id":"ee3b7064-fe72-48c9-b803-6fd73b01a98c","resolution":{"observed_at":"2026-08-06T20:44:59.481034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-04T07:22:06.164775Z","title":"Infini-gram: Scaling unbounded n-gram language models to a trillion tokens, 2025 b","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27313","last_updated":"2026-08-02T16:40:30Z","snapshot_observed_at":"2026-08-07T01:09:11.146770Z","submitted_at":"2025-10-31T09:39:12Z","title":"LLM generation novelty through the lens of semantic similarity","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:06.164775Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2510.27313"},"observation_digest":"sha256:cdc3f09039bd0bcd355335275a278a5b8829ccc4ecec7b5304d9b4038c311af6","observation_id":"e0264989-7d06-43ef-9954-c1e87a805a77","resolution":{"observed_at":"2026-08-04T07:22:06.164775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":"2401.17377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-07-03T13:28:19.272629Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":"64c2d190-43ba-4efe-b3fe-6b9c6acfa772","year":2024},"citing_paper":{"arxiv_id":"2605.16893","last_updated":"2026-05-16T09:12:52Z","snapshot_observed_at":"2026-08-01T19:24:03.890902Z","submitted_at":"2026-05-16T09:12:52Z","title":"NGM: A Plug-and-Play Training-Free Memory Module for LLMs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T20:47:50.356747Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2605.16893"},"observation_digest":"sha256:0fc20100aa300427d31932401fff799ed1cfa5b611f90a1def63179f1e9c05e0","observation_id":"6d2cb6ed-8285-4e64-b0a6-0d84ef90e5ab","resolution":{"observed_at":"2026-05-19T20:52:46.358916Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":"2401.17377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-07-03T13:28:19.272629Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":"64c2d190-43ba-4efe-b3fe-6b9c6acfa772","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":32,"source":"pdf_text","source_observed_at":"2026-05-21T05:49:14.789955Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2605.20948"},"observation_digest":"sha256:827b458bd3b66cfda535339bba248f43d5da5deb74f6bc342ec73179810b7b89","observation_id":"7885334d-0634-415e-a50d-74f0de29878c","resolution":{"observed_at":"2026-05-21T05:49:40.790156Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":"2401.17377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-07-03T13:28:19.272629Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":"64c2d190-43ba-4efe-b3fe-6b9c6acfa772","year":2024},"citing_paper":{"arxiv_id":"2605.23168","last_updated":"2026-05-22T02:41:13Z","snapshot_observed_at":"2026-08-02T12:46:51.142829Z","submitted_at":"2026-05-22T02:41:13Z","title":"PoisonForge: Task-Level Targeted Poisoning Benchmark for Instruction-Tuned LLMs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-25T04:38:18.169546Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2605.23168"},"observation_digest":"sha256:18059ea8381fe112b653fe0c55247672625407428cd51c66a769be70c78449c3","observation_id":"4903d2a1-f366-4426-8700-429d15c6ce17","resolution":{"observed_at":"2026-05-25T04:40:23.735624Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":"2401.17377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-07-03T13:28:19.272629Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":"64c2d190-43ba-4efe-b3fe-6b9c6acfa772","year":2024},"citing_paper":{"arxiv_id":"2605.29648","last_updated":"2026-05-28T09:14:37Z","snapshot_observed_at":"2026-08-06T02:24:11.050279Z","submitted_at":"2026-05-28T09:14:37Z","title":"Verifiable Rewards Beyond Math and Code: Lightweight Corpus-Grounded Process Supervision for Factual Question Answering","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T07:58:00.374310Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2605.29648"},"observation_digest":"sha256:31021bd4946ce490aa12a1d3ca8569a3b7333e7558f925249103def448b46569","observation_id":"95c4339e-860a-4d1d-b6ed-9cabbabf4f52","resolution":{"observed_at":"2026-06-29T08:03:14.375987Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":"2401.17377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-07-03T13:28:19.272629Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":"64c2d190-43ba-4efe-b3fe-6b9c6acfa772","year":2024},"citing_paper":{"arxiv_id":"2605.30526","last_updated":"2026-05-28T20:01:51Z","snapshot_observed_at":"2026-07-06T23:39:48.531480Z","submitted_at":"2026-05-28T20:01:51Z","title":"Measuring, Localizing, and Ablating Alignment Signatures in LLMs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T08:07:39.515963Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2605.30526"},"observation_digest":"sha256:727d3a24063ea335d37c019dd1cc524e9531b5ce57898a4322abb15b99543282","observation_id":"9ab3db6e-2dc1-449e-b5e2-2baf5f308754","resolution":{"observed_at":"2026-06-29T08:13:15.500654Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":"2401.17377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-07-03T13:28:19.272629Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":"64c2d190-43ba-4efe-b3fe-6b9c6acfa772","year":2024},"citing_paper":{"arxiv_id":"2606.03817","last_updated":"2026-06-02T15:59:22Z","snapshot_observed_at":"2026-07-06T23:44:00.144689Z","submitted_at":"2026-06-02T15:59:22Z","title":"Rethinking the Idiomaticity Decomposability Hypothesis: Evidence from Distributional Learning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-28T10:04:41.040033Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2606.03817"},"observation_digest":"sha256:bcdce07c9cdd4da39c55379cf2ef76d4959e1ca969481c504eccfa392927f10c","observation_id":"9345edaf-b381-4a7e-86ca-e29d610a96d2","resolution":{"observed_at":"2026-07-02T03:26:29.081382Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":"2401.17377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-07-03T13:28:19.272629Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":"64c2d190-43ba-4efe-b3fe-6b9c6acfa772","year":2024},"citing_paper":{"arxiv_id":"2606.06286","last_updated":"2026-06-04T15:25:24Z","snapshot_observed_at":"2026-08-05T07:06:45.210601Z","submitted_at":"2026-06-04T15:25:24Z","title":"LLMs Can Leak Training Data But Do They Want To? A Propensity-Aware Evaluation of Memorization in LLMs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T01:40:53.284131Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2606.06286"},"observation_digest":"sha256:561f5d296962d72fdad32210af57d5ae62e47cfd7f1ef016dab708139704e53f","observation_id":"87c95ccd-e2da-41ce-88ff-a065adb7f8c2","resolution":{"observed_at":"2026-07-02T12:56:57.456684Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":"2401.17377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-07-03T13:28:19.272629Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":"64c2d190-43ba-4efe-b3fe-6b9c6acfa772","year":2024},"citing_paper":{"arxiv_id":"2606.06624","last_updated":"2026-06-08T15:12:03Z","snapshot_observed_at":"2026-08-02T09:46:22.331867Z","submitted_at":"2026-06-04T18:21:03Z","title":"Principles and Practice of Deep Representation Learning: or a Mathematical Theory of Memory","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-28T03:07:52.730713Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2606.06624"},"observation_digest":"sha256:dc1f8275d1083c57ceebc5dfd7e224c6a2fbf5cb1e9685750670b4f6dabd9212","observation_id":"c4c5924d-cb7e-4b98-8aa4-5fbadff9a338","resolution":{"observed_at":"2026-07-02T11:46:55.372106Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-04T04:48:46.467025Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13993","last_updated":"2026-08-05T04:43:41Z","snapshot_observed_at":"2026-08-07T21:16:24.057167Z","submitted_at":"2026-06-12T00:27:42Z","title":"The Holistic Storage of Verb+Up Phrases in Text-based and Audio-based Language Models","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T04:48:46.467025Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2606.13993"},"observation_digest":"sha256:aa105622f8ee038f9345d1d76a02cb3c48fc168954ab2befc2fb624aff7d0f4d","observation_id":"a894f81e-d7df-40fb-91f9-4385addd4d77","resolution":{"observed_at":"2026-08-04T04:48:46.467025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":"2401.17377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-07-03T13:28:19.272629Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":"64c2d190-43ba-4efe-b3fe-6b9c6acfa772","year":2024},"citing_paper":{"arxiv_id":"2606.18285","last_updated":"2026-06-10T04:16:32Z","snapshot_observed_at":"2026-08-02T04:52:58.492452Z","submitted_at":"2026-06-10T04:16:32Z","title":"RELIANCE: Curating and Evaluating Reproductive Health Information on Social Media","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T07:56:36.600805Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2606.18285"},"observation_digest":"sha256:e89a06f21f1c6351d21f01b33493dcdcee26c1f69d0a14300512f35426ba015f","observation_id":"ad14430f-bda4-4c04-91e2-798ed42876c0","resolution":{"observed_at":"2026-07-03T13:28:19.274103Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-01T21:31:54.359771Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16057","last_updated":"2026-08-03T18:41:38Z","snapshot_observed_at":"2026-08-07T21:09:40.394214Z","submitted_at":"2026-07-17T15:34:51Z","title":"Frontier AI performance across the business disciplines: a case-grounded benchmark of knowledge work and analytical reasoning","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T21:31:54.359771Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2607.16057"},"observation_digest":"sha256:9ff1d3897ccb2a8847549a47d41a0ce5a0c784657f3d7101be00ca39ab2d56ca","observation_id":"e112678e-5070-4c27-b55f-1d63531ef80c","resolution":{"observed_at":"2026-08-01T21:31:54.359771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-03T00:49:50.919601Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16057","last_updated":"2026-08-03T18:41:38Z","snapshot_observed_at":"2026-08-07T21:09:40.394214Z","submitted_at":"2026-07-17T15:34:51Z","title":"Frontier AI performance across the business disciplines: a case-grounded benchmark of knowledge work and analytical reasoning","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-03T00:49:50.919601Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2607.16057"},"observation_digest":"sha256:fe2ad931765f2b443c56b1378e2b47e7def6ef239c148a45f7e2757d4b65ee42","observation_id":"10b2918e-3b25-4bca-a52b-c75663e80698","resolution":{"observed_at":"2026-08-03T00:49:50.919601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17377","snapshot_observed_at":"2026-08-01T07:29:01.914639Z","title":"arXiv preprint arXiv:2401.17377 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21445","last_updated":"2026-07-23T15:52:00Z","snapshot_observed_at":"2026-08-01T07:28:44.069303Z","submitted_at":"2026-07-23T15:52:00Z","title":"When Trivia Is Not Trivial: Everyday Knowledge Failures in Multilingual LLMs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T07:29:01.914639Z"},"links":{"cited_paper":"/paper/2401.17377","citing_paper":"/paper/2607.21445"},"observation_digest":"sha256:0172347c89773a1c8c5e24e1db0a69ea41f95b77beb7cdced68f77e697af0291","observation_id":"c3ed716b-bcc2-48f3-b9af-b5b5417049b8","resolution":{"observed_at":"2026-08-01T07:29:01.914639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.17377/citation-record","integrity":"/paper/2401.17377/integrity","json":"/paper/2401.17377/citation-record.json","paper":"/paper/2401.17377"},"outbound":[],"paper":{"arxiv_id":"2401.17377","last_updated":"2025-04-07T17:59:50Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T17:22:45.506107Z","submitted_at":"2024-01-30T19:03:49Z","title":"Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 19 inbound Pith citation observations for arXiv:2401.17377."}