{"as_of":"2026-08-16T23:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ae8e1ef9d0822a29d2df7031d47b1a3e3cd61a390be0d8c26734398e5427cc3","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:56:12.637345Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:53:43.839273Z","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-07-01T23:26:22.299993Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2506.14755","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-07-01T23:26:22.299993Z","title":"Yuanlin Chu, Bo Wang, Xiang Liu, Hong Chen, Aiwei Liu, and Xuming Hu","venue":null,"work_id":"242a7a02-d28b-4da9-b88c-5e49bca6f907","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":125,"source":"pdf_text","source_observed_at":"2026-05-12T08:40:40.910461Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2503.09567"},"observation_digest":"sha256:4e731f9c63b1858f13eea62072498c06ee844a62a3233e6d0830aba1229c196f","observation_id":"f8735614-7068-475b-93c4-0fa1d1519b56","resolution":{"observed_at":"2026-05-12T08:40:41.983748Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-08-06T17:53:43.839273Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09662","last_updated":"2025-07-13T14:51:59Z","snapshot_observed_at":"2026-08-15T08:55:38.744613Z","submitted_at":"2025-07-13T14:51:59Z","title":"Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:43.839273Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2507.09662"},"observation_digest":"sha256:e637401137209f82d2c53b268243946788d0549b1e0bc1a6208e1399f6b8e167","observation_id":"bc6ab941-4ace-481f-bf7d-10f787ff3438","resolution":{"observed_at":"2026-08-06T17:53:43.839273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-08-06T05:14:37.093116Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.02178","last_updated":"2026-06-29T02:19:28Z","snapshot_observed_at":"2026-08-14T11:46:27.446308Z","submitted_at":"2025-08-04T08:22:14Z","title":"Reconsidering Overthinking: Penalizing Internal and External Redundancy in CoT Reasoning","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T05:14:37.093116Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2508.02178"},"observation_digest":"sha256:7b70ed04a2ebec2163aff811d62d6d96879d64a277d1ea5f79cc1f45a077d619","observation_id":"6f69fd12-2d08-439a-a3b7-f2c67786832a","resolution":{"observed_at":"2026-08-06T05:14:37.093116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-08-06T05:08:11.949845Z","title":"Optimizing length compression in large reasoning models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.02186","last_updated":"2025-08-04T08:31:45Z","snapshot_observed_at":"2026-08-15T07:14:07.547538Z","submitted_at":"2025-08-04T08:31:45Z","title":"Failure Cases Are Better Learned But Boundary Says Sorry: Facilitating Smooth Perception Change for Accuracy-Robustness Trade-Off in Adversarial Training","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T05:08:11.949845Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2508.02186"},"observation_digest":"sha256:9ba33cb3a9f7b0c6a70a5f0e5e140c7163f8e1e5208710ebfb485009de4cebd0","observation_id":"e4466a45-860c-4843-ac05-09dab89649c4","resolution":{"observed_at":"2026-08-06T05:08:11.949845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2506.14755","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-07-01T23:26:22.299993Z","title":"Yuanlin Chu, Bo Wang, Xiang Liu, Hong Chen, Aiwei Liu, and Xuming Hu","venue":null,"work_id":"242a7a02-d28b-4da9-b88c-5e49bca6f907","year":2025},"citing_paper":{"arxiv_id":"2510.19669","last_updated":"2026-05-08T14:25:34Z","snapshot_observed_at":"2026-08-11T14:12:52.280610Z","submitted_at":"2025-10-22T15:16:06Z","title":"DiffAdapt: Difficulty-Adaptive Reasoning for Token-Efficient LLM Inference","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T04:31:40.360872Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2510.19669"},"observation_digest":"sha256:626dce68f3c24426983ec48a74703d170cd5d5fa1df37a4349ff14f903c7709b","observation_id":"30e538f9-3651-454a-afb4-d2086c23c59c","resolution":{"observed_at":"2026-05-18T04:32:23.125817Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-08-03T05:43:53.133475Z","title":"Optimizing length compression in large reasoning models.arXiv preprint arXiv:2506.14755, 2025b","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01472","last_updated":"2026-06-24T08:53:47Z","snapshot_observed_at":"2026-08-03T05:43:51.520535Z","submitted_at":"2026-02-01T22:31:19Z","title":"ConPress: Learning Efficient Reasoning from Multi-Question Contextual Pressure","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T05:43:53.133475Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2602.01472"},"observation_digest":"sha256:94aac4a69ba0faec6439e21e6d9353a3d0195f535927523de8d8a269c6b4041a","observation_id":"a6ceeae9-b58d-436c-8a4c-899f5ae407d6","resolution":{"observed_at":"2026-08-03T05:43:53.133475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-08-02T20:44:44.123438Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22642","last_updated":"2026-06-18T19:10:56Z","snapshot_observed_at":"2026-08-12T17:05:29.500530Z","submitted_at":"2026-02-26T05:47:30Z","title":"Compress the Easy, Explore the Hard: Difficulty-Aware Entropy Regularization for Efficient LLM Reasoning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T20:44:44.123438Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2602.22642"},"observation_digest":"sha256:a93589e0137d79067bfbb8df2f348871e7e874ef1ffe998886dfea3105534e6d","observation_id":"45d69a29-7726-45c5-8cff-81d125af72f0","resolution":{"observed_at":"2026-08-02T20:44:44.123438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2506.14755","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-07-01T23:26:22.299993Z","title":"Yuanlin Chu, Bo Wang, Xiang Liu, Hong Chen, Aiwei Liu, and Xuming Hu","venue":null,"work_id":"242a7a02-d28b-4da9-b88c-5e49bca6f907","year":2025},"citing_paper":{"arxiv_id":"2605.07316","last_updated":"2026-05-08T06:25:08Z","snapshot_observed_at":"2026-08-16T02:30:36.876054Z","submitted_at":"2026-05-08T06:25:08Z","title":"Implicit Compression Regularization: Concise Reasoning via Internal Shorter Distributions in RL Post-Training","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-11T01:12:20.864362Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2605.07316"},"observation_digest":"sha256:7d610cf49144d4984a61f64291ab91d3f1357ae48291cc93848e719692f0b8bd","observation_id":"0809db36-c9f9-448e-83e8-83e98ef3a1c4","resolution":{"observed_at":"2026-05-11T04:35:59.740619Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2506.14755","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-07-01T23:26:22.299993Z","title":"Yuanlin Chu, Bo Wang, Xiang Liu, Hong Chen, Aiwei Liu, and Xuming Hu","venue":null,"work_id":"242a7a02-d28b-4da9-b88c-5e49bca6f907","year":2025},"citing_paper":{"arxiv_id":"2605.30832","last_updated":"2026-05-29T04:37:49Z","snapshot_observed_at":"2026-08-16T20:30:50.042886Z","submitted_at":"2026-05-29T04:37:49Z","title":"SLAT: Segment-Level Adaptive Trimming for Efficient CoT Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T22:27:30.783923Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2605.30832"},"observation_digest":"sha256:1e079166785834d086a33a570ce9861fe528ed91d30897ef8cd0b8b5b9fa7a3e","observation_id":"916a2bcc-8e1c-4cc7-a6a6-229d9c34f5d9","resolution":{"observed_at":"2026-06-28T22:32:44.405373Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2506.14755","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-07-01T23:26:22.299993Z","title":"Yuanlin Chu, Bo Wang, Xiang Liu, Hong Chen, Aiwei Liu, and Xuming Hu","venue":null,"work_id":"242a7a02-d28b-4da9-b88c-5e49bca6f907","year":2025},"citing_paper":{"arxiv_id":"2606.02871","last_updated":"2026-06-01T20:36:06Z","snapshot_observed_at":"2026-07-06T23:43:12.737017Z","submitted_at":"2026-06-01T20:36:06Z","title":"Adaptive Latent Agentic Reasoning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-28T14:24:22.855486Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2606.02871"},"observation_digest":"sha256:3e9e5acccc0a208db10980bce06a34c1f9667a21d3e97a58203e2ffb0d84ab40","observation_id":"1038563c-6048-40bb-a459-256a1afe1383","resolution":{"observed_at":"2026-07-01T23:26:22.302073Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14755","snapshot_observed_at":"2026-08-01T11:17:40.210209Z","title":"Optimizing length compression in large reasoning models.arXiv preprint arXiv:2506.14755,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19962","last_updated":"2026-07-22T09:40:22Z","snapshot_observed_at":"2026-08-12T17:14:31.468690Z","submitted_at":"2026-07-22T09:40:22Z","title":"EvoThink: Evolving Thinking in Large Reasoning Models via Self-Pruning and Aha-Moment Preference Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T11:17:40.210209Z"},"links":{"cited_paper":"/paper/2506.14755","citing_paper":"/paper/2607.19962"},"observation_digest":"sha256:fdffc23167ddfd1dc8b37911e59649fa568e02dd3d2cae63360fe81b243c1edc","observation_id":"5b0eb710-8d34-4a72-aadd-14e25293efe4","resolution":{"observed_at":"2026-08-01T11:17:40.210209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.14755/citation-record","integrity":"/paper/2506.14755/integrity","json":"/paper/2506.14755/citation-record.json","paper":"/paper/2506.14755"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-15T19:56:12.443346Z","title":"Openai o1 system card","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.443346Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:1ad4c14bdc4084ef697ceb1b21d89282ac8d40d79a8e1c40267736ab71c800d0","observation_id":"81b239dc-171d-4559-a6c1-4ba00c24665c","resolution":{"observed_at":"2026-08-15T19:56:12.443346Z","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-08-15T19:56:12.448323Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.448323Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:4600c3e6320dd2013e39284758e313d88ddd1516a1270c3483e93233d1c12140","observation_id":"56e554bc-9229-48c0-a92b-01660bcc93ed","resolution":{"observed_at":"2026-08-15T19:56:12.448323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.11903","last_updated":"2023-01-10T23:07:57Z","snapshot_observed_at":"2026-08-13T07:04:41.220509Z","submitted_at":"2022-01-28T02:33:07Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.11903","snapshot_observed_at":"2026-08-15T19:56:12.452869Z","title":"Chain-of-thought prompting elicits reasoning in large language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.452869Z"},"links":{"cited_paper":"/paper/2201.11903","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:e5f0f6ba957f511e00f541e087f4abbbf05d0556dcd7eed724f76ea6080ca891","observation_id":"518c83dd-35b8-473d-bb53-d45f47d8c1b9","resolution":{"observed_at":"2026-08-15T19:56:12.452869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21380","last_updated":"2026-04-12T10:37:12Z","snapshot_observed_at":"2026-08-14T15:42:28.805307Z","submitted_at":"2025-03-27T11:20:17Z","title":"Challenging the Boundaries of Reasoning: An Olympiad-Level Math Benchmark for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21380","snapshot_observed_at":"2026-08-15T19:56:12.456843Z","title":"Challenging the boundaries of reasoning: An olympiad-level math benchmark for large language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.456843Z"},"links":{"cited_paper":"/paper/2503.21380","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:135ce8f1604ed406fa91fea2f340523b06576ec36f38c88ce0c8c4b7eee6d449","observation_id":"7abd0397-4f84-4a35-85dc-4d80cfc6594f","resolution":{"observed_at":"2026-08-15T19:56:12.456843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.03065","last_updated":"2024-01-05T20:53:51Z","snapshot_observed_at":"2026-08-13T22:46:36.295191Z","submitted_at":"2024-01-05T20:53:51Z","title":"CRUXEval: A Benchmark for Code Reasoning, Understanding and Execution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.03065","snapshot_observed_at":"2026-08-15T19:56:12.461043Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.461043Z"},"links":{"cited_paper":"/paper/2401.03065","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:33e17f91f782aa7bb1ec9af7abcfd263d242c9e8a0cc8bccebb7333d14b05fed","observation_id":"78b1a4f8-01ad-45a5-97c1-69d667a72861","resolution":{"observed_at":"2026-08-15T19:56:12.461043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.09567","snapshot_observed_at":"2026-08-15T19:56:12.465322Z","title":"Towards reasoning era: A survey of long chain-of-thought for reasoning large language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.465322Z"},"links":{"cited_paper":"/paper/2503.09567","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:fc7dac917695250a9b2c3e7aad31c15cdfe2ffc77860b3841c774e6d83e35c18","observation_id":"17395788-7ef0-4e26-92e9-cbcb95dfe1f8","resolution":{"observed_at":"2026-08-15T19:56:12.465322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.04697","last_updated":"2025-10-03T01:55:58Z","snapshot_observed_at":"2026-08-15T06:09:25.789897Z","submitted_at":"2025-03-06T18:43:29Z","title":"L1: Controlling How Long A Reasoning Model Thinks With Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.04697","snapshot_observed_at":"2026-08-15T19:56:12.469941Z","title":"L1: Controlling how long a reasoning model thinks with reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.469941Z"},"links":{"cited_paper":"/paper/2503.04697","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:6cf3a2c84675f49a4d75be0c46acc992c0c6bcd9665fd67ffdfd1047bd9efba3","observation_id":"a0ebe2e7-32cf-4e33-8afd-f4d20a68162e","resolution":{"observed_at":"2026-08-15T19:56:12.469941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.21187","last_updated":"2025-02-01T07:57:37Z","snapshot_observed_at":"2026-08-01T16:43:44.704797Z","submitted_at":"2024-12-30T18:55:12Z","title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.21187","snapshot_observed_at":"2026-08-15T19:56:12.474395Z","title":"Do not think that much for 2+ 3=? on the overthinking of o1-like llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.474395Z"},"links":{"cited_paper":"/paper/2412.21187","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:ca8cea64b27e4b86cb1e5455a0deda20bac38a9b859e85702601d3b908a0bc20","observation_id":"68fc4268-9176-4b2f-aec6-82449ea68dbb","resolution":{"observed_at":"2026-08-15T19:56:12.474395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16419","snapshot_observed_at":"2026-08-15T19:56:12.480484Z","title":"Stop overthinking: A survey on efficient reasoning for large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.480484Z"},"links":{"cited_paper":"/paper/2503.16419","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:d0cbb05c945f2090e101965590cfff7d265a793516a7c048eccce9fc71a0b456","observation_id":"b8923d28-dd04-46db-ad36-11601ff6fe5e","resolution":{"observed_at":"2026-08-15T19:56:12.480484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08235","last_updated":"2025-02-12T09:23:26Z","snapshot_observed_at":"2026-08-13T20:05:34.411750Z","submitted_at":"2025-02-12T09:23:26Z","title":"The Danger of Overthinking: Examining the Reasoning-Action Dilemma in Agentic Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08235","snapshot_observed_at":"2026-08-15T19:56:12.485197Z","title":"The danger of overthinking: Examining the reasoning-action dilemma in agentic tasks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.485197Z"},"links":{"cited_paper":"/paper/2502.08235","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:12bbd059fe73b35141ea009f87504b10f799df9d811c4c71e2806784284bd8ba","observation_id":"1742ebad-5d10-4d32-98a6-168b9f151259","resolution":{"observed_at":"2026-08-15T19:56:12.485197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21659","last_updated":"2025-05-21T11:59:38Z","snapshot_observed_at":"2026-08-16T04:54:19.125993Z","submitted_at":"2025-04-30T14:01:45Z","title":"Ada-R1: Hybrid-CoT via Bi-Level Adaptive Reasoning Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21659","snapshot_observed_at":"2026-08-15T19:56:12.490313Z","title":"Adar1: From long-cot to hybrid-cot via bi-level adaptive reasoning optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.490313Z"},"links":{"cited_paper":"/paper/2504.21659","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:9729830db854a9810c096a461c340334550802ffe7327dcf7608ce108f1ee334","observation_id":"2e5396e3-7c3b-4415-9f98-5bb060ff807b","resolution":{"observed_at":"2026-08-15T19:56:12.490313Z","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-08-15T19:56:12.495041Z","title":"Dast: Difficulty-adaptive slow-thinking for large reasoning models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.495041Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:9e0ad1b879ed09d3962434a0cce4cb61631f5329ebea36894f66a04c92c38cf5","observation_id":"e61dd383-e932-4a54-b175-a5fe66155073","resolution":{"observed_at":"2026-08-15T19:56:12.495041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01296","last_updated":"2025-04-02T01:59:26Z","snapshot_observed_at":"2026-08-13T14:42:27.278298Z","submitted_at":"2025-04-02T01:59:26Z","title":"ThinkPrune: Pruning Long Chain-of-Thought of LLMs via Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01296","snapshot_observed_at":"2026-08-15T19:56:12.499151Z","title":"Thinkprune: Pruning long chain-of-thought of llms via reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.499151Z"},"links":{"cited_paper":"/paper/2504.01296","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:e04b788c4959cfca60608719d706290a2d11b7548952237c03cb7f5f8f582267","observation_id":"ce912d4c-a7c8-4b24-9906-14c0b585f073","resolution":{"observed_at":"2026-08-15T19:56:12.499151Z","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-10T17:00:34.555363Z","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-08-15T19:56:12.504026Z","title":"O1-pruner: Length-harmonizing fine-tuning for o1-like reasoning pruning, 2025 b","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.504026Z"},"links":{"cited_paper":"/paper/2501.12570","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:297f9ee2bce1d97b0e43a85993cbf86376856c4e2a3bdc05fea6a41e7d4278f0","observation_id":"a06fa339-3d84-441a-b1ae-653ce2e94270","resolution":{"observed_at":"2026-08-15T19:56:12.504026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-08-15T22:38:53.825110Z","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12599","snapshot_observed_at":"2026-08-15T19:56:12.508076Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.508076Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:a6ae2c75ad2810be78ba7bc63ad200fa47e8ff926c660ff947f9c0fbf55895d2","observation_id":"d674870c-9752-4d33-b49d-5c222c223aaf","resolution":{"observed_at":"2026-08-15T19:56:12.508076Z","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-08-15T19:56:12.512274Z","title":"Qwen3, April 2025 a","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.512274Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:d2e73830f0be4f8f3f477be1b7c01cca946c0c316d7f7cd5352d4706e1b65652","observation_id":"b3dd0930-fae6-4aff-ab72-27af1e240183","resolution":{"observed_at":"2026-08-15T19:56:12.512274Z","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-08-15T19:56:12.516538Z","title":"Qwq-32b: Embracing the power of reinforcement learning, March 2025 b","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.516538Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:42bd72c05736a3d08c80970e389bd0a181eb75c53ffe386ef60dfc5d5e81f85a","observation_id":"3c79b22f-b3eb-4abf-8776-ce6662dbe694","resolution":{"observed_at":"2026-08-15T19:56:12.516538Z","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-08-15T19:56:12.520598Z","title":"Yian Zhang, and Chris Alexiuk","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.520598Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:47fdd9570fa267f3d851bd3bf1f728752e9533e2168950b708e88de4d9fc8dac","observation_id":"322138f9-5dc1-448b-9c92-588c67dad519","resolution":{"observed_at":"2026-08-15T19:56:12.520598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.20783","last_updated":"2025-10-06T09:30:03Z","snapshot_observed_at":"2026-08-13T12:34:54.476684Z","submitted_at":"2025-03-26T17:59:14Z","title":"Understanding R1-Zero-Like Training: A Critical Perspective","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.20783","snapshot_observed_at":"2026-08-15T19:56:12.525489Z","title":"Understanding r1-zero-like training: A critical perspective, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.525489Z"},"links":{"cited_paper":"/paper/2503.20783","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:534194bc0a2531dbf889575ec54098a7d7d75f05df244da5a31a4c8e88b8dbda","observation_id":"92d6ab52-214e-403f-ad6c-2d5ac74a2ba4","resolution":{"observed_at":"2026-08-15T19:56:12.525489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14476","last_updated":"2025-05-20T01:37:34Z","snapshot_observed_at":"2026-08-02T01:40:54.187278Z","submitted_at":"2025-03-18T17:49:06Z","title":"DAPO: An Open-Source LLM Reinforcement Learning System at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14476","snapshot_observed_at":"2026-08-15T19:56:12.530153Z","title":"Dapo: An open-source llm reinforcement learning system at scale","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.530153Z"},"links":{"cited_paper":"/paper/2503.14476","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:71b81aeb0d91e1731e069448e75ccebf3a3b175b88e1f46dfea4f424ae17f34b","observation_id":"1ca758bb-4f08-4523-bbec-9c9bd35b547d","resolution":{"observed_at":"2026-08-15T19:56:12.530153Z","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-08-15T19:56:12.535861Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.535861Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:e8f294895a8d97f2d2bd488b5eab3dfaa05d56d4a8513293c35149f92ee52248","observation_id":"b2e71229-6465-42c0-abda-6c1b200e8ebe","resolution":{"observed_at":"2026-08-15T19:56:12.535861Z","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-08-15T19:56:12.540535Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.540535Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:3a70a3d01998bfd87cc6e7bdbf03084e041f34d21cd13d89bb65b4b1b233c2b3","observation_id":"ed45114d-d98a-4985-97e2-23d3093f46aa","resolution":{"observed_at":"2026-08-15T19:56:12.540535Z","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-08-15T19:56:12.544588Z","title":"Gemini 2.5 pro","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.544588Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:38f38d635b78a62059d94dcdabe30d594a4e63a23fc3664c372a1d6650c38be2","observation_id":"c7fb6856-4cc7-4921-b209-dc1207c34b2e","resolution":{"observed_at":"2026-08-15T19:56:12.544588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21318","last_updated":"2025-04-30T05:05:09Z","snapshot_observed_at":"2026-08-12T04:56:27.232647Z","submitted_at":"2025-04-30T05:05:09Z","title":"Phi-4-reasoning Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21318","snapshot_observed_at":"2026-08-15T19:56:12.548881Z","title":"Phi-4-reasoning technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.548881Z"},"links":{"cited_paper":"/paper/2504.21318","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:f0153791f7e37825a36f15df7a20e230d6358bf38116bc12a7c1e31edad54f12","observation_id":"7c5cf0c2-f5a6-402b-8eb4-9153c550960d","resolution":{"observed_at":"2026-08-15T19:56:12.548881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-15T19:56:12.553304Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.553304Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:5c9881bbd93296c1d5ecd6767949fb8898d81a4e93110f5b86d53a81299d0893","observation_id":"0eaa993b-0236-4e17-804b-5bdc9794d37a","resolution":{"observed_at":"2026-08-15T19:56:12.553304Z","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-08-15T19:56:12.557923Z","title":"Code-r1: Reproducing r1 for code with reliable rewards","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.557923Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:3c36bb0297b14290c42ea7e18a7b4932364f660cf3605467ea908ea80dfbb7ac","observation_id":"b4864d86-7867-41ec-916c-5b71de176e37","resolution":{"observed_at":"2026-08-15T19:56:12.557923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03262","last_updated":"2025-11-10T15:11:13Z","snapshot_observed_at":"2026-08-16T04:57:30.418363Z","submitted_at":"2025-01-04T02:08:06Z","title":"REINFORCE++: Stabilizing Critic-Free Policy Optimization with Global Advantage Normalization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.03262","snapshot_observed_at":"2026-08-15T19:56:12.562231Z","title":"Reinforce++: An efficient rlhf algorithm with robustness to both prompt and reward models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.562231Z"},"links":{"cited_paper":"/paper/2501.03262","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:7765598d0c238329d922876a82e8517640478f49f781025bf1ca4a7ac9e7942e","observation_id":"69bacfd6-94fb-4c93-9dc3-111adee4f039","resolution":{"observed_at":"2026-08-15T19:56:12.562231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09601","last_updated":"2025-02-13T18:52:36Z","snapshot_observed_at":"2026-08-15T01:40:51.444222Z","submitted_at":"2025-02-13T18:52:36Z","title":"CoT-Valve: Length-Compressible Chain-of-Thought Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09601","snapshot_observed_at":"2026-08-15T19:56:12.566594Z","title":"Cot-valve: Length-compressible chain-of-thought tuning, 2025 a","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.566594Z"},"links":{"cited_paper":"/paper/2502.09601","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:f87c5ae36a5e3dca1cf940401138c9ff1ef8f1af08a1f898dfed9a822819eb19","observation_id":"f4992d9e-8a12-47d9-b63c-d07aff99991c","resolution":{"observed_at":"2026-08-15T19:56:12.566594Z","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-08-15T19:56:12.572177Z","title":"Training language models to reason efficiently, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.572177Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:a4fe95283c48cb16cc4caabdf0a4596d0e64db8c24896492eee1b42052b84bcf","observation_id":"00d49e53-b5a8-47e3-992c-b6cf9da31e72","resolution":{"observed_at":"2026-08-15T19:56:12.572177Z","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-08-15T19:56:12.577671Z","title":"Aytes, Jinheon Baek, and Sung Ju Hwang","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.577671Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:4010b2b6a0c3931b2f1efe7595ade27653ee2c8afeb988a33b0f02352b780af7","observation_id":"ebb13721-38da-489b-83e7-1e87cf4e0ecc","resolution":{"observed_at":"2026-08-15T19:56:12.577671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18547","last_updated":"2025-06-02T00:44:09Z","snapshot_observed_at":"2026-08-16T12:59:58.216334Z","submitted_at":"2024-12-24T16:55:45Z","title":"Token-Budget-Aware LLM Reasoning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.18547","snapshot_observed_at":"2026-08-15T19:56:12.584084Z","title":"Token-budget-aware llm reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.584084Z"},"links":{"cited_paper":"/paper/2412.18547","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:268c73652ac0e1c6edeff35e200c2e4551cd09835b56b479a89fde56a1acfe34","observation_id":"f3ef6c34-5c71-45c4-b554-dbc7538ef52d","resolution":{"observed_at":"2026-08-15T19:56:12.584084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.09858","last_updated":"2025-04-14T04:08:16Z","snapshot_observed_at":"2026-08-16T12:41:30.521725Z","submitted_at":"2025-04-14T04:08:16Z","title":"Reasoning Models Can Be Effective Without Thinking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.09858","snapshot_observed_at":"2026-08-15T19:56:12.588793Z","title":"Reasoning models can be effective without thinking, 2025 b","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.588793Z"},"links":{"cited_paper":"/paper/2504.09858","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:51e1915dd8b89960587e96cc9aed444dab539fb8f25bb5ca04e441c0444f37bb","observation_id":"a8941b35-eb1d-4f50-b36f-c5879ecd7c2c","resolution":{"observed_at":"2026-08-15T19:56:12.588793Z","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-08-15T19:56:12.594338Z","title":"Qwen2.5: A party of foundation models, September 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.594338Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:daa4e63e2f0eda085941c04e30eb1552c6ae178a0926d99b9e6b92ce2610f50c","observation_id":"1cd9036a-9c9f-4795-bffe-e36127970ddd","resolution":{"observed_at":"2026-08-15T19:56:12.594338Z","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-08-15T19:56:12.599474Z","title":"Gemini 2.5 flash","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.599474Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:bd844ef5c09b2632be36c670c49a399f5836a5598eb3fb3942a1001d5ead4476","observation_id":"607f402b-c8a2-44f6-a38a-e121ea528f64","resolution":{"observed_at":"2026-08-15T19:56:12.599474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06023","last_updated":"2024-07-24T18:40:36Z","snapshot_observed_at":"2026-08-16T13:36:07.758741Z","submitted_at":"2024-07-08T15:17:46Z","title":"Distilling System 2 into System 1","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.06023","snapshot_observed_at":"2026-08-15T19:56:12.606029Z","title":"Distilling system 2 into system 1, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.606029Z"},"links":{"cited_paper":"/paper/2407.06023","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:a022bad0e9872712553b66df5949d4000a24c4744f96771a468aead38421e4fc","observation_id":"457a0db9-fef0-4b40-92f1-330fb6045945","resolution":{"observed_at":"2026-08-15T19:56:12.606029Z","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-08-15T19:56:12.611256Z","title":"The 23rd international conference on artificial intelligence in medicine (aime 2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.611256Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:f68cf5ac0cc4b6c92ba4b326d399f9fa588e8812032f1a57a5878db818186971","observation_id":"c5b974aa-2611-4b7b-b30b-9610dcab6756","resolution":{"observed_at":"2026-08-15T19:56:12.611256Z","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-08-15T19:56:12.615273Z","title":"Let's verify step by step","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.615273Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:1796e8e691bca6b55f37cf7fa3817669df7aa1060bfdf27089332b990ac3b166","observation_id":"90c1919a-afef-46f5-bc11-c5847e72147e","resolution":{"observed_at":"2026-08-15T19:56:12.615273Z","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-08-15T19:56:12.620496Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.620496Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:158f0b8d1823d856dd5ab75ecccd834e7f7f62b0b85671fe82cfc73b51a6427a","observation_id":"74939c00-0f98-489b-9989-adfb81f786b7","resolution":{"observed_at":"2026-08-15T19:56:12.620496Z","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-08-15T19:56:12.625244Z","title":"American mathematics competitions (amc)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.625244Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:be1ecb685df478bfceb3d488bcf47819231c88f647b023f8ccf72704a85958f6","observation_id":"75f6f2d6-203f-4572-8aa1-4ed91f9c2869","resolution":{"observed_at":"2026-08-15T19:56:12.625244Z","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-08-15T19:56:12.628760Z","title":"Gpqa: A graduate-level google-proof q&a benchmark","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.628760Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:aff2c7d87c2e5fd885fb1ed1f8d6b25ed075f1582e48cd3d236b2a763fb0505a","observation_id":"2dedafc0-be57-4275-9460-de5f9acf3226","resolution":{"observed_at":"2026-08-15T19:56:12.628760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-08-16T07:05:57.323612Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-15T19:56:12.632651Z","title":"Livecodebench: Holistic and contamination free evaluation of large language models for code","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.632651Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:a5d4f2a438e9c51ebeb3eae77fa457d71713240111e6ef8c22f69d69281133c2","observation_id":"4c1a46d1-2c0f-4cd3-b5a7-1c2be03c5ba7","resolution":{"observed_at":"2026-08-15T19:56:12.632651Z","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-08-15T19:56:12.637345Z","title":"Trl: Transformer reinforcement learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T19:56:12.637345Z"},"links":{"citing_paper":"/paper/2506.14755"},"observation_digest":"sha256:299c0b9451faddc683067d37296e369e206b1b30130234081837ff2ecf98b786","observation_id":"69cf9226-f2bb-40e1-bee6-fe3f9e5fa084","resolution":{"observed_at":"2026-08-15T19:56:12.637345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.14755","last_updated":"2025-09-11T02:13:24Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T10:30:52.726897Z","submitted_at":"2025-06-17T17:50:16Z","title":"Optimizing Length Compression in Large Reasoning Models"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":42},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 11 inbound Pith citation observations for arXiv:2506.14755."}