You are right and I ran your control before saying so.
Every number reproduces. share on floor across the 30 arms gives r = 0.9840. The competence-controlled residual is +0.0223 against my +0.2635. Per rung, chat minus raw: +0.0968, +0.0434, +0.0085, -0.0118, -0.0254, sign change at 7B. Ranking framings by mean anisotropy recovers your matched pairs exactly: 30 pairs at 0.02 giving -0.0003, 42 at 0.03 giving +0.0010 with 23 positive, 64 at 0.05 giving +0.0102.
So share is a competence statistic and my reading of it does not survive. I withdraw it.
I also ran the version that has no competence in it at all. All 36 coder_ladder arms, 47,232 generations, whitespace-normalized, inverse-Simpson effective distinct candidates out of 8:
unformatted 18 arms mean 7.925 min 7.634
formatted 18 arms mean 7.947 min 7.737
all 8 byte-identical: 0 of 164 problems, in every one of the 36 arms
No collapse. The template does not deduplicate the pool. Whatever k_eff = log(1-oracle)/log(1-floor) is picking up, and it does separate cleanly at 5.05-7.72 unformatted against 2.57-4.43 formatted, it is not string convergence, and I cannot show it is not competence either. The slope needed to bridge that gap is -12.4 per unit floor, and it sits between the two families' own internal slopes, -15.2 unformatted and -1.5 formatted. A between-family effect that lands inside the between-family range is not separable from competence with this data.
While I was in there I hit something else, and it is in the number your paper leads with.
consensus_select.py line 236 averages sel, which is covered picks only. Lines 238 and 239 compute floor and oracle over all rows. Line 242 pushes the covered-only mean into agg["consensus"], and line 247 subtracts the all-rows floor from it. summary.consensus 0.4426 is the unweighted mean of consensus_on_covered to four decimals, so 0.2558 is a covered-subset rate minus a 164-problem rate.
Coverage runs 82 to 164 of 164, mean 133.6. picks[i] is None when no candidate produces a runnable signature, which is exactly where the floor is zero, so those rows dilute floor and oracle and not consensus.
12 of 36 arms then beat their own oracle:
coder14B_inst__raw consensus 0.5281 oracle 0.3293 cov 89/164 captured 1.783
coder3B_base__raw consensus 0.2024 oracle 0.1341 cov 84/164 captured 1.605
coder0.5B_inst__raw consensus 0.2561 oracle 0.1829 cov 82/164 captured 1.466
A selector cannot beat "at least one of the 8 passes" on the same problems.
Put consensus back on all 164 and it is 0.3760 with uncovered scored zero, 0.3902 crediting uncovered at the arm's own floor, which is generous since those are the hardest rows. Captured headroom becomes 0.613 to 0.659, not 0.8289. No arm exceeds 1.0 after that, max 0.968.
The bias is not uniform. Coverage rank-correlates +0.91 with floor (Spearman; Pearson is +0.79, the ranks are tighter than the levels), so it lands on the low-floor arms:
published captured unformatted 1.194 formatted 0.613
corrected captured unformatted 0.695 formatted 0.557
Which is the part that touches our argument. The published table says the selector does twice as well on raw pools as on templated ones. Corrected, that 0.58 gap is 0.14.
Does the deployed selector abstain when nothing runs, or fall back to a pick? That decides which of the two bounds is the honest one.