{"as_of":"2026-08-06T15:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2bc2ce399832b67eaf78d68cbc00141ec5dcd283c0a752e3e9037dc30a157313","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T05:14:37.159143Z","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-03T03:23:56.857266Z","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:5bb631da0997eeb5f61f42903042a069d6d77396d0b992b5bd553a3e86379285","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-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-06T05:14:34.101910Z","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:8848d0f81bd6689780e1c594917a8814059889c014014dea7fafac6eea8820bc","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:e74b925cb0f23b8aeb0b06a98274a3d7da800b224235106557bb25ad851d8d2a","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:155ca81a0b888d39a163d6a456740f717cecaeea98b62ee314b74e014f540535","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:30e87ecb36606b64861545f39b6d996ec7dbd39df7d863541c68bc1af3f5e05e","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2411.01855."}