{"as_of":"2026-08-19T16:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:47ca574bf32aae57cb4af068afd1ae61fb3c7fc24fc576db81a75410af39cb9c","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T07:09:11.486851Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.11089/citation-record","integrity":"/paper/2607.11089/integrity","json":"/paper/2607.11089/citation-record.json","paper":"/paper/2607.11089"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Chain-of-thought prompting elicits reasoning in large language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:0d15de6a81be49b08399cab6567f7e6071f66067732e33440aabcc6bab9fb528","observation_id":"d502edfd-d6b6-4ef9-ab58-731057a46333","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Self-consistency improves chain of thought reasoning in language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:2257f769a0c2084731f400a1decf05bb7eacdad9883da8f7e165048b51c2438a","observation_id":"82b395ae-97aa-4ae3-b966-51c451053a43","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:724f2ba0afc02077dcc267a542ac0a05205f6e0289e914bbac8626348c4e6305","observation_id":"9c9fa60a-b365-4705-9a65-96754c010f1a","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19393","last_updated":"2025-03-01T06:07:39Z","snapshot_observed_at":"2026-08-17T11:00:39.333660Z","submitted_at":"2025-01-31T18:48:08Z","title":"s1: Simple test-time scaling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19393","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"s1: Simple test-time scaling, March 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2501.19393","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:18f6e68025af5b3e7047bfa70c2f1c20e045ac8b9d1f2e993820a1bb28341dee","observation_id":"c774fc75-4c1e-4fb1-9c13-7bc6be621f2f","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13752","last_updated":"2025-06-16T17:57:05Z","snapshot_observed_at":"2026-08-09T05:35:21.916120Z","submitted_at":"2025-06-16T17:57:05Z","title":"Steering LLM Thinking with Budget Guidance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13752","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Steering LLM Thinking with Budget Guidance, June 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2506.13752","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:8a3bfb3e13f244f29f3f6ef9c7ea5ad21106f720a6aa1e2edfef08351ee5a441","observation_id":"042889fd-755d-475b-87ea-7df922a6101b","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12570","last_updated":"2025-01-29T03:11:03Z","snapshot_observed_at":"2026-08-18T10:17:24.497798Z","submitted_at":"2025-01-22T01:35:11Z","title":"O1-Pruner: Length-Harmonizing Fine-Tuning for O1-Like Reasoning Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12570","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"O1-Pruner: Length-Harmonizing Fine-Tuning for O1-Like Reasoning Pruning, January 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2501.12570","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:d8ba86c3555e4ec019df19e468d5cb09823698878506e067c8a3ad034a950b89","observation_id":"de24d6c5-9489-42a2-9866-085dbf671fb1","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"TokenSkip: Control- lable Chain-of-Thought Compression in LLMs, September 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:18e41e72edcb0cbcb093634cdf3613b8c51fcb83a0b5a15bde500b8f2545640d","observation_id":"8191c467-aab2-4a78-a578-0a115e3bf2b5","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Making Slow Thinking Faster: Compressing LLM Chain-of-Thought via Step Entropy, February 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:b7eadc8b911af9960a6e682753384cb766c351f850a4552f63204ee7f5d824fd","observation_id":"ba08b205-c337-4aa5-929c-67de818be298","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"DRPO: Efficient Reasoning via Decoupled Reward Policy Optimization, March 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:4d19384b25294cb6c402e4e32de7fa3a4e737d488903ed2fc074c442beb7cadf","observation_id":"e80696a1-3626-4ab2-9801-2340ddacfb9f","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"HALT-CoT: Model-Agnostic Early Stopping for Chain-of-Thought Reasoning via Answer Entropy","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:54dbe2d6592e4aa6387768eae3fcfc98ec9b9b9e22dbfb4e231bf045083ac7e3","observation_id":"cde9ea56-22ae-4e25-a597-70332969c2a7","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Answer Convergence as a Signal for Early Stopping in Reasoning, September 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:7cf94181292177f4f776e1931a46b7bf8f2aafb0c66aa9c4c505596286ea2ffe","observation_id":"fd6ee554-63e0-422f-9122-86723ad13bd7","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Incentivizing llms to self-verify their answers, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:6f162b5d50e791629312f43adaf163ea746960e91da3135114fc414c12f3ec78","observation_id":"1a892f27-1215-4753-b7c3-693c9e512a43","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13949","last_updated":"2025-05-20T05:28:21Z","snapshot_observed_at":"2026-08-16T19:51:32.817974Z","submitted_at":"2025-05-20T05:28:21Z","title":"FlashThink: An Early Exit Method For Efficient Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13949","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"FlashThink: An Early Exit Method For Efficient Reasoning, May 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2505.13949","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:a1ad42be8554ecf9217a9a53e643d8aef04266ffefd0fb29a7a53db85920e61b","observation_id":"ac84fc34-3f0f-4421-b844-d9e111871f62","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Early stopping chain-of-thoughts in large language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:0af31650ae7bf9aff3f9be90345d7d2754fd083785b9987bcc992bf2b1dceeba","observation_id":"95add1f7-315c-4f69-b96d-0c9b4ec3ef0d","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:e3d117085f9aed15290b27028c69377bedf5569ed127ebdaa0b5908e267913e5","observation_id":"4a27be70-4b20-4e0f-9817-5a5a9f036749","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13171","last_updated":"2024-12-17T18:50:33Z","snapshot_observed_at":"2026-08-13T23:47:35.674752Z","submitted_at":"2024-12-17T18:50:33Z","title":"Compressed Chain of Thought: Efficient Reasoning Through Dense Representations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13171","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Compressed Chain of Thought: Efficient Reasoning Through Dense Representations, December 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2412.13171","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:aa677e4499c179429ee1e146ed481402ab19e7f7299c04632084bb14e9b25ae2","observation_id":"53f89ed2-b511-481c-ae26-e990d94e3766","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Training Large Language Models to Reason in a Continuous Latent Space, November","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:402d46488a5cb2ee06beee8e48bd8d34628c1c4f719d4ce23af0701197e0a0a5","observation_id":"cba8c4fe-f21f-44d7-9a6a-86be93b1d866","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06769","last_updated":"2025-11-03T00:53:34Z","snapshot_observed_at":"2026-08-17T06:12:37.525438Z","submitted_at":"2024-12-09T18:55:56Z","title":"Training Large Language Models to Reason in a Continuous Latent Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06769","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2412.06769","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:ea5e6dba0aeada1648c7595f6893ba68eb5d7c68c6b6265b915ab06bf6e635b4","observation_id":"404239de-8450-4aaa-8082-ad0c1633701d","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18600","last_updated":"2025-03-03T17:08:21Z","snapshot_observed_at":"2026-08-18T14:29:54.622995Z","submitted_at":"2025-02-25T19:36:06Z","title":"Chain of Draft: Thinking Faster by Writing Less","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18600","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Chain of Draft: Thinking Faster by Writing Less, March 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2502.18600","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:486f998b5b90328dca4b23c46e27d5c4dad5b4233065ab2b008ca8775b3e76c5","observation_id":"6c924ed9-c3a3-4c0a-a404-0f4e98bc2e87","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Think just enough: Sequence-level entropy as a confidence signal for llm reasoning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:834fc827f4869dd35797d7e7fed1594800160bad7cfc8c54e307e52fc16c97a8","observation_id":"75d36c36-051a-4411-ba67-da0210fea0f4","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Dynamic early exit in reasoning models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:8d1167e59715d5ed3a3b8aa2f20fdf116e1d2998421bcdecb6851625453a076e","observation_id":"b86529b8-7c9d-46d1-af26-e4397be40328","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Stop when enough: Adaptive early-stopping for chain-of-thought reasoning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:4bc82dc15df4d9fa867644ea5b3d5f16ef0662f5ecb5c6363456d00868448f70","observation_id":"33ba503c-91a0-4007-be51-dda8abfb246d","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Reasoning models know when they’re right: Probing hidden states for self-verification, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:ecd31eec944ce3dec1d150e6e601f48a8d2068504d781a4db84dcb2a8d6d5bd6","observation_id":"c394bb84-fd5e-4b9d-874d-8b14a6e8e104","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.06180","last_updated":"2023-09-12T12:50:04Z","snapshot_observed_at":"2026-08-02T09:51:08.145755Z","submitted_at":"2023-09-12T12:50:04Z","title":"Efficient Memory Management for Large Language Model Serving with PagedAttention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.06180","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Gonzalez, Hao Zhang, and Ion Stoica","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2309.06180","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:7a8722380435d8f5b1ccc5318384fe8eadadc28989c7db9f8850b2f7be6bce82","observation_id":"59bb95da-03ca-48ba-9767-d96281844284","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.07961","last_updated":"2025-05-23T04:50:59Z","snapshot_observed_at":"2026-08-18T00:41:54.603816Z","submitted_at":"2025-05-12T18:04:39Z","title":"Making Small Language Models Efficient Reasoners: Intervention, Supervision, Reinforcement","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.07961","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Making Small Language Models Efficient Reasoners: Intervention, Supervision, Reinforcement, May 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2505.07961","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:47cddd55cecf24f1d247b401172af5fd2db40c117d3f11b9aec32be1689eef81","observation_id":"8f3b2d51-b066-417b-b03b-9934dd5d82f7","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Math-Verify: Math Verification Library, April 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:4c7a2877f4741ebcff50e9f50e07cc7850f168d8a9edd7371afdca54e7b8e69a","observation_id":"4e71ce58-624a-436f-b1d8-9cb65a938658","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:55cfd36fc3533ec655741cae24c1cc2d8b82d62d4219350e5c1a2a50de5530e8","observation_id":"be607687-6488-4f27-908c-fa7156c9f832","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.10925","last_updated":"2025-08-08T19:24:38Z","snapshot_observed_at":"2026-08-14T02:46:12.121034Z","submitted_at":"2025-08-08T19:24:38Z","title":"gpt-oss-120b & gpt-oss-20b Model Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.10925","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2508.10925","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:1ee6a25ce8a4dd256a662b81fbc986b7591560df975c210c1a6b6a35fdcf22c4","observation_id":"e63ba075-05ec-4261-9101-08ce6a4cba4b","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Deepscaler: Surpassing o1-preview with a 1.5b model by scaling rl","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:2b30b7c498439c1a088de9ba1c40b024c8e4c5b7ad36f28f88fead0db74fe9fc","observation_id":"23292f2b-08c0-44c6-bad5-175e48ac9ec9","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07985","last_updated":"2024-12-24T04:04:30Z","snapshot_observed_at":"2026-08-16T19:47:24.627230Z","submitted_at":"2024-10-10T14:39:33Z","title":"Omni-MATH: A Universal Olympiad Level Mathematic Benchmark For Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07985","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Omni- MATH: A Universal Olympiad Level Mathematic Benchmark For Large Language Models, December 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2410.07985","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:cf7abe2aa865f288f1f8a3b2251e158f34aa655af99d8ae5e7ecc2222d14f0a3","observation_id":"54ae2a75-170f-4185-8607-c99e59f0dca6","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.09413","last_updated":"2024-12-22T10:44:13Z","snapshot_observed_at":"2026-08-16T16:04:15.848709Z","submitted_at":"2024-12-12T16:20:36Z","title":"Imitate, Explore, and Self-Improve: A Reproduction Report on Slow-thinking Reasoning Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.09413","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Imitate, Explore, and Self-Improve: A Reproduction Report on Slow-thinking Reasoning Systems, December 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2412.09413","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:3946c00743f6edcf6dd2c48d1db659189189da9d1c76b61d4df3e3e242b87032","observation_id":"5cee0f84-8327-4472-91b3-f2f6f8d37402","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Training Verifiers to Solve Math Word Problems, November 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:024a240307e5b3d74b1d91d287d3722e8286291c21690412ab0a47e4e7f7c236","observation_id":"78b0cac9-bfec-4d47-aa69-b1b4c9bfd22d","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset, November 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:d4848a8a278f570b8b9423050a06e425a353ae613b2228e3b8ce1719cccea9d5","observation_id":"53b6f6b8-48ad-461f-86b1-08bcd1b08f7d","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T07:09:11.486851Z","title":"Not all thoughts are generated equal: Efficient llm reasoning via multi-turn reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T07:09:11.486851Z"},"links":{"citing_paper":"/paper/2607.11089"},"observation_digest":"sha256:15621e8edffd3ca723392fefa48be3dc6cf7be76a780bc8dc98b66121f94ecb5","observation_id":"aad71eb9-d891-49e1-a230-ec9834b12c36","resolution":{"observed_at":"2026-07-14T07:09:11.486851Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.11089","last_updated":"2026-07-13T04:57:22Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T19:27:16.268533Z","submitted_at":"2026-07-13T04:57:22Z","title":"OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":34},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2607.11089."}