Paper Citation Record · LEDGER

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.28707 v1

Coverage vector

measured 19 of 19 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T00:40:47.982975Z

measured 19 of 19 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

19 of 19 outbound references displayed

verified exact0
verified fuzzy0
unresolved19
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ce7224ee-4dc7-4b60-9ae2-783d55a9d15c · outbound

This paper cites NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.391760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac8ad98d-7cef-472f-80ec-391608ba5453 · outbound

This paper cites What is the smallest positive perfect cube that can be written as the sum of three consecutive integers?.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models What is the smallest positive perfect cube that can be written as the sum of three consecutive integers?

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.982975Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c05c6285-10ca-4934-9f19-881dc26dfa93 · outbound

This paper cites gpt-oss-120b & gpt-oss-20b Model Card.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models gpt-oss-120b & gpt-oss-20b Model Card

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.928484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 934389f1-fb06-4031-a323-7827a79fc052 · outbound

This paper cites David Rein, Betty Li Hou, Asa Cooper Stickland, Jack- son Petty, Richard Yuanzhe Pang, Julien Dirani, Ju- lian Michael, and Samuel R.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models David Rein, Betty Li Hou, Asa Cooper Stickland, Jack- son Petty, Richard Yuanzhe Pang, Julien Dirani, Ju- lian Michael, and Samuel R

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.933422Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c18be5ef-9d71-4edb-a3cc-1f296fdf4ebc · outbound

This paper cites Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.942948Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f92c0bc0-2975-4525-8a09-2fae00087c26 · outbound

This paper cites Gemma 4 Technical Report.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Gemma 4 Technical Report

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.947426Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0eec267-5511-474d-bdb8-26ac1360ea99 · outbound

This paper cites Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoning.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoning

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.951859Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d542907-f58d-481a-99ce-c6916a19e54e · outbound

This paper cites Xuan Xiong, Huan Liu, Li Gu, Zhixiang Chi, Yue Qiu, Yuanhao Yu, and Yang Wang.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Xuan Xiong, Huan Liu, Li Gu, Zhixiang Chi, Yue Qiu, Yuanhao Yu, and Yang Wang

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.956793Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c942a9b9-5c8b-47f4-9303-9bce9afd6c9c · outbound

This paper cites ETR: Entropy Trend Reward for Efficient Chain-of-Thought Reasoning.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models ETR: Entropy Trend Reward for Efficient Chain-of-Thought Reasoning

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.961119Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ec06a75-3919-4112-b76a-f6ad794801eb · outbound

This paper cites Qwen3 Technical Report.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Qwen3 Technical Report

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.965472Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c993a0d9-31c1-4885-88e3-fc0001c4291f · outbound

This paper cites Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvement.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvement

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.969995Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0719104-4296-49be-9cc1-5bcc439a0d1a · outbound

This paper cites Shorthand for Thought: Compressing LLM Reasoning via Entropy-Guided Supertokens.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Shorthand for Thought: Compressing LLM Reasoning via Entropy-Guided Supertokens

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.974293Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19658e0b-af7f-4c6e-87e5-b52bc2be1814 · outbound

This paper cites an unresolved cited work.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.978576Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c7ce380-5d7c-471c-8085-238653861c23 · outbound

This paper cites Training Verifiers to Solve Math Word Problems.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Training Verifiers to Solve Math Word Problems

Reference 2021

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.190536Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f2287ae-fd92-46dd-96ba-f7955537532b · outbound

This paper cites In 2022 IEEE/ACM Seventh International Conference on Internet-of-Things Design and Implementation (IoTDI), pages 67–79.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models In 2022 IEEE/ACM Seventh International Conference on Internet-of-Things Design and Implementation (IoTDI), pages 67–79

Reference 2022

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.782280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e42488c-9050-45ee-b36a-36f69aef63ec · outbound

This paper cites Let's Verify Step by Step.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Let's Verify Step by Step

Reference 2023

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.668041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 082eab1d-8436-491f-ad74-c883728d6970 · outbound

This paper cites Beyond the Commitment Boundary: Probing Epiphenomenal Chain-of-Thought in Large Reasoning Models.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models Beyond the Commitment Boundary: Probing Epiphenomenal Chain-of-Thought in Large Reasoning Models

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.938336Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 628cf8a0-c615-4d28-beb4-de98c724c5be · outbound

This paper cites DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.282896Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dde27144-cd35-4693-9243-30e9de6c37e0 · outbound

This paper cites InFindings of the Association for Computational Linguistics: EACL 2026, pages 5000–5006, Rabat, Morocco.

Demystifying Entropy-based Selection for Chain-of-Thought Compression in Large Reasoning Models InFindings of the Association for Computational Linguistics: EACL 2026, pages 5000–5006, Rabat, Morocco

Reference 2026

Resolution: unresolved; no resolver link, observed 2026-08-03T00:40:47.502044Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.