{"as_of":"2026-08-10T16:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4c531fab1ce151a40315869326fb6db7abf02332f79505c39bbfc719dc69190b","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T00:40:47.982975Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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.28707/citation-record","integrity":"/paper/2607.28707/integrity","json":"/paper/2607.28707/citation-record.json","paper":"/paper/2607.28707"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.14561","last_updated":"2025-04-01T16:04:53Z","snapshot_observed_at":"2026-08-08T04:32:26.591214Z","submitted_at":"2024-07-18T17:59:01Z","title":"NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.14561","snapshot_observed_at":"2026-08-03T00:40:47.391760Z","title":"Preprint, arXiv:2407.14561","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.391760Z"},"links":{"cited_paper":"/paper/2407.14561","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:ee848c1dec9c4832f85699c17d0a79b6d78b058e79ea28ca5e81c44736f499e8","observation_id":"ce7224ee-4dc7-4b60-9ae2-783d55a9d15c","resolution":{"observed_at":"2026-08-03T00:40:47.391760Z","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-03T00:40:47.982975Z","title":"What is the smallest positive perfect cube that can be written as the sum of three consecutive integers?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.982975Z"},"links":{"citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:e63cb13e2929fbfcde772b723b49a227889b2d422f51a0c5e4ec39925e5aa3c2","observation_id":"ac8ad98d-7cef-472f-80ec-391608ba5453","resolution":{"observed_at":"2026-08-03T00:40:47.982975Z","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-01T16:27:35.664983Z","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-08-03T00:40:47.928484Z","title":"Ziqing Qiao, Yongheng Deng, Jiali Zeng, Dong Wang, Lai Wei, Fandong Meng, Jie Zhou, Ju Ren, and Yaoxue Zhang","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.928484Z"},"links":{"cited_paper":"/paper/2508.10925","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:4867ef7e90d1bf2b352aaf2db8264b3a038a2b26ead24f5de37b3352240f264c","observation_id":"c05c6285-10ca-4934-9f19-881dc26dfa93","resolution":{"observed_at":"2026-08-03T00:40:47.928484Z","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-03T00:40:47.933422Z","title":"David Rein, Betty Li Hou, Asa Cooper Stickland, Jack- son Petty, Richard Yuanzhe Pang, Julien Dirani, Ju- lian Michael, and Samuel R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.933422Z"},"links":{"citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:ef3fe23e972b1dc69ed22d1195f44a977f7020f71c5de0c06e42e572702f8b6e","observation_id":"934389f1-fb06-4031-a323-7827a79fc052","resolution":{"observed_at":"2026-08-03T00:40:47.933422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-03T00:40:47.942948Z","title":"Preprint, arXiv:2408.03314","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.942948Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:135c063e3a4a562691cbd65aca812761e6f4ff0d35f407aa6568b60c57d62325","observation_id":"c18be5ef-9d71-4edb-a3cc-1f296fdf4ebc","resolution":{"observed_at":"2026-08-03T00:40:47.942948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.02770","last_updated":"2026-07-02T21:08:53Z","snapshot_observed_at":"2026-08-09T14:18:19.682421Z","submitted_at":"2026-07-02T21:08:53Z","title":"Gemma 4 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.02770","snapshot_observed_at":"2026-08-03T00:40:47.947426Z","title":"Preprint, arXiv:2607.02770","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.947426Z"},"links":{"cited_paper":"/paper/2607.02770","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:5c26c118a0ec0e896df347f1b5eaae0d3a3d73aaaa7c13bbc7cfca6650e19026","observation_id":"f92c0bc0-2975-4525-8a09-2fae00087c26","resolution":{"observed_at":"2026-08-03T00:40:47.947426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01939","last_updated":"2025-11-13T10:08:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-02T17:54:39Z","title":"Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01939","snapshot_observed_at":"2026-08-03T00:40:47.951859Z","title":"InForty-second Interna- tional Conference on Machine Learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.951859Z"},"links":{"cited_paper":"/paper/2506.01939","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:9824e6263fdfaa727df5bff6bc1b6fbde4f9ef2e8ab0c794aae5decc44996ad7","observation_id":"f0eec267-5511-474d-bdb8-26ac1360ea99","resolution":{"observed_at":"2026-08-03T00:40:47.951859Z","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-03T00:40:47.956793Z","title":"Xuan Xiong, Huan Liu, Li Gu, Zhixiang Chi, Yue Qiu, Yuanhao Yu, and Yang Wang","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.956793Z"},"links":{"citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:497458ee27e03fe241b8c5813adc37b4381f33a26f19ae15fb4a14981b2f33c6","observation_id":"4d542907-f58d-481a-99ce-c6916a19e54e","resolution":{"observed_at":"2026-08-03T00:40:47.956793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.05355","last_updated":"2026-04-07T02:53:36Z","snapshot_observed_at":"2026-07-06T22:54:04.491386Z","submitted_at":"2026-04-07T02:53:36Z","title":"ETR: Entropy Trend Reward for Efficient Chain-of-Thought Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.05355","snapshot_observed_at":"2026-08-03T00:40:47.961119Z","title":"Preprint, arXiv:2604.05355","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.961119Z"},"links":{"cited_paper":"/paper/2604.05355","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:87e1006afa2e16023b532185f5be8970e1aa61c5ff400ec47b6237a3b09fca72","observation_id":"c942a9b9-5c8b-47f4-9303-9bce9afd6c9c","resolution":{"observed_at":"2026-08-03T00:40:47.961119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-03T00:40:47.965472Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.965472Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:39fd0032434dba2d972f18d3d01bdda3d398fc889f45bf0458ad574cd49b1365","observation_id":"7ec06a75-3919-4112-b76a-f6ad794801eb","resolution":{"observed_at":"2026-08-03T00:40:47.965472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12122","last_updated":"2024-09-18T16:45:37Z","snapshot_observed_at":"2026-07-06T19:17:41.512834Z","submitted_at":"2024-09-18T16:45:37Z","title":"Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvement","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12122","snapshot_observed_at":"2026-08-03T00:40:47.969995Z","title":"Yifan Zhang and Team Math-AI","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.969995Z"},"links":{"cited_paper":"/paper/2409.12122","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:8125a830fa5f8f6eb2b70d2d31591bb4995d27a8954d104b9bd19a2eb916f8c9","observation_id":"c993a0d9-31c1-4885-88e3-fc0001c4291f","resolution":{"observed_at":"2026-08-03T00:40:47.969995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.26355","last_updated":"2026-08-07T08:17:40Z","snapshot_observed_at":"2026-08-10T16:09:20.753986Z","submitted_at":"2026-04-29T07:06:43Z","title":"Shorthand for Thought: Compressing LLM Reasoning via Entropy-Guided Supertokens","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.26355","snapshot_observed_at":"2026-08-03T00:40:47.974293Z","title":"A Suffix ablation To rule out that our choice of answer-eliciting suf- fix (Therefore the answer is \\boxed { , foot- note of Section","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.974293Z"},"links":{"cited_paper":"/paper/2604.26355","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:768a4e7ebe8952a25337bee82e62eb65820157ef313900f607babba75f5f9aa7","observation_id":"c0719104-4296-49be-9cc1-5bcc439a0d1a","resolution":{"observed_at":"2026-08-03T00:40:47.974293Z","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-03T00:40:47.978576Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.978576Z"},"links":{"citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:966acb925c63cb76ba9c113d032f2dab7a26babd3bda5e2860c19c8cf1309e5a","observation_id":"19658e0b-af7f-4c6e-87e5-b52bc2be1814","resolution":{"observed_at":"2026-08-03T00:40:47.978576Z","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-07T01:45:38.840969Z","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-03T00:40:47.190536Z","title":"DeepSeek-AI","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.190536Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:9a54a7670c5a9cbbb0aa64d03d5630de0a4fd49341bf59071dc5e3cf302a55de","observation_id":"7c7ce380-5d7c-471c-8085-238653861c23","resolution":{"observed_at":"2026-08-03T00:40:47.190536Z","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-03T00:40:47.782280Z","title":"In 2022 IEEE/ACM Seventh International Conference on Internet-of-Things Design and Implementation (IoTDI), pages 67–79","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.782280Z"},"links":{"citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:d257257cc6d650c3217ff43d207d13385addeaabd13de8e83b5cceb1ff7b5977","observation_id":"7f2287ae-fd92-46dd-96ba-f7955537532b","resolution":{"observed_at":"2026-08-03T00:40:47.782280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-05T13:11:04.104454Z","submitted_at":"2023-05-31T17:24:00Z","title":"Let's Verify Step by Step","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.20050","snapshot_observed_at":"2026-08-03T00:40:47.668041Z","title":"Bill Yuchen Lin, Ronan Le Bras, Kyle Richardson, Ashish Sabharwal, Radha Poovendran, Peter Clark, and Yejin Choi","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.668041Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:9339d48c16c0d150c572ceef22e6126b858cb3d3ccbaef2bb1e078f62fad955b","observation_id":"2e42488c-9050-45ee-b36a-36f69aef63ec","resolution":{"observed_at":"2026-08-03T00:40:47.668041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.13603","last_updated":"2026-06-11T17:21:16Z","snapshot_observed_at":"2026-08-04T19:01:07.283287Z","submitted_at":"2026-06-11T17:21:16Z","title":"Beyond the Commitment Boundary: Probing Epiphenomenal Chain-of-Thought in Large Reasoning Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.13603","snapshot_observed_at":"2026-08-03T00:40:47.938336Z","title":"In First Conference on Language Modeling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.938336Z"},"links":{"cited_paper":"/paper/2606.13603","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:737ec86f6dc82ba03900bc454c007ad945080d98c96ec9d4d2d233652455cd8d","observation_id":"082eab1d-8436-491f-ad74-c883728d6970","resolution":{"observed_at":"2026-08-03T00:40:47.938336Z","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-07-06T02:11:23.670680Z","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-03T00:40:47.282896Z","title":"arXiv preprint arXiv:2501.12948","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.282896Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:2a8a2b7873aa5256535a550972dd6375b2a7f760ebf3bc55d0a77a374d909e7d","observation_id":"628cf8a0-c615-4d28-beb4-de98c724c5be","resolution":{"observed_at":"2026-08-03T00:40:47.282896Z","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-03T00:40:47.502044Z","title":"InFindings of the Association for Computational Linguistics: EACL 2026, pages 5000–5006, Rabat, Morocco","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-03T00:40:47.502044Z"},"links":{"citing_paper":"/paper/2607.28707"},"observation_digest":"sha256:7dcf346a5083f277498e52694fe0d94cedfcb1ea45b3f408485792da167f1a30","observation_id":"dde27144-cd35-4693-9243-30e9de6c37e0","resolution":{"observed_at":"2026-08-03T00:40:47.502044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.28707","last_updated":"2026-07-30T15:59:51Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T04:26:58.038845Z","submitted_at":"2026-07-30T15:59:51Z","title":"Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":19},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2607.28707."}