{"as_of":"2026-08-11T00:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:083498fca00b7033a0625a7f2de037fbe5815cc50d6b4a8f41f75fc76848da85","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T05:02:52.692795Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.19981","last_updated":"2025-02-27T11:03:27Z","snapshot_observed_at":"2026-08-07T17:43:16.159318Z","submitted_at":"2025-02-27T11:03:27Z","title":"The Lookahead Limitation: Why Multi-Operand Addition is Hard for LLMs","version":1},"cited_work":{"arxiv_id":"2502.19981","doi":"10.48550/arxiv.2502.19981","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.19981","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"allen-zhu.com/","venue":"ArXiv.org","work_id":"7ee4dcd8-cccd-4eb1-ac16-7879188a7c67","year":2025},"citing_paper":{"arxiv_id":"2503.09567","last_updated":"2025-07-18T15:57:54Z","snapshot_observed_at":"2026-08-08T22:33:20.124926Z","submitted_at":"2025-03-12T17:35:03Z","title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-12T08:40:40.910461Z"},"links":{"cited_paper":"/paper/2502.19981","citing_paper":"/paper/2503.09567"},"observation_digest":"sha256:8a4912b72c627a598a9303e0bd8d6a0857c9e9d633b6b7fb238a028b952c1342","observation_id":"27bc422d-cb72-4369-a2a7-6c293d7ac1bb","resolution":{"observed_at":"2026-05-12T08:40:41.115331Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19981","last_updated":"2025-02-27T11:03:27Z","snapshot_observed_at":"2026-08-07T17:43:16.159318Z","submitted_at":"2025-02-27T11:03:27Z","title":"The Lookahead Limitation: Why Multi-Operand Addition is Hard for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.19981","snapshot_observed_at":"2026-08-06T05:02:52.692795Z","title":"ArXiv, abs/2502.19981","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.02513","last_updated":"2025-08-04T15:18:41Z","snapshot_observed_at":"2026-08-10T23:47:59.688271Z","submitted_at":"2025-08-04T15:18:41Z","title":"Modular Arithmetic: Language Models Solve Math Digit by Digit","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T05:02:52.692795Z"},"links":{"cited_paper":"/paper/2502.19981","citing_paper":"/paper/2508.02513"},"observation_digest":"sha256:0a330113eff618e8f7738ff79e3b74ac76f2d70b3ef83d2d097d72eeee736cb0","observation_id":"80262894-97a4-4c18-b517-872dd976d253","resolution":{"observed_at":"2026-08-06T05:02:52.692795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19981","last_updated":"2025-02-27T11:03:27Z","snapshot_observed_at":"2026-08-07T17:43:16.159318Z","submitted_at":"2025-02-27T11:03:27Z","title":"The Lookahead Limitation: Why Multi-Operand Addition is Hard for LLMs","version":1},"cited_work":{"arxiv_id":"2502.19981","doi":"10.48550/arxiv.2502.19981","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.19981","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"allen-zhu.com/","venue":"ArXiv.org","work_id":"7ee4dcd8-cccd-4eb1-ac16-7879188a7c67","year":2025},"citing_paper":{"arxiv_id":"2510.06824","last_updated":"2026-05-20T14:19:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-08T09:48:11Z","title":"Efficient numeracy in language models through single-token number embeddings","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T21:09:02.731348Z"},"links":{"cited_paper":"/paper/2502.19981","citing_paper":"/paper/2510.06824"},"observation_digest":"sha256:e8d63b793d39b30b31b471b6ab3408eef4bdadc58a5701d9e26da7d64452e083","observation_id":"ca9873b0-a281-48ea-9ae9-5896c06bd0fc","resolution":{"observed_at":"2026-05-21T21:10:38.619533Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19981","last_updated":"2025-02-27T11:03:27Z","snapshot_observed_at":"2026-08-07T17:43:16.159318Z","submitted_at":"2025-02-27T11:03:27Z","title":"The Lookahead Limitation: Why Multi-Operand Addition is Hard for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.19981","snapshot_observed_at":"2026-08-03T19:30:05.564191Z","title":"The lookahead lim- itation: Why multi-operand addition is hard for llms,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.00491","last_updated":"2026-07-29T09:31:21Z","snapshot_observed_at":"2026-08-09T11:03:23.007881Z","submitted_at":"2025-11-29T13:55:10Z","title":"Smart-TCP: An Agentic AI-based Autonomous and Adaptive TCP Protocol","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:05.564191Z"},"links":{"cited_paper":"/paper/2502.19981","citing_paper":"/paper/2512.00491"},"observation_digest":"sha256:c7d9a47f6bd7b10f30b22e36a5f4dc45ead0edace051b80178b250f8c50e1a03","observation_id":"99dbdd9b-0e31-48b2-8bd5-8850c28fe92c","resolution":{"observed_at":"2026-08-03T19:30:05.564191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19981","last_updated":"2025-02-27T11:03:27Z","snapshot_observed_at":"2026-08-07T17:43:16.159318Z","submitted_at":"2025-02-27T11:03:27Z","title":"The Lookahead Limitation: Why Multi-Operand Addition is Hard for LLMs","version":1},"cited_work":{"arxiv_id":"2502.19981","doi":"10.48550/arxiv.2502.19981","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.19981","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"allen-zhu.com/","venue":"ArXiv.org","work_id":"7ee4dcd8-cccd-4eb1-ac16-7879188a7c67","year":2025},"citing_paper":{"arxiv_id":"2605.05851","last_updated":"2026-05-07T08:24:54Z","snapshot_observed_at":"2026-08-04T15:23:48.540297Z","submitted_at":"2026-05-07T08:24:54Z","title":"Hypothesis generation and updating in large language models","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-08T14:43:56.125546Z"},"links":{"cited_paper":"/paper/2502.19981","citing_paper":"/paper/2605.05851"},"observation_digest":"sha256:d60d833b19b60034471b02f9c7428fbe84f2b477a65476fc3d997082045a4134","observation_id":"df13b7df-a3a1-4a93-a922-01e6b55f9af7","resolution":{"observed_at":"2026-05-08T21:14:12.026036Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19981","last_updated":"2025-02-27T11:03:27Z","snapshot_observed_at":"2026-08-07T17:43:16.159318Z","submitted_at":"2025-02-27T11:03:27Z","title":"The Lookahead Limitation: Why Multi-Operand Addition is Hard for LLMs","version":1},"cited_work":{"arxiv_id":"2502.19981","doi":"10.48550/arxiv.2502.19981","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.19981","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"allen-zhu.com/","venue":"ArXiv.org","work_id":"7ee4dcd8-cccd-4eb1-ac16-7879188a7c67","year":2025},"citing_paper":{"arxiv_id":"2606.03645","last_updated":"2026-05-29T10:55:50Z","snapshot_observed_at":"2026-07-06T23:43:50.943530Z","submitted_at":"2026-05-29T10:55:50Z","title":"The Shape of Addition: Geometric Structures of Arithmetic in Large Language Models","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T23:45:16.789926Z"},"links":{"cited_paper":"/paper/2502.19981","citing_paper":"/paper/2606.03645"},"observation_digest":"sha256:df2f112025a65d5bbfccf72302006e2ac126c4dfc9c33c8ce9c06f8723c47462","observation_id":"5b077840-f983-44a7-a954-8b50edf9cf89","resolution":{"observed_at":"2026-06-28T23:52:49.750555Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.19981/citation-record","integrity":"/paper/2502.19981/integrity","json":"/paper/2502.19981/citation-record.json","paper":"/paper/2502.19981"},"outbound":[],"paper":{"arxiv_id":"2502.19981","last_updated":"2025-02-27T11:03:27Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T17:43:16.159318Z","submitted_at":"2025-02-27T11:03:27Z","title":"The Lookahead Limitation: Why Multi-Operand Addition is Hard for LLMs"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2502.19981."}