{"as_of":"2026-08-14T10:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:55e03e56724055dd34882bcab3c8754084b22181963b1508511d856ae222993e","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:24:01.619558Z","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-29T21:53:59.580360Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.13260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-06-29T21:53:59.580360Z","title":"Mehul Damani, Idan Shenfeld, Andi Peng, Andreea Bobu, and Jacob Andreas","venue":null,"work_id":"d8e06a34-e44b-4d79-9443-3781065bf2e6","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":148,"source":"pdf_text","source_observed_at":"2026-05-12T08:40:40.910461Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2503.09567"},"observation_digest":"sha256:b4dc716ed9fce8ecc825696e617fdcd3b0eb06bb1f8dc067d5afd8612d846cf0","observation_id":"d1625c5a-205d-4f80-b8f8-e7ddc7973d78","resolution":{"observed_at":"2026-05-12T08:40:42.090279Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.13260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-06-29T21:53:59.580360Z","title":"Mehul Damani, Idan Shenfeld, Andi Peng, Andreea Bobu, and Jacob Andreas","venue":null,"work_id":"d8e06a34-e44b-4d79-9443-3781065bf2e6","year":2025},"citing_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-11T13:10:23.709172Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-14T01:29:56.480020Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2503.16419"},"observation_digest":"sha256:d73faafb2cd262eafe3afc33b01a10b09ba6c4e5304d6d208a85547f1b8b359c","observation_id":"e6e6c48e-649e-4f71-94d8-d17b7784915b","resolution":{"observed_at":"2026-05-14T01:29:57.204112Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-08-07T04:24:01.619558Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10822","last_updated":"2025-06-12T15:43:01Z","snapshot_observed_at":"2026-08-14T10:06:17.635970Z","submitted_at":"2025-06-12T15:43:01Z","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T04:24:01.619558Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2506.10822"},"observation_digest":"sha256:b55ee6583d5e6ffb29362648199a6224cd213ef595bb3caa80216e69399fddb1","observation_id":"c975d91d-02ee-43e8-86ac-857102901f45","resolution":{"observed_at":"2026-08-07T04:24:01.619558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-08-06T21:45:07.266788Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.23840","last_updated":"2025-06-30T13:30:33Z","snapshot_observed_at":"2026-08-10T15:11:41.836176Z","submitted_at":"2025-06-30T13:30:33Z","title":"Do Thinking Tokens Help or Trap? Towards More Efficient Large Reasoning Model","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T21:45:07.266788Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2506.23840"},"observation_digest":"sha256:1a0b36cd796a5f31025e117c5ea61ac3320fc5bc38e0fbc7c07d1f326a2fab40","observation_id":"6a1d8979-ccc5-46a8-9fa4-e5d23aadb2ba","resolution":{"observed_at":"2026-08-06T21:45:07.266788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-08-06T19:16:31.270828Z","title":"Stepwise perplexity-guided refinement for efficient chain-of-thought reasoning in large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.06087","last_updated":"2025-07-08T15:28:48Z","snapshot_observed_at":"2026-08-11T12:26:13.493802Z","submitted_at":"2025-07-08T15:28:48Z","title":"CoRE: Enhancing Metacognition with Label-free Self-evaluation in LRMs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:16:31.270828Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2507.06087"},"observation_digest":"sha256:ad7b42b153aca62af13d801a3d9a4ad33a023ac410d3a84c5f79fb3fd4079eb3","observation_id":"fdb4558d-7171-43ea-8d16-a67e2b4e44fb","resolution":{"observed_at":"2026-08-06T19:16:31.270828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.13260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-06-29T21:53:59.580360Z","title":"Mehul Damani, Idan Shenfeld, Andi Peng, Andreea Bobu, and Jacob Andreas","venue":null,"work_id":"d8e06a34-e44b-4d79-9443-3781065bf2e6","year":2025},"citing_paper":{"arxiv_id":"2601.05110","last_updated":"2026-04-28T12:22:24Z","snapshot_observed_at":"2026-08-13T12:56:21.379232Z","submitted_at":"2026-01-08T16:58:07Z","title":"GlimpRouter: Efficient Collaborative Inference by Glimpsing One Token of Thoughts","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T15:53:07.496412Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2601.05110"},"observation_digest":"sha256:ca2ae1e0de5e7184372df7c024aa8d5ee77d4921a668d40b00948303a3125c5d","observation_id":"454758f9-ec15-4947-833b-7fde37c28262","resolution":{"observed_at":"2026-05-16T15:58:04.047759Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.13260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-06-29T21:53:59.580360Z","title":"Mehul Damani, Idan Shenfeld, Andi Peng, Andreea Bobu, and Jacob Andreas","venue":null,"work_id":"d8e06a34-e44b-4d79-9443-3781065bf2e6","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":158,"source":"arxiv_source","source_observed_at":"2026-05-08T10:19:08.451445Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2605.06165"},"observation_digest":"sha256:da5344aef7ad67024d35412a4ab0de79d96833f3b8d3490be950803ed54487bf","observation_id":"2c17d480-0244-4d59-b75a-4e5ea59932d9","resolution":{"observed_at":"2026-05-11T20:06:09.124377Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.13260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-06-29T21:53:59.580360Z","title":"Mehul Damani, Idan Shenfeld, Andi Peng, Andreea Bobu, and Jacob Andreas","venue":null,"work_id":"d8e06a34-e44b-4d79-9443-3781065bf2e6","year":2025},"citing_paper":{"arxiv_id":"2605.25603","last_updated":"2026-05-25T08:54:55Z","snapshot_observed_at":"2026-08-10T09:24:29.678831Z","submitted_at":"2026-05-25T08:54:55Z","title":"Detecting Unfaithful Chain-of-Thought via Circuit-Guided Internal-External Discrepancy","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T21:47:17.894881Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2605.25603"},"observation_digest":"sha256:a4c743a13b5cc259276f1530fd75bc2c2605c6ad8939b40b4ee042eb2e9fdc7f","observation_id":"6d461862-067d-47df-abc6-7d1288175064","resolution":{"observed_at":"2026-06-29T21:53:59.581752Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.13260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13260","snapshot_observed_at":"2026-06-29T21:53:59.580360Z","title":"Mehul Damani, Idan Shenfeld, Andi Peng, Andreea Bobu, and Jacob Andreas","venue":null,"work_id":"d8e06a34-e44b-4d79-9443-3781065bf2e6","year":2025},"citing_paper":{"arxiv_id":"2606.01168","last_updated":"2026-05-31T11:20:00Z","snapshot_observed_at":"2026-08-12T06:37:36.358906Z","submitted_at":"2026-05-31T11:20:00Z","title":"Thinking Economically: A Hierarchical Framework for Adaptive-Complexity Reasoning in LLMs","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-06-28T17:05:48.244094Z"},"links":{"cited_paper":"/paper/2502.13260","citing_paper":"/paper/2606.01168"},"observation_digest":"sha256:07b68181d76fa0562fa75f4e772b1a044f164c80507cb731e1ab48efbbd8822b","observation_id":"432e4927-dfa7-4740-b5b2-b88d25378453","resolution":{"observed_at":"2026-06-28T17:12:25.246887Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.13260/citation-record","integrity":"/paper/2502.13260/integrity","json":"/paper/2502.13260/citation-record.json","paper":"/paper/2502.13260"},"outbound":[],"paper":{"arxiv_id":"2502.13260","last_updated":"2025-02-18T20:04:51Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T14:15:50.668871Z","submitted_at":"2025-02-18T20:04:51Z","title":"Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2502.13260."}