Derive the exact finite-sample coverage law at general dependence
Derive the exact finite-sample distribution of realised coverage for clustered calibration scores at arbitrary within-cluster dependence, beyond the independent and perfectly tied endpoints.
References
The exact finite-sample law at general ρ is open, and the ρ = 1 case shows why it is hard: the tied law is governed by ⌈k/m⌉ ceiling discreteness that no smooth function of ρ reproduces.
What the data establish needs no λU : the exceedance correlation at p = 0.99 is 0.228 [0.172, 0.283]. Whether it plateaus there or continues toward zero beyond 0.99 is open, and settling it needs reference arms rebuilt at the measured ˜m and ρI .
What remains open is the composition, and the two do not compose neutrally. They pull against each other, through the same cluster sizes: reweighting to the cluster-average marginal carries a Kish weighting effective size that never exceeds n, costing 19.9% of the calibration set on §6.1’s released profile and climbing with raggedness to a ratio of 0.26 at CV2 = 2.1 (reweighting_cost.py).