{"as_of":"2026-08-09T13:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e0aee1f549c8a66b3781a58243607fa92ed5650dcf7e27d3686903425378678","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":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:46:21.553797Z","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-06-28T17:12:25.279751Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":"2411.01855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-06-28T17:12:25.279751Z","title":"Wei Liu, Ruochen Zhou, Yiyun Deng, Yuzhen Huang, Junteng Liu, Yuntian Deng, Yizhe Zhang, and Junx- ian He","venue":null,"work_id":"380bb0a2-1d5b-41c6-a16e-5a2d0b86127f","year":2025},"citing_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-07T04:27:23.738927Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"reference_index":115,"source":"pdf_text","source_observed_at":"2026-05-14T01:29:56.480020Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2503.16419"},"observation_digest":"sha256:a0a66013d246c3dce2f23752b0d277f742e29d8c89f2fc1ba19820b2574b7547","observation_id":"d33087e5-0cc8-4b5c-ae48-36b6804f4e3a","resolution":{"observed_at":"2026-05-14T01:29:57.434107Z","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":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T14:46:21.553797Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17746","last_updated":"2025-09-06T08:22:33Z","snapshot_observed_at":"2026-08-08T01:16:09.918876Z","submitted_at":"2025-05-23T11:14:12Z","title":"Fast Quiet-STaR: Thinking Without Thought Tokens","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T14:46:21.553797Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2505.17746"},"observation_digest":"sha256:6ec87d7b6e5b7184121c93ef29ee590356ba95b88bd5276986d087d3f6889cc2","observation_id":"14a1197b-3fdc-4807-8224-d611074c511a","resolution":{"observed_at":"2026-08-07T14:46:21.553797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T14:42:12.976815Z","title":"Can language models learn to skip steps? arXiv preprint arXiv:2411.01855, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17941","last_updated":"2025-05-23T14:17:56Z","snapshot_observed_at":"2026-08-09T06:05:38.396561Z","submitted_at":"2025-05-23T14:17:56Z","title":"VeriThinker: Learning to Verify Makes Reasoning Model Efficient","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:42:12.976815Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2505.17941"},"observation_digest":"sha256:71fb04b7c7d9810bf02b5934e353de212d551a379bec50c00dfa35c5db65012e","observation_id":"1885e8a4-0ffb-4775-9ade-16d1e5750c4c","resolution":{"observed_at":"2026-08-07T14:42:12.976815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T14:27:39.117278Z","title":"Can language models learn to skip steps? arXiv preprint arXiv:2411.01855,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18962","last_updated":"2025-05-31T15:08:41Z","snapshot_observed_at":"2026-08-09T00:32:35.600478Z","submitted_at":"2025-05-25T03:35:49Z","title":"System-1.5 Reasoning: Traversal in Language and Latent Spaces with Dynamic Shortcuts","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:39.117278Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2505.18962"},"observation_digest":"sha256:87570e72596bf7aafcb1b0a049adb79cf725529da480a73f3e2cd8c47ec5c64c","observation_id":"9f0812b9-235b-422f-b9ab-e94d32a581bd","resolution":{"observed_at":"2026-08-07T14:27:39.117278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T13:54:26.905899Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20664","last_updated":"2025-05-27T03:18:31Z","snapshot_observed_at":"2026-08-08T06:46:23.874316Z","submitted_at":"2025-05-27T03:18:31Z","title":"Self-Route: Automatic Mode Switching via Capability Estimation for Efficient Reasoning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T13:54:26.905899Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2505.20664"},"observation_digest":"sha256:0a8894f2a7935081d71fe4f081b8dd7afae0e3d681d1eb506de5593efd6c13de","observation_id":"ca5f53be-6023-47cf-9f84-ca2e4cbf4044","resolution":{"observed_at":"2026-08-07T13:54:26.905899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T10:52:43.731124Z","title":"Can language models learn to skip steps? arXiv preprint arXiv:2411.01855, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04182","last_updated":"2025-06-04T17:28:38Z","snapshot_observed_at":"2026-08-07T10:44:04.363277Z","submitted_at":"2025-06-04T17:28:38Z","title":"Long or short CoT? Investigating Instance-level Switch of Large Reasoning Models","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:43.731124Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2506.04182"},"observation_digest":"sha256:038aa946fc7daa9f93eaceb8107bafd77b03c0a7ba589137185419cbd0da5476","observation_id":"9acbe5aa-4f54-4fa6-a216-c3ac9d1bc68c","resolution":{"observed_at":"2026-08-07T10:52:43.731124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T05:49:36.874631Z","title":"Can language models learn to skip steps?arXiv preprint arXiv:2411.01855, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.874631Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:ab1cbd6517e2401fa30836ac4964c1d660a26b0a5546212c5583a2514d3d3fc8","observation_id":"29cdb302-a971-4b8b-8d35-b197d55327d9","resolution":{"observed_at":"2026-08-07T05:49:36.874631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T04:38:09.483737Z","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":17,"source":"arxiv_source","source_observed_at":"2026-08-07T04:38:09.483737Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2506.10446"},"observation_digest":"sha256:836935c5281acb474b650541c4eeb98acfc104a53c147794970b00baf22c55b2","observation_id":"29ea50cc-b6d1-4a6c-8b6a-4dc85ddca9ab","resolution":{"observed_at":"2026-08-07T04:38:09.483737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T04:26:29.251219Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-09T03:27:12.818075Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.251219Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:5406d43cbad456d00dd42d91c127c79adde3207fe3b7b93f1c1a0578e897967e","observation_id":"84f35551-7b7f-4572-a1a8-9b642c4b643f","resolution":{"observed_at":"2026-08-07T04:26:29.251219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-07T12:05:09.511104Z","title":"Can language models learn to skip steps? 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14794","last_updated":"2025-05-31T18:23:19Z","snapshot_observed_at":"2026-08-09T02:52:28.921043Z","submitted_at":"2025-05-31T18:23:19Z","title":"Assembly of Experts: Linear-time construction of the Chimera LLM variants with emergent and adaptable behaviors","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:05:09.511104Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2506.14794"},"observation_digest":"sha256:672a17484549421bb25fbc69c9f0a27e11dde4a24b70f113986d1a09448d44fe","observation_id":"11502696-71a4-4c7c-9ffd-d832e8056088","resolution":{"observed_at":"2026-08-07T12:05:09.511104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-08-06T05:14:37.159143Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.02178","last_updated":"2026-06-29T02:19:28Z","snapshot_observed_at":"2026-08-07T20:42:16.632978Z","submitted_at":"2025-08-04T08:22:14Z","title":"Reconsidering Overthinking: Penalizing Internal and External Redundancy in CoT Reasoning","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T05:14:37.159143Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2508.02178"},"observation_digest":"sha256:138481528a51bc68e40dfdb93ddaa6673f7a7c2436302c4e860f54c972567382","observation_id":"234bbceb-3e6d-4242-8c54-aa356122e1df","resolution":{"observed_at":"2026-08-06T05:14:37.159143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":"2411.01855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-06-28T17:12:25.279751Z","title":"Wei Liu, Ruochen Zhou, Yiyun Deng, Yuzhen Huang, Junteng Liu, Yuntian Deng, Yizhe Zhang, and Junx- ian He","venue":null,"work_id":"380bb0a2-1d5b-41c6-a16e-5a2d0b86127f","year":2025},"citing_paper":{"arxiv_id":"2601.11340","last_updated":"2026-04-15T07:21:40Z","snapshot_observed_at":"2026-08-02T05:43:35.759183Z","submitted_at":"2026-01-16T14:38:18Z","title":"Neural Chain-of-Thought Search: Searching the Optimal Reasoning Path to Enhance Large Language Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-16T13:21:36.606855Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2601.11340"},"observation_digest":"sha256:207cb662dc3ea8c50cc6f2131e6ca886f92172b67c7fcbca7964e68f913da1de","observation_id":"a53f3548-a391-43f0-91f5-ffa096dec31c","resolution":{"observed_at":"2026-05-16T13:22:55.285493Z","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":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":"2411.01855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-06-28T17:12:25.279751Z","title":"Wei Liu, Ruochen Zhou, Yiyun Deng, Yuzhen Huang, Junteng Liu, Yuntian Deng, Yizhe Zhang, and Junx- ian He","venue":null,"work_id":"380bb0a2-1d5b-41c6-a16e-5a2d0b86127f","year":2025},"citing_paper":{"arxiv_id":"2605.06165","last_updated":"2026-05-07T12:51:49Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T12:51:49Z","title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-08T10:19:08.451445Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2605.06165"},"observation_digest":"sha256:cd71a932a968673afaa0605efb21bedd3dca628100adc564a549cc3dadc5e744","observation_id":"203547ee-1968-46cd-868a-9b7ede4252e7","resolution":{"observed_at":"2026-05-11T20:06:09.698291Z","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":"2411.01855","last_updated":"2024-11-04T07:10:24Z","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?","version":1},"cited_work":{"arxiv_id":"2411.01855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.01855","snapshot_observed_at":"2026-06-28T17:12:25.279751Z","title":"Wei Liu, Ruochen Zhou, Yiyun Deng, Yuzhen Huang, Junteng Liu, Yuntian Deng, Yizhe Zhang, and Junx- ian He","venue":null,"work_id":"380bb0a2-1d5b-41c6-a16e-5a2d0b86127f","year":2025},"citing_paper":{"arxiv_id":"2606.01168","last_updated":"2026-05-31T11:20:00Z","snapshot_observed_at":"2026-08-06T06:07:10.957400Z","submitted_at":"2026-05-31T11:20:00Z","title":"Thinking Economically: A Hierarchical Framework for Adaptive-Complexity Reasoning in LLMs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-28T17:05:48.244094Z"},"links":{"cited_paper":"/paper/2411.01855","citing_paper":"/paper/2606.01168"},"observation_digest":"sha256:6cb67bc46c654864c8e7a63320c5a645300d171e6a68459d49da8b6f111df332","observation_id":"0b3f4fe0-10a5-4c84-b4c6-5e2ae7878193","resolution":{"observed_at":"2026-06-28T17:12:25.281100Z","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/2411.01855/citation-record","integrity":"/paper/2411.01855/integrity","json":"/paper/2411.01855/citation-record.json","paper":"/paper/2411.01855"},"outbound":[],"paper":{"arxiv_id":"2411.01855","last_updated":"2024-11-04T07:10:24Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-01T16:42:29.985049Z","submitted_at":"2024-11-04T07:10:24Z","title":"Can Language Models Learn to Skip Steps?"},"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 14 inbound Pith citation observations for arXiv:2411.01855."}