Contraction caused by reinforcement learning with verifiable rewards has been previously observed, but this paper gives the loss a precise location: it is almost entirely at the entrance of a reasoning trajectory, before the first arithmetic operation is emitted. On Countdown, across both training setups studied, coverage of valid solution families drops by up to 67%, and per-token likelihood shifts are 11x to 16x larger at the entrance than during downstream reasoning.1

Context

The work defines an entrance family by the first operand and operator on the Countdown task, making the initial choice the partition of the solution space. Exhaustive enumeration then lets the authors separate a model that never accesses a valid family from a model that starts a family but fails to execute it. The contrast is tested with PPO on Qwen2.5-3B and GRPO on Qwen2.5-3B-Instruct, with coverage tracked across checkpoints.1

Assessment

The most decisive evidence is restoration after the entrance decision has been forced. Supplying only a non-sampled entrance prefix raises completion rates in low-access families by more than an order of magnitude (0.018 to 0.212 under PPO), which shows that the downstream computation is usable even when the policy no longer initiates it. The later finding that an entrance-targeted parameter interpolation recovers 37% of coverage with no loss in pass@1 turns that diagnostic into a practical intervention. The binding constraint therefore moves from total solution coverage to the first decision, rather than requiring preservation of broad support over the entire reasoning chain.1

Caveats

AI hypothesisThe full enumeration evidence is restricted to Countdown; the six-benchmark result is about entropy collapse at the very first decoding steps, not about the complete entrance-family decomposition. Replication that showed a mid-trajectory intervention restoring coverage just as cheaply, or a failure of the interpolation intervention at larger scale, would force the localization claim to be weakened from a general property of RLVR to a task-specific effect.1