mlsanityData to 7 Oct 2026

SCA: Segment-Wise CoT Compression with Answer Alignment

arXiv 2603.07598 ↗First posted 8 Mar 2026cs.AI cs.LGcited by 1

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Chain-of-thought (CoT) reasoning improves problem solving, but long think traces increase inference cost. Existing CoT compression methods usually optimize completion-level length. For structured thinking models, however, a completion contains both a think segment and an answer segment, so completion-level compression can save tokens by compressing not only the CoT but also the answer. We call this failure mode answer drift. We propose Segment-wise CoT Compression with Answer Alignment (SCA), an answer-preserving think-compression method. SCA parses completions into functional segments, routes compression rewards only to successful think tokens, and protects answer tokens through length and distribution alignment to a frozen base model. Experiments show that, across datasets from multiple domains, SCA achieves state-of-the-art-level chain-of-thought compression while preserving the base model's performance and answer alignment. Training data and code are included in the supplementary code and data package.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 16 of its 20 references that are in the map. First posted on arXiv 8 Mar 2026.

Builds on

16 of 20 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025DeepCompress: A Dual Reward Strategy for Dynamically Exploring and Compressing Reasoning Chains31 Oct
  2. 2025Making Slow Thinking Faster: Compressing LLM Chain-of-Thought via Step Entropy5 Aug
  3. 2025Think Silently, Think Fast: Dynamic Latent Compression of LLM Reasoning Chains22 May
  4. 2025CoT-Valve: Length-Compressible Chain-of-Thought Tuning13 Feb

Other references · 12

  1. 2023Let's Verify Step by Stepcited by 3,598
  2. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  3. 2025DeepMath-103K: A Large-Scale, Challenging, Decontaminated, and Verifiable Mathematical Dataset for Advancing Reasoningcited by 261
  4. 2025CODI: Compressing Chain-of-Thought into Continuous Space via Self-Distillationcited by 216
  5. 2024Mind Your Step (by Step): Chain-of-Thought can Reduce Performance on Tasks where Thinking Makes Humans Worsecited by 107
  6. 2025SIM-CoT: Supervised Implicit Chain-of-Thoughtcited by 63
  7. 2024Can Language Models Learn to Skip Steps?cited by 59
  8. 2024Understanding Chain-of-Thought in LLMs through Information Theorycited by 36
  9. 2025On the Effect of Negative Gradient in Group Relative Deep Reinforcement Optimizationcited by 31
  10. 2025Group-Relative REINFORCE Is Secretly an Off-Policy Algorithm: Demystifying Some Myths About GRPO and Its Friendscited by 13
  11. 2025CoT-Evo: Evolutionary Distillation of Chain-of-Thought for Scientific Reasoningcited by 5
  12. 2025Learning Without Critics? Revisiting GRPO in Classical Reinforcement Learning Environmentscited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026SYNLAT: Syntax-Aligned Text-Latent Compression for Chain-of-Thought Reasoning
  2. 2025R1-Compress: Long Chain-of-Thought Compression via Chunk Compression and Search
  3. 2026Every Token Leaves a Ripple in the Stream of Thought: Eliciting Model-Internal Token Saliency for Chain-of-Thought Compression
  4. 2026Chain Of Thought Compression: A Theoretical Analysis
  5. 2025From Long to Lean: Performance-aware and Adaptive Chain-of-Thought Compression via Multi-round Refinement
  6. 2024Expediting and Elevating Large Language Model Reasoning via Hidden Chain-of-Thought Decoding
  7. 2026Zipping the Thought: When and How Compressed Reasoning Data Works in LLM Post-Training
  8. 2026CtrlCoT: Dual-Granularity Chain-of-Thought Compression for Controllable Reasoning