{"as_of":"2026-08-08T07:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c725ef08aea0e69cf3d313e7ff4d5bcd41374597183ed034e02b3759642f0de7","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-08T06:32:00.761636+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-07T20:57:42.018820Z","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":"2406.06580","last_updated":"2024-06-04T14:02:53Z","snapshot_observed_at":"2026-07-06T18:28:20.634381Z","submitted_at":"2024-06-04T14:02:53Z","title":"Break the Chain: Large Language Models Can be Shortcut Reasoners","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06580","snapshot_observed_at":"2026-08-07T20:57:42.018820Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09601","last_updated":"2025-02-13T18:52:36Z","snapshot_observed_at":"2026-08-08T03:37:50.177168Z","submitted_at":"2025-02-13T18:52:36Z","title":"CoT-Valve: Length-Compressible Chain-of-Thought Tuning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T20:57:42.018820Z"},"links":{"cited_paper":"/paper/2406.06580","citing_paper":"/paper/2502.09601"},"observation_digest":"sha256:6a20203095ff8ae285d9beeecf5c09345134b73eff08d102d1e3d54bf9ce377f","observation_id":"90c156ac-e053-4a27-a1d4-ced05286d3dd","resolution":{"observed_at":"2026-08-07T20:57:42.018820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06580","last_updated":"2024-06-04T14:02:53Z","snapshot_observed_at":"2026-07-06T18:28:20.634381Z","submitted_at":"2024-06-04T14:02:53Z","title":"Break the Chain: Large Language Models Can be Shortcut Reasoners","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06580","snapshot_observed_at":"2026-08-07T04:38:09.462021Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10446","last_updated":"2025-06-12T07:49:24Z","snapshot_observed_at":"2026-08-07T08:57:21.082572Z","submitted_at":"2025-06-12T07:49:24Z","title":"Fast on the Easy, Deep on the Hard: Efficient Reasoning via Powered Length Penalty","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T04:38:09.462021Z"},"links":{"cited_paper":"/paper/2406.06580","citing_paper":"/paper/2506.10446"},"observation_digest":"sha256:68d289499f7ff1bc6510a8801ee758fbe29de19b7ffdabcdd95cf3e4e13d5ea5","observation_id":"9d3c70e8-74e4-4cf2-80e1-95f6f15f6072","resolution":{"observed_at":"2026-08-07T04:38:09.462021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06580","last_updated":"2024-06-04T14:02:53Z","snapshot_observed_at":"2026-07-06T18:28:20.634381Z","submitted_at":"2024-06-04T14:02:53Z","title":"Break the Chain: Large Language Models Can be Shortcut Reasoners","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06580","snapshot_observed_at":"2026-08-05T23:32:54.997930Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.05282","last_updated":"2026-07-21T08:08:53Z","snapshot_observed_at":"2026-08-05T23:32:54.202480Z","submitted_at":"2025-08-07T11:26:40Z","title":"Not All Errors Are Created Equal: ASCoT Addresses Late-Stage Fragility in Efficient LLM Reasoning","version":6},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T23:32:54.997930Z"},"links":{"cited_paper":"/paper/2406.06580","citing_paper":"/paper/2508.05282"},"observation_digest":"sha256:40d8d8212aef558c99efc1051f3252df9975e8244c150508d80ad67bd31116b5","observation_id":"ac52a1c5-ae92-4d41-a1c0-e7e5dfa0ee99","resolution":{"observed_at":"2026-08-05T23:32:54.997930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06580","last_updated":"2024-06-04T14:02:53Z","snapshot_observed_at":"2026-07-06T18:28:20.634381Z","submitted_at":"2024-06-04T14:02:53Z","title":"Break the Chain: Large Language Models Can be Shortcut Reasoners","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06580","snapshot_observed_at":"2026-08-05T21:23:23.470707Z","title":"Frisoni, G.; Cocchieri, A.; Presepi, A.; Moro, G.; and Meng, Z","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.15791","last_updated":"2025-08-12T11:53:57Z","snapshot_observed_at":"2026-08-05T21:23:08.493152Z","submitted_at":"2025-08-12T11:53:57Z","title":"InteChar: A Unified Oracle Bone Character List for Ancient Chinese Language Modeling","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T21:23:23.470707Z"},"links":{"cited_paper":"/paper/2406.06580","citing_paper":"/paper/2508.15791"},"observation_digest":"sha256:03a17a99cd395c0162eeac0a4e061b7b425e1b134ef437691827f3fdf311a70a","observation_id":"b8ca8b1d-f234-4318-9b3a-640b7e4eff82","resolution":{"observed_at":"2026-08-05T21:23:23.470707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06580","last_updated":"2024-06-04T14:02:53Z","snapshot_observed_at":"2026-07-06T18:28:20.634381Z","submitted_at":"2024-06-04T14:02:53Z","title":"Break the Chain: Large Language Models Can be Shortcut Reasoners","version":1},"cited_work":{"arxiv_id":"2406.06580","doi":"10.48550/arxiv.2406.06580","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06580","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Break the chain: Large language models can be shortcut reasoners.CoRR, abs/2406.06580","venue":"arXiv (Cornell University)","work_id":"311cbf67-f45f-4ff6-91c6-3d9dd6a9fb17","year":2024},"citing_paper":{"arxiv_id":"2510.15079","last_updated":"2026-04-07T05:37:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-16T18:48:12Z","title":"Assessing Coherency and Consistency of Code Execution Reasoning by Large Language Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T05:59:00.400429Z"},"links":{"cited_paper":"/paper/2406.06580","citing_paper":"/paper/2510.15079"},"observation_digest":"sha256:3ded401fd6af9cad87ae47ab20178d94a5594166f27954e7837b65d612df0554","observation_id":"772c6e65-32c4-4d9e-87eb-f37c40b0ed0c","resolution":{"observed_at":"2026-05-18T06:00:57.284709Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06580","last_updated":"2024-06-04T14:02:53Z","snapshot_observed_at":"2026-07-06T18:28:20.634381Z","submitted_at":"2024-06-04T14:02:53Z","title":"Break the Chain: Large Language Models Can be Shortcut Reasoners","version":1},"cited_work":{"arxiv_id":"2406.06580","doi":"10.48550/arxiv.2406.06580","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06580","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Break the chain: Large language models can be shortcut reasoners.CoRR, abs/2406.06580","venue":"arXiv (Cornell University)","work_id":"311cbf67-f45f-4ff6-91c6-3d9dd6a9fb17","year":2024},"citing_paper":{"arxiv_id":"2604.03679","last_updated":"2026-04-04T10:46:09Z","snapshot_observed_at":"2026-07-06T22:52:48.277339Z","submitted_at":"2026-04-04T10:46:09Z","title":"LightThinker++: From Reasoning Compression to Memory Management","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T17:25:28.432170Z"},"links":{"cited_paper":"/paper/2406.06580","citing_paper":"/paper/2604.03679"},"observation_digest":"sha256:a148535e1de4c268d7b5caed7bb14fe449daf7102687ac86d0f8106dc033b8af","observation_id":"fb221a99-9875-457e-8add-aabe087e3a2d","resolution":{"observed_at":"2026-05-13T17:28:01.754464Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06580","last_updated":"2024-06-04T14:02:53Z","snapshot_observed_at":"2026-07-06T18:28:20.634381Z","submitted_at":"2024-06-04T14:02:53Z","title":"Break the Chain: Large Language Models Can be Shortcut Reasoners","version":1},"cited_work":{"arxiv_id":"2406.06580","doi":"10.48550/arxiv.2406.06580","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06580","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Break the chain: Large language models can be shortcut reasoners.CoRR, abs/2406.06580","venue":"arXiv (Cornell University)","work_id":"311cbf67-f45f-4ff6-91c6-3d9dd6a9fb17","year":2024},"citing_paper":{"arxiv_id":"2606.07108","last_updated":"2026-06-08T06:45:26Z","snapshot_observed_at":"2026-07-06T23:46:46.925980Z","submitted_at":"2026-06-05T10:02:19Z","title":"DyCon: Dynamic Reasoning Control via Evolving Difficulty Modeling","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T22:16:01.457276Z"},"links":{"cited_paper":"/paper/2406.06580","citing_paper":"/paper/2606.07108"},"observation_digest":"sha256:d0496b23459b9c49cdf74f4dc311eb6426635bf476367e9c7c86ecbbed5b5707","observation_id":"36612bc2-6a0d-450e-8d02-135751c88226","resolution":{"observed_at":"2026-07-02T16:57:10.056346Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.06580/citation-record","integrity":"/paper/2406.06580/integrity","json":"/paper/2406.06580/citation-record.json","paper":"/paper/2406.06580"},"outbound":[],"paper":{"arxiv_id":"2406.06580","last_updated":"2024-06-04T14:02:53Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T18:28:20.634381Z","submitted_at":"2024-06-04T14:02:53Z","title":"Break the Chain: Large Language Models Can be Shortcut Reasoners"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2406.06580."}