โ€บNavigation

Iteration 20 โ€” Candidate A Extraction Checkpoint CHECKPOINT

In plain words: the first candidate paper was pulled and read (via the project's own scraper). It fits the campaign's open gap better than hoped, for three reasons: (1) its tests are computed by reshuffling real data โ€” exactly the style the no-synthetic rule mandates; (2) they work for any test statistic and never divide by a residual variance โ€” so the perfect-fit breakdown that killed the old instrument mathematically cannot happen; (3) the same framework yields always-valid sequential monitors โ€” which is what the expiry alarm (the other starved boundary) needs. On-paper reasoning even suggests it passes the perfect-duplicate entrance exam where the old instrument failed. That claim now has to survive contact with real data: the entrance-exam harness is the next slice.

Preflight (A0): 2026-07-03 23:18 UTC โ€” load1 3.15/32c ยท CH + sidecar active โ†’ ALL PASS. Rebased onto moved main (22 commits, clean). Scrape via firecrawl (one transient failure, retry OK). Zero ClickHouse; zero synthetic data.

Extraction highlights (arXiv 2310.01153 v5)

PropertyWhy it matters here
E-values against group invariance, arbitrary test statistics, Monte Carlo over the groupEnvironment-permutation invariance = finite group โ†’ permutations of REAL rows (03c-compliant by construction)
No residual-variance division anywhereThe causalicp killer (zero-residual degeneracy) cannot occur; under the ground-truth duplicate the true subset should read eโ‰ˆ1 (accepted) while wrong subsets accumulate evidence
E-processes / test martingales, arbitrary filtrationsVille-bounded sequential monitoring โ€” the Expiry boundary (Frontier #4 family) served by the same framework
M1 anchors(a) matched permutation null AND (b) anytime-valid error bound โ€” the strongest combination in the campaign's taxonomy

โ–ถ Next iteration

Iteration 20 ยท 2026-07-03 ยท candidate A extraction checkpoint (LEDGER row 26) ยท append-only