From 656fa6f498ad617d405333a6123cce34892583cc Mon Sep 17 00:00:00 2001 From: Claude Date: Mon, 12 Oct 2026 02:36:07 +0000 Subject: [PATCH 1/2] Research guide: current overview and item-by-item current labels Add a current research overview at the top of docs/RESEARCH_INDEX.md and replace stale descriptions throughout with each item's current label, primary sources and remaining obligations, as the owner asked (label every item and update it; no blanket historical framing). Covers checklist items 1-9 of main#307 6115669781: - Gaussian persistence: the D1 reading contract, the completed SIDE24 coefficient reviews, Theorem R's scoped reviews and its R+, R++ and cusp successors, the #329 adapter and the current periodic-H0 certificates. - RN counting: the #76 scoped reconciliation, the shrinking-pair and moving-cutoff collision successors, the D5 reconciliation and every-fixed-d lift, and the collision results (Math #160, #173) with the register state kept separate. - P15: the full-price nonauthor review and the overlap/tail successors. - Start with the task and Open work: current routes (#275, #307) and short current-state cells that point to the topic sections. Every result keeps its hypotheses, dimension, mark restrictions, review scope and author/reviewer provenance; graph states that differ from review records are disclosed. The Formalization (Layer 1) row is unchanged (owned by main#358). Navigation, not a status register; scientific effect NONE. Claim: main#307 6115922454. Co-Authored-By: Claude Opus 5.5 Claude-Session: https://claude.ai/code/session_01S16677s1SGeAJmN3QMz4ip --- docs/RESEARCH_INDEX.md | 150 +++++++++++++++++++++++++++-------------- 1 file changed, 99 insertions(+), 51 deletions(-) diff --git a/docs/RESEARCH_INDEX.md b/docs/RESEARCH_INDEX.md index 7297e5948..5eeac6a33 100644 --- a/docs/RESEARCH_INDEX.md +++ b/docs/RESEARCH_INDEX.md @@ -4,88 +4,136 @@ This is a reading map, not a theorem-acceptance register. Read the statement, hypotheses, proof, and latest source-bound review before using a result. Merging a candidate or passing its tests is not independent mathematical acceptance. +## Current research overview + +Checked on 12 October 2026 against main `8977619e86d2f395b8e4947cf9a5e34082cc2c2c` and Math- `79cb314d5b9f6b8b410bfd0df200414314f6b8c7`. Each item gives a current label and its primary sources; each result keeps its own hypotheses, dimension, mark restrictions and review scope, stated here or in the linked topic section. All authors and reviewers named in this guide are AI lanes on one shared project account, and no review named here carries organizational-independence credit. + +1. **Short-lifetime law for actual H0 bars: landed analytic sources.** [main #329](https://github.com/d6g8k5htny-coder/main/pull/329), merged 8 October, added the [regular-fold structural theorem](../experiments/universality/fold_structural_universality/PROOF.md), the [exact periodized Gaussian adapter](../experiments/universality/periodized_gaussian_h0/PROOF.md) and the [marked iid-copy process theorem](../experiments/universality/iid_short_bar_process/PROOF.md) (OpenAI/Codex; same-provider scoped PASS records). Subject to named classical imports, the adapter gives the expected density per volume `nu_bar(ell) ~ c_(d,L) ell^(-1/3)` of actual finite ordinary superlevel H0 bars at each fixed `d>=2` and `L>0`, with no rate, near remainder, lifetime window or digits; see [Gaussian persistence](#gaussian-persistence). + +2. **Selection failure, lower-order terms and witness counts: conditional sources with scoped reads.** [Gaussian persistence](#gaussian-persistence) covers the [planar A4.3 note](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/planar_compact_k_chain_20261006/A4_3/PROOF.md) on selection failure, [note C3](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/lifetime_two_thirds_chain_20261007/C3/PROOF.md) on an `ell^(2/3)` candidate-pair term and the [once-counted replacement bars](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/unique_replacement_bar_intensity_20261001/README.md); [RN counting](#rn-counting) covers [C6](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/c6_palm_route_20260929/PROOF.md), its [rare-cluster consequences](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/c6_rare_cluster_laws_20260929/PROOF.md) and the regional witness bounds. Each keeps its own torus, dimension, marks and imported interfaces. + +3. **Broader laws and higher homology: open proposals.** [#330](https://github.com/d6g8k5htny-coder/main/pull/330) admits a class of fixed stationary Gaussian spectral laws to the actual-bar law and the iid process; it is open, not a draft. [#331](https://github.com/d6g8k5htny-coder/main/pull/331) (Hp bars from regular folds), [#334](https://github.com/d6g8k5htny-coder/main/pull/334) (covariance-matched amplitude mixtures that can change the exponent) and [#336](https://github.com/d6g8k5htny-coder/main/pull/336) (a stationary quartic H0 law whose exponent depends on its sampling weight) are open drafts, stacked on #330 in that order. Each records an OpenAI/Codex author and same-provider reviews. None has landed; each keeps its own model, observable and limit regime. + +4. **Numerical evidence: certified finite components and exploratory runs.** The [periodic-H0 study](../experiments/periodic_h0/README.md) certifies specified finite polynomials and grids, its [confirmation readiness table](../experiments/periodic_h0/CONFIRMATION_READINESS.md) keeps the coefficient comparison open, and the [fifty-law universality suite](../experiments/universality/README.md) is exploratory. See [Gaussian persistence](#gaussian-persistence). + +5. **P15 combinatorics: restricted theorem with a scoped nonauthor review.** [Theorem F](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/full_price_20260924/PROOF.md) (author OpenAI) holds on its realized disjoint-block family with demands `d_i>=2`, for every independent probability vector, under its price and palette hypotheses; an xAI Grok 4.7 [nonauthor review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_full_price_nonauthor_20260926/REVIEW.md) accepts it at exactly that scope. Arbitrary downsets and an unrestricted P15 result are outside it; see [P15 combinatorics](#p15-combinatorics). + +6. **Formal verification: Lean statements with kernel checks, alignment separate.** The [cap-first-exit packet](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/cap_first_exit_lean_20261002/README.md) (author Anthropic Claude) has 152 Lean targets in its [manifest](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/cap_first_exit_lean_20261002/MANIFEST.json). They formalize the deterministic cap step of D1 component III (CAP §§2–5, as steps L1–L13 and L16–L22), which identifies `S` as the global elder partner of `M` on the good event; a green run is kernel evidence for those Lean statements only. Outside it: whether the field satisfies the source setting, the reading of source coordinates as Lean objects, persistence-module bookkeeping, steps L14, L15 and L23, P §8, and every probabilistic statement. The manifest claims neither an alignment review nor mathematical acceptance; [ALIGNMENT.md](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/cap_first_exit_lean_20261002/ALIGNMENT.md) records the earlier scoped read of the v1.4 statements and what a non-Claude review must cover. Main's own formal layer is under [Open work](#open-work). + +The [public-text catalog](PUBLIC_MATHEMATICS.md) counts 2,138 files at its declared source commits: a file count, not a count of distinct theorems. + ## Start with the task | Task | Destination | |---|---| | Read or extend mathematics | The topic sections below and [Math-](https://github.com/d6g8k5htny-coder/Math-) | | Run a calculation | [Reproduction guide](REPRODUCE.md) | -| Review or claim work | [Current tasks and claims, main #275](https://github.com/d6g8k5htny-coder/main/issues/275) and the relevant issue or PR; [Open work](#open-work) records the closed September discussions | +| Review or claim work | [Task queue and claims, main #275](https://github.com/d6g8k5htny-coder/main/issues/275), the [Agent Message Board, main #307](https://github.com/d6g8k5htny-coder/main/issues/307), and the relevant issue or PR; [Open work](#open-work) gives each front's current records and remaining obligations | | Locate exact source bytes | [Catalog](https://github.com/d6g8k5htny-coder/meta-framework/blob/main/registry.json) and [query tool](https://github.com/d6g8k5htny-coder/query-) | -| Work on the larger numerical tree | [Hardening branch](https://github.com/d6g8k5htny-coder/main/tree/chatgpt/drive-github-hardening-20260919) (last merge 27 September 2026), not this default-home checkout; current main-side numerical experiments are in [`experiments/periodic_h0/`](../experiments/periodic_h0/README.md) | +| Work on the larger numerical tree | [Hardening branch](https://github.com/d6g8k5htny-coder/main/tree/chatgpt/drive-github-hardening-20260919), which holds the earlier research software and evidence (last merge 27 September 2026, `a01c72f1`), not this default-home checkout. Numerical work on `main` is in [`experiments/periodic_h0/`](../experiments/periodic_h0/README.md) and [`experiments/universality/`](../experiments/universality/README.md) | ## Gaussian persistence -Start with the [short-lifetime manuscript draft](research-translation/20260930/MANUSCRIPT.md), its [statement-to-source crosswalk](research-translation/20260930/CROSSWALK.md), or the [first numerical result and figure](../experiments/periodic_h0/results/pilot32/RESULTS.md). The [coupled refinement through 1024²](../experiments/periodic_h0/results/refinement8/RESULTS.md) and [deterministic approximation note](../experiments/periodic_h0/APPROXIMATION.md) sharpen the numerical diagnosis while leaving coefficient confirmation open. The [source-bound appendices](research-translation/20260930/APPENDICES.md) and [literature comparison](research-translation/20260930/LITERATURE.md) give a deeper reading path. The [dated research synthesis](research-translation/20260930/README.md) corrects stale gap descriptions without changing scientific status. Older topic entries below describe their individual packets; the dated synthesis distinguishes later scoped successors from those historical boundaries. +Start with the [short-lifetime manuscript draft](research-translation/20260930/MANUSCRIPT.md), its [statement-to-source crosswalk](research-translation/20260930/CROSSWALK.md), or the [first numerical result and figure](../experiments/periodic_h0/results/pilot32/RESULTS.md). The [coupled refinement through 1024²](../experiments/periodic_h0/results/refinement8/RESULTS.md) and [deterministic approximation note](../experiments/periodic_h0/APPROXIMATION.md) sharpen the numerical diagnosis while leaving coefficient confirmation open. The [source-bound appendices](research-translation/20260930/APPENDICES.md) and [literature comparison](research-translation/20260930/LITERATURE.md) give a deeper reading path. The [30 September research synthesis](research-translation/20260930/README.md) corrects stale gap descriptions without changing scientific status, and the [1 October completion audit](research-translation/20260930/COMPLETION_AUDIT.md) maps the planar manuscript's actual proof dependencies. Each row below names its source, its recorded reviews and its limits; later successors follow the table. | Reading order | Source | Scope and review | |---|---|---| -| 1. Geometry | [Marked-cylinder proof](https://github.com/d6g8k5htny-coder/Math-/blob/main/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md) | Deterministic sufficient criterion; not itself a Gaussian probability estimate | -| 2. Conditional field and leading law | [Matrix-cap and lifetime proof](https://github.com/d6g8k5htny-coder/Math-/blob/main/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md) | Exact periodized model; [review #63](https://github.com/d6g8k5htny-coder/main/issues/63) | -| 3. Coefficient | [SIDE24 dimensions 2 and 3](https://github.com/d6g8k5htny-coder/Math-/blob/main/coefficients/side24_v1/PROOF.md) | Evaluates the parent formula, without accepting that parent; [review #65](https://github.com/d6g8k5htny-coder/main/issues/65) | -| 4. Quantitative error | [Bounded unrestricted remainder](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md) | Author-side O(1) remainder; [review #67](https://github.com/d6g8k5htny-coder/main/issues/67) | - -Keep the dimension, full determinant normalizer, mark restrictions and finite-versus-essential-bar convention attached to each result. Numerical constants and a useful lifetime range for the remainder are not supplied by a qualitative O(1) statement. The linked full proof texts are public on GitHub; original Drive provenance is retained with their imports. - -For the numerical study, an [exact finite-polynomial derivative certificate](../experiments/periodic_h0/FINITE_CERTIFICATE.md) -now evaluates a spatial interpolation budget for eight recorded Fourier fields. -A [new one-field nodal certificate](../experiments/periodic_h0/NODAL_CERTIFICATE.md) -supplies an error bound for every newly recorded node and the associated abstract -filtration. A [sharper Hessian/grid bound](../experiments/periodic_h0/HESSIAN_GRID.md) -now covers a separate 1024² grid of deterministically regenerated dyadic samples. -An [exact integer H0 computation](../experiments/periodic_h0/EXACT_H0.md) now supplies -barcode endpoints and deterministic bin-count bounds for that one frozen finite field, -checked by a separate connectivity method. Historical FFT samples, the infinite-field -relation and the asymptotic remainder remain separate requirements before -interpreting the study as coefficient confirmation. +| 1. Geometry | [Marked-cylinder proof](https://github.com/d6g8k5htny-coder/Math-/blob/main/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md) | Deterministic sufficient criterion; not itself a Gaussian probability estimate. Its §§1–5 are a component of the D1 reading contract, with xAI and Anthropic nonauthor reviews recorded in the reconciliation | +| 2. Conditional field and leading law | [Matrix-cap and lifetime proof](https://github.com/d6g8k5htny-coder/Math-/blob/main/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md) | Exact periodized model, fixed d ≥ 2 and L > 0. Read it with the [repaired D1 reading contract](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md): congruence erratum, Section 9 replacement, wording W1 and embedding radius `r < L/(4√2)`. The reconciliation ([Math- #126](https://github.com/d6g8k5htny-coder/Math-/pull/126)) binds, for every interface, a full-depth ACCEPT from at least one nonauthor provider (xAI/Grok or Anthropic/Claude) and records Theorems A–C as accepted at existential scope. Its Anthropic Claude author also wrote its reviews C1 and C2, the only full-depth ACCEPTs for A1–A5, A7, §11 and §12 (disclosed in its §8). Theorems A and B keep their compact birth and positive-gap marks; Theorem C gives only the unrestricted leading term. [Issue #63](https://github.com/d6g8k5htny-coder/main/issues/63) is the closed review discussion | +| 3. Coefficient | [SIDE24 dimensions 2 and 3](https://github.com/d6g8k5htny-coder/Math-/blob/main/coefficients/side24_v1/PROOF.md) | Evaluates the parent formula (15.2) for the variance-one SIDE24 covariance, without accepting that parent. The arithmetic enclosure has two completed scoped reviews: xAI on [issue #65](https://github.com/d6g8k5htny-coder/main/issues/65), now closed, and the Anthropic [SIDE24 review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/side24_v1_coefficient_claude_20260929/REVIEW.md), ACCEPT at enclosure scope. Reading it as Theorem C's leading coefficient rests on the D1 chain at that chain's scope; no finite-lifetime error band follows. A later Anthropic Claude author-side packet gives [outward enclosures of the `d = 2` coefficient](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/side24_d2_certified_small_L_claude_20261005/NOTE.md) at six periods from `L = 2` to `L = 24`; it imports (15.2) without reviewing it | +| 4. Quantitative error | [Bounded unrestricted remainder](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md) | Theorem R: a leading `c ℓ^(-1/3)` term with an existential O(1) remainder for candidate and elder densities. Scoped source-bound reviews of R1–R6: xAI on [issue #67](https://github.com/d6g8k5htny-coder/main/issues/67), now closed, and the Anthropic [full-depth D2 review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d2_remainder_full_depth_claude_20260930/REVIEW.md), ACCEPT at Theorem R's stated scope. Theorem R itself gives no numerical constant, lifetime cutoff, remainder limit or rate | + +OpenAI authored all four sources; each review verdict above covers only the bytes and scope it names. At Math- `79cb314d` the [downstream graph](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/downstream_gate_20260925/GRAPH.json) still lists the D2 remainder and D3 coefficient nodes as `AUTHOR_SIDE_CANDIDATE`; the [Math- #167](https://github.com/d6g8k5htny-coder/Math-/pull/167) record proposes aligning them with main `STATUS.md`, and that step has not been executed. Keep the dimension, full determinant normalizer, mark restrictions and finite-versus-essential-bar convention attached to each result. Neither the qualitative O(1) statement nor its existential successors supply numerical constants or a useful lifetime range. The linked full proof texts are public on GitHub; original Drive provenance is retained with their imports. + +Successor source packets continue Theorem R. [R+](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remainder_vanishing_20260930/README.md) identifies the bounded remainder as the equal-height mass `B_{d,L}` for candidate pairs and `0` for elder pairs, up to `o(1)`. [R++](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remainder_rate_20260930/README.md) bounds the elder remainder by `O(ℓ^(1/4))` and depends on R+'s Lemma E. Both are Anthropic author-side packets for fixed d ≥ 2 and L > 0 with existential constants, landed through [Math- #191](https://github.com/d6g8k5htny-coder/Math-/pull/191) and [Math- #198](https://github.com/d6g8k5htny-coder/Math-/pull/198); their headers keep source-era "nonauthor review required" and "unmerged" wording. The R+ [4 October erratum](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remainder_vanishing_20260930/ERRATUM_20261004.md) answers second-provider Grok Bot slice reads of R+ (Slices A and B PASS; Slice C AMEND, which it applies): it corrects the status labels R+ gives its cited sources and adds the density-version qualifier to its statement. Read each packet with the review records on its pull request and, for R+, those slice reads; neither a header nor a merge is an acceptance label. The [second-order cusp packet](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/cusp_second_order_20261001/README.md), an Anthropic Claude author-side packet landed through [Math- #207](https://github.com/d6g8k5htny-coder/Math-/pull/207), continues the chain with its own dependencies. + +**Selection failure and lower-order terms: conditional sources; scoped slice reads.** The [planar A4.3 note](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/planar_compact_k_chain_20261006/A4_3/PROOF.md), an addendum in the planar compact-`K` chain (author Anthropic Claude; two xAI Grok 4.7 slice reads, both PASS, [record](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/planar_compact_k_chain_20261006/README.md)), gives `1 - p_r = r^3(alpha_1+alpha_2) + O_K(r^4 log(1/r)^4)` for selection failure and `C_fail ell^(2/3) + O(ell log(1/ell)^4)` for the rejected-candidate density, replacing A4.2's `r^(11/3) log(1/r)^(8/3)` endpoint where cited. Scope: fixed planar torus, compact birth and positive-gap marks, conditional on the planar chain it consumes; nothing as the gap interval approaches 0, and nothing for `d>=3`. [Note C3](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/lifetime_two_thirds_chain_20261007/C3/PROOF.md) (author Anthropic Claude; three xAI Grok 4.7 slice reads, all PASS, [record](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/lifetime_two_thirds_chain_20261007/README.md)) identifies the `c_3 ell^(2/3) + o(ell^(2/3))` term of the candidate-pair density for the torus field in every `d>=2`. The sign of `c_3` is proved for the Gaussian model, and for the torus field only when `L>=L_0(d)`, with `L_0(d)` not quantified; nothing is proved at `L=24`. Given C3, an `ell^(2/3)` term of the near elder density is equivalent to a form of [Conjecture 7](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/soft_rejected_pairs_20261002/PROOF.md), which stays open. + +**Rare replacement bars: landed conditional sources; scoped reads.** [Once-counted replacement bars](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/unique_replacement_bar_intensity_20261001/README.md) and their [occurrence law](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/replacement_bar_occurrence_20261001/README.md) concern a rare selected population of actual bars on the fixed planar torus: finite maxima with a rejected candidate saddle at distance between `c_0 h` and `C_0 h`, for fixed birth and positive-gap intervals. The expected count per unit area is `C_U h^5 + o(h^5)` and the occurrence probability `L^2 C_U(1) h^5 + o(h^5)`. Both are conditional OpenAI/Codex sources on seven retained imported interfaces (the occurrence law also on the count theorem), landed through [Math- #233](https://github.com/d6g8k5htny-coder/Math-/pull/233) and [Math- #234](https://github.com/d6g8k5htny-coder/Math-/pull/234). Each pull request records OpenAI same-provider PASS_TECHNICAL reviews and Anthropic Claude provider-distinct ACCEPTs, conditional on those imports; #234 also keeps an xAI/Grok scope note that votes NOT READY on the draft and states it is not a proof verdict; the #233 Slice C reviewer authored the D1 reconciliation that slice consumes. They are separate from the all-bar leading law. + +A separate route treats the same exact periodized law. [main #329](https://github.com/d6g8k5htny-coder/main/pull/329) landed three OpenAI/Codex sources, the [regular-fold structural theorem](../experiments/universality/fold_structural_universality/PROOF.md), the [periodized Gaussian H0 adapter](../experiments/universality/periodized_gaussian_h0/PROOF.md) and the [marked iid-copy process theorem](../experiments/universality/iid_short_bar_process/PROOF.md), each with a same-provider review record of scoped PASS verdicts (for example the adapter's [technical review record](../experiments/universality/periodized_gaussian_h0/REVIEW.md)). Subject to its named classical imports, the adapter derives the leading law `ν(ℓ) ~ c_(d,L) ℓ^(-1/3)` for the expected density per volume of actual finite ordinary superlevel H0 bars at each fixed d ≥ 2 and L > 0. It supplies no rate, O(1) near remainder, usable lifetime window or numerical digits. The process theorem is a Poisson limit for `n` independent whole copies of that fixed-torus field with `n t^(2/3)` tending to a positive constant; one field, same-field spatial limits and expanding domains are not covered. + +For the numerical study, [confirmation readiness](../experiments/periodic_h0/CONFIRMATION_READINESS.md) lists each input a coefficient comparison needs, its present evidence and what remains open. Each certificate covers only the object it names: an [exact finite-polynomial derivative certificate](../experiments/periodic_h0/FINITE_CERTIFICATE.md) evaluates a spatial interpolation budget for eight recorded Fourier fields; a [one-field nodal certificate](../experiments/periodic_h0/NODAL_CERTIFICATE.md) bounds every recorded node of one 128² snapshot and its abstract filtration; a [sharper Hessian/grid bound](../experiments/periodic_h0/HESSIAN_GRID.md) covers a separate 1024² grid of deterministically regenerated dyadic samples; and an [exact integer H0 computation](../experiments/periodic_h0/EXACT_H0.md) supplies barcode endpoints and deterministic bin-count bounds for that one frozen finite field, checked by a separate connectivity method. + +A [spectral tail bound](../experiments/periodic_h0/GAUSSIAN_TAIL.md) encloses the ideal field's omitted modes. A [finite-word coupling](../experiments/periodic_h0/GAUSSIAN_COUPLING.md) constructs a separate sampler under an explicit independent uniform-input model, and a [deterministic example](../experiments/periodic_h0/WORD_POLYNOMIAL.md) carries one such polynomial to exact barcode bounds. A [uniform finite-cutoff count bound](../experiments/periodic_h0/FINITE_COUNT_LOSS.md) and the [fixed-sample](../experiments/periodic_h0/COUNT_CONFIDENCE.md) and [mean-adaptive](../experiments/periodic_h0/MEAN_ADAPTIVE_CONFIDENCE.md) conditional sampling-error methods support planning a prospective sample; they report no observed confidence interval. + +The [exact-sample shrinking-bin lemma](../experiments/periodic_h0/EXACT_SAMPLE_SHRINKING_BIN.md) and its [spectral-sample extension](../experiments/periodic_h0/spectral_shrinking_bins/README.md), both for the planar torus of side 24, give conditions under which grid counts recover continuum counts in shrinking lifetime bins, in relative expectation, under inherited density hypotheses. Both are OpenAI/Codex results. Each has OpenAI/Codex and Anthropic Claude technical reviews recorded as `PASS_TECHNICAL_SCOPED`; the lemma's Anthropic review is [main #229 comment 5976979978](https://github.com/d6g8k5htny-coder/main/issues/229#issuecomment-5976979978). Certifying the stored pilot samples, coupling stored coefficients to the ideal field, a justified lifetime range, infinite-field count moments, a numerical remainder budget and a held-out design remain separate requirements before the study can be read as coefficient confirmation. The [fifty-law universality suite](../experiments/universality/README.md) is exploratory and has consumed no held-out seeds; its [protocol](../experiments/universality/PROTOCOL.md) lists the inputs a blinded confirmation needs. ## RN counting -Start with the [probability-to-count interface](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md). It supplies exact implications and counterexamples and identifies the three-determinant integral; it does not evaluate that integral. A remote critical point may exist despite correct local pairing. +Each label below records source and review state as read on 12 October 2026 (Math- `79cb314d`); a label does not change a scientific status. + +**Probability-to-count interface: landed source; scoped nonauthor review.** Start with the [probability-to-count interface](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md) (OpenAI/ChatGPT). It supplies exact implications and counterexamples and identifies the three-determinant integral; it does not evaluate that integral. A remote critical point may exist despite correct local pairing. An Anthropic Claude [nonauthor review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/register_alignment_20260930/RN_COUNT_INTERFACE_REVIEW.md), merged with the register-alignment record of [Math- #167](https://github.com/d6g8k5htny-coder/Math-/pull/167), accepts it at that logical-interface scope only. Its graph node `math.rn-count-interface` is still `AUTHOR_SIDE_CANDIDATE`; Math- #167 proposes that alignment too, unexecuted. + +**Fixed-remote theorem (D4): landed source; scoped review recorded on closed main #76.** Next read the [fixed-remote height-window estimate](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remote_window_20260924/PROOF.md) (OpenAI/ChatGPT), published in [Math- PR #6](https://github.com/d6g8k5htny-coder/Math-/pull/6). For each fixed d≥2 and L, compact birth and positive gap marks and all frames, it bounds the actual three-determinant numerator by O(r^5) and the expected count by O(r^3) for points in the between-pin height window on a region a FIXED positive distance from the coalescing pins. It identifies the positive contact mean kernel and fixed-separation higher-witness counts; that kernel has uncertified numerical evaluations in [`d = 2`](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/c6_remote_coefficient_numerics_20260930/README.md) and [`d = 3`](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/c6_remote_coefficient_d3_numerics_20260930/README.md) (Anthropic Claude notes). It does not cover a spatial exclusion shrinking with r, nearly coincident witnesses, all remote heights, or a numerical 24-jet certificate. + +The [review comment on main #76](https://github.com/d6g8k5htny-coder/main/issues/76#issuecomment-5841783172) accepts interfaces 1–5, interface 6 only for the stated §7 implication (no witness predicate or cell partition of the numerical RN certificate route is shown to imply the count), and interface 7 as the stated open complement. The [scoped reconciliation](https://github.com/d6g8k5htny-coder/main/issues/76#issuecomment-5841861362) closed [#76](https://github.com/d6g8k5htny-coder/main/issues/76) as that fixed-ρ/fixed-η review package only; it shrinks neither ρ nor η and closes no pin, intermediate or witness-collision region. The Cursor agent posted the review without a model line; the reconciliation attributes it to xAI/Grok. An Anthropic Claude [audit of that review lane](../reviews/grok_uploads_20260926/PART4_STATUS_D3_D4.md) found it sound on its listed scope, with minor findings. Row D4 of [main `STATUS.md`](../STATUS.md) (29 September snapshot) cites both comments. The Math- [downstream graph](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/downstream_gate_20260925/GRAPH.json) still classifies the theorem node `math.rn-fixed-remote-window` as `AUTHOR_SIDE_CANDIDATE`; the Math- #167 record proposes aligning it with main `STATUS.md`, and that step has not been executed. + +[Run the remote-window checks](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remote_window_20260924/README.md) from the Math repository; exact catalog key `rn-fixed-remote-window` locates the published source. Its 28 finite tests and seven semantic mutants exercise exact finite checks, not the continuum proof. The proof rederives the needed full-pin count estimates without consuming global elder selection. + +**Shrinking witness pairs in the fixed remote region: landed note; upper bound only.** The [shrinking witness-pair note](rn_d5_shrinking_witness_20260926.md#3-expected-count-bound), landed through [main #125](https://github.com/d6g8k5htny-coder/main/pull/125), keeps both points in that fixed remote region and lets their separation tend to zero. A divided-difference frame gives an expected ordered same-index count `O(k r^3)`, uniform in the shrinking separation: an upper bound only, since the true order of the shrinking-pair count is not established there. The fixed-η probability `O(r^6)` stays attached to separations bounded below independently of `r`, and pin neighborhoods, the intermediate annulus and elder pairing are untouched. The note's author is a Cursor agent whose commits carry the account owner's Co-authored-by trailer; the authoring model is not recorded. An [xAI/Grok nonauthor review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/pr125_shrinking_witness_nonauthor_20260926/REVIEW.md) of the pre-amendment text accepts the five interfaces of the bound and returns AMEND on its passage to the fixed-η bound; with the authoring model unavailable, it claims no provider separation. A separate Anthropic Claude [review comment on main #125](https://github.com/d6g8k5htny-coder/main/pull/125#issuecomment-5850462018) also returned AMEND, with four items, and is not a filed review record. An Anthropic Claude author-side edit applied those four items before the merge ([amendment record](https://github.com/d6g8k5htny-coder/main/pull/125#issuecomment-5858398355)); no review of the amended text is filed. -Next read the [fixed-remote height-window estimate](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/remote_window_20260924/PROOF.md), published in [Math- PR #6](https://github.com/d6g8k5htny-coder/Math-/pull/6), with [review #76](https://github.com/d6g8k5htny-coder/main/issues/76). This bounds the actual three-determinant numerator by O(r^5) and the expected count by O(r^3) for points in the between-pin height window on a region a FIXED positive distance from the coalescing pins. It identifies the positive contact mean kernel and fixed-separation higher-witness counts. It does not cover a spatial exclusion shrinking with r, nearly coincident witnesses, all remote heights, or a numerical 24-jet certificate. +**Fixed-remote collisions: landed source; scoped nonauthor reviews.** The [fixed-remote collision theorem](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remote_collision_20260928/PROOF.md) (Anthropic Claude, [Math- #110](https://github.com/d6g8k5htny-coder/Math-/pull/110)) keeps the second height indicator. With both witnesses in the fixed remote region, ordered window pairs at every separation below a fixed `η_0`, including the coincidence limit, have expected number `O(r^5)|E|`; the second factorial moment is also `O(r^5)|E|`, and the window-event probability is `k r^3 ∫_E Λ + O(r^4)|E|`. Nonauthor OpenAI/ChatGPT and xAI reads on #110, the [xAI/Grok ledger record](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_remote_collision_grok_20260928/REVIEW.md) ([Math- #113](https://github.com/d6g8k5htny-coder/Math-/pull/113)) and the [off-pin second-moment record](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_offpin_second_moment_20260928/REVIEW.md) accept their slices at that fixed-remote scope. The OpenAI read is source-exposed, since OpenAI authored the fixed-remote theorem it consumes. The off-pin record accepts `E N_η(N_η−1) ≤ C_η r^5` for window points at distance at least a fixed η from the pins and does not name its reviewer. The theorem gives no torus-wide second factorial moment, no pair with a witness near the pins or at intermediate scales, no all-height pair and no elder-selection statement. -[Run the remote-window checks](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/remote_window_20260924/README.md) from the Math repository; exact catalog key `rn-fixed-remote-window` locates the published source. The proof rederives the needed full-pin count estimates without consuming global elder selection. Its author-side disposition and the intermediate-annulus boundary remain explicit. +**Moving remote cutoff: landed conditional planar source; same-provider nonauthor review.** The [moving-cutoff collision packet](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/moving_remote_collision_20261003/README.md) (OpenAI Codex authors), landed through [Math- #248](https://github.com/d6g8k5htny-coder/Math-/pull/248), lets the remote radius ρ shrink with r. Conditional on its retained parent interfaces (the full normalizer, Gaussian conditioning and weighted Kac–Rice), it proves `E[N(E)(N(E)−1)] ≤ C r^5 ρ^(-98) |E|` for ordered pairs of window critical points of all indices. The scope is a fixed planar torus, compact births and compact positive gap marks, all frames, deterministic Borel `E` outside the ρ-ball, `0<ρ≤ρ_0` and `00, additional window critical points separated by `o(r)` carry only `o(r^3)` weighted mass, and that on compact positive gap marks their collision-marked lifetime density is `o(ℓ^(2/3))`. It keeps the original determinant weight and full normalizer, claims no rate and does not re-review its imported Gaussian sources. A same-provider OpenAI/Codex [nonauthor review](https://github.com/d6g8k5htny-coder/Math-/pull/245#pullrequestreview-5393892259) records PASS, scoped and conditional, for the new implication only. The corollary does not change the register node `math.rn-region.witness-collision`. -A newer fixed-annulus successor now has a source-bound nonauthor technical review at its exact limited scope: [fixed d=2 scaled-annulus height-window theorem](https://github.com/d6g8k5htny-coder/Math-/blob/760340e921ac4ceda296b8118da936f1133e956e/frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md) with [review record](https://github.com/d6g8k5htny-coder/Math-/blob/760340e921ac4ceda296b8118da936f1133e956e/reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md). It covers fixed L, a fixed scaled annulus in d=2, compact positive gap marks, all frames, and the between-pin height window. It does **not** close pin neighborhoods, intermediate physical scales, witness collisions, kappa→0, d>=3, global RN/JETMOD, or elder selection. +**Fixed annulus, pins, collar and intermediate scales (D5): landed sources; scoped nonauthor reviews.** The [fixed d=2 scaled-annulus height-window theorem](https://github.com/d6g8k5htny-coder/Math-/blob/760340e921ac4ceda296b8118da936f1133e956e/frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md) (OpenAI/ChatGPT) has a source-bound xAI/Grok nonauthor technical review at its exact limited scope ([review record](https://github.com/d6g8k5htny-coder/Math-/blob/760340e921ac4ceda296b8118da936f1133e956e/reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md)). It covers fixed L, a fixed scaled annulus in d=2, compact positive gap marks, all frames, and the between-pin height window. By itself it does **not** close pin neighborhoods, intermediate physical scales, witness collisions, gaps tending to zero, d≥3, global RN/JETMOD, or elder selection. Its graph node `math.rn-fixed-annulus-window` is still `AUTHOR_SIDE_CANDIDATE`; Math- #167 proposes that alignment too, unexecuted. -The [legacy RN status](https://github.com/d6g8k5htny-coder/main/blob/chatgpt/drive-github-hardening-20260919/docs/math_status/STATUS_RN_UNIF.md) and [execution guide](https://github.com/d6g8k5htny-coder/main/blob/chatgpt/drive-github-hardening-20260919/docs/RESEARCH_EXECUTION.md) describe a separate numerical route. Its missing historical carriers and 24-jet obligations are not discharged by a newer probability proof, and do not erase newer author-side candidates. +The [planar D5 reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_reconciliation_20260929/RECONCILIATION.md) (Anthropic Claude reconciler, [Math- #138](https://github.com/d6g8k5htny-coder/Math-/pull/138)) binds the reviewed planar components to exact bytes and their nonauthor verdicts: punctured pin disks, nested `κr^2` microdisks, the collar, the reviewed [all-height fixed annulus](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/rn_annulus_bridge_20260925/PROOF.md), window-only intermediate shells and the remote window. At d=2, on a fixed torus with compact birth marks, gaps `k ≥ k_- > 0`, all frames and indices, the pin-disk, collar and fixed-scaled-ball first moments are `O(r^3)` at all heights, and the microdisks are `O(r^5)`. The intermediate shells and the torus-wide first moment `E N(T^2∖{M,S}) ≤ C r^3` hold only for the between-pin height window. Constants are existential. [Math- #151](https://github.com/d6g8k5htny-coder/Math-/pull/151) executed the planar graph fold for the pin, scaled-annulus and intermediate region nodes at their stated planar scopes, and row D5 of main `STATUS.md` records the same planar scope. + +The [every-fixed-d packet](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/d5_dimension_lift_20260929/README.md) (Anthropic Claude, merged through [Math- #141](https://github.com/d6g8k5htny-coder/Math-/pull/141)) lifts these bounds to each fixed d≥2 as Theorems P_d, C_d, I_d and G_d, for a fixed torus, compact birth marks, gaps `k ≥ k_- > 0`, sufficiently small r, the original weight and full normalizer, and counts excluding M and S. The same height split holds: pin and collar bounds are all-height; intermediate and global bounds keep the between-pin window. The README's opening header is source-era candidate text; its later *Review requests* and *Landing note* sections record OpenAI nonauthor ACCEPTs of every held continuum row at that scope. Those reads are source-exposed, since the reviewer authored the planar inputs; xAI's planar continuum check is the provider-distinct base, and xAI's finite-algebra checks are credited separately. An additive [erratum](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_dimension_lift_erratum_20261005/ERRATUM.md) ([Math- #308](https://github.com/d6g8k5htny-coder/Math-/pull/308)) corrects one intermediate display and its citation; no theorem changes. This packet is not folded into the planar graph nodes. Neither D5 route supplies numerical constants, uniformity in k, L or d, a numerical RN/24-jet certificate, or an elder-selection conclusion. + +**Torus-wide witness collisions: reviewed source results available; register reconciliation and execution remain separate.** The [C6 witness-collision reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/c6_witness_collision_reconciliation_20260929/RECONCILIATION.md) (Anthropic Claude reconciler, merged through [Math- #160](https://github.com/d6g8k5htny-coder/Math-/pull/160)) records a count-level discharge. The [Palm-route Theorem Q](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/c6_palm_route_20260929/README.md) (Anthropic Claude, [Math- #145](https://github.com/d6g8k5htny-coder/Math-/pull/145); source-exposed OpenAI nonauthor ACCEPT) gives `E[(N)_q] ≤ C_q r^3` for every fixed q≥2 and, with the reviewed every-d lower bound (A4), `c r^3 ≤ E N(N−1) ≤ C r^3`. N counts every window critical point other than M and S, so pairs at every separation and distance from the pins are included; for a subregion it gives an upper bound only. Scope: every fixed d≥2, a fixed torus, compact marks with `k_- > 0`, all frames and indices, the between-pin window, the original weight and full normalizer, and existential constants. Its [rare-cluster consequences](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/c6_rare_cluster_laws_20260929/PROOF.md) rule out an `o(r^3)` ordinary-Poisson approximation of that count and give an `O(r^6)` compound-Poisson representation, not an explicit limiting cluster law, at fixed `d`, `L` and compact positive gap marks (author OpenAI; [scoped ACCEPT](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md) by an Anthropic Claude slice whose reviewer authored the consumed C6 and D5 sources, and by an xAI Grok slice). The [leading-mass localization record](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/c6_residual_closure_20260930/RECONCILIATION.md) ([Math- #173](https://github.com/d6g8k5htny-coder/Math-/pull/173), same reconciler) adds, at that scope and conditional on its pinned sources, that the leading `r^3` mass of `E N(N−1)` lies, in the iterated limit, on pairs within `Rr` of the midpoint; it gives no rate, constant, all-height or elder statement. OpenAI nonauthor reads accept the stated sections of both records; xAI reads of #160 agree with its discharge scope and hold execution. Both records are declarative and leave register execution to a non-Claude lane. At Math- `79cb314d` the downstream graph still lists `math.rn-region.witness-collision` as `OPEN_ACTIVE`, and the [Math- proof index](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/PROOF_INDEX.md) states that the global `Θ(r^3)` result is not a proof of that node; row C6 of main `STATUS.md` states that the Palm route is not accepted there. This guide moves neither. + +**Numerical RN certificate route (D3-LEMMA-RN-UNIF): separate; open.** The [RN-UNIF status](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/docs/math_status/STATUS_RN_UNIF.md) (dated 22–25 September), the [24-jet status](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/docs/math_status/STATUS_JETMOD.md) and the [execution guide](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/docs/RESEARCH_EXECUTION.md) on the hardening branch describe the separate numerical certificate route. Its three named carriers (`rnu_env.py`, `CL_ANTHROPIC_BUNDLE_2026-09-17_v5.zip` and `allcell_fdz_enclosures.json`) remain absent, `certified_C_H` is false, and its ordered predicates from ENV-RESCOV through ALLCELL-FDZ-Q4, LOGQ-TAIL and SYM-Fw-jet to CH-LIFT, the Piece-2 annulus and OBL-H5-JETMOD remain open in the Math- downstream graph. The newer analytic results do not discharge those carriers or the 24-jet obligations; for the reviewed fixed-annulus window scope only, the graph records the analytic route as bypassing CH-LIFT, Piece 2 and OBL-H5-JETMOD. Those open numerical obligations do not erase the newer analytic sources and their reviews. ## P15 combinatorics -| Reading order | Source | Distinction | +P15 is a combinatorics track, separate from the Gaussian-field work ([scope note](P15_SPLIT.md)). OpenAI / ChatGPT authored every source below. Each row keeps its own family, demand, probability and palette hypotheses. + +| Reading order | Source | Distinction and review | |---|---|---| -| Local-to-global interface | [Original P15-B](https://github.com/d6g8k5htny-coder/main/blob/7caac254cbba5f513b2dc0afb56b78a598bc0c93/drive/mirrors/2026-09-16%20%E2%80%94%20PRIZE%20PROBLEM%20RECONNAISSANCE%20%E2%80%94%20INDEPENDENT%20TRACK/06_TALAGRAND_DISCRETE%20%E2%80%94%20RESTRICTED_PROOF_CANDIDATES/P15-B_PALETTE_SEPARATED_LOCALIZATION.md) | Actual restrictions, complete crossing witnesses, and compatible local budgets | -| Palette optimization | [Matroid specialization #59](https://github.com/d6g8k5htny-coder/main/issues/59) | Requires its structural hypotheses | -| Actual-coordinate family | [Realized covers](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md) | Specified cover threshold 816; whole ground set needs 818 | -| Failed extension | [Price-boundary counterexample](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md) | Same-palette unrestricted transformed-price extension without extra hypotheses is false | -| Restricted positive successor | [Transformed-price budget](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/price_budget_20260924/PROOF.md) | Demands at least 2, probabilities at most 1/4; [Math- PR #4](https://github.com/d6g8k5htny-coder/Math-/pull/4) | -| Full probability-range successor | [Sharp full-price budget](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/full_price_20260924/PROOF.md) | All independent probabilities, demands at least 2, same realized family and palette; [review #74](https://github.com/d6g8k5htny-coder/main/issues/74) | +| Local-to-global interface | [Original P15-B](https://github.com/d6g8k5htny-coder/main/blob/7caac254cbba5f513b2dc0afb56b78a598bc0c93/drive/mirrors/2026-09-16%20%E2%80%94%20PRIZE%20PROBLEM%20RECONNAISSANCE%20%E2%80%94%20INDEPENDENT%20TRACK/06_TALAGRAND_DISCRETE%20%E2%80%94%20RESTRICTED_PROOF_CANDIDATES/P15-B_PALETTE_SEPARATED_LOCALIZATION.md) | Actual restrictions, complete crossing witnesses, and compatible local budgets. An [18 September technical review](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/reviews/records/REV-P15-B.md) by a Claude session records PASS_TECHNICAL for the text as written, with independence credit 0; the hazard bound stays conditional on the imported P14-A local budget, which that review did not check | +| Palette optimization | [Matroid specialization #59](https://github.com/d6g8k5htny-coder/main/issues/59) | Requires its structural hypotheses: the independent sets of the crossing-support hypergraph form a loopless matroid, and Edmonds' partition theorem is reused with attribution. Closed 25 September as a completed author-side delivery; closing it created no independent acceptance | +| Actual-coordinate family | [Realized covers](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md) | Specified cover threshold 816; whole ground set needs 818. Landed in [Math- PR #3](https://github.com/d6g8k5htny-coder/Math-/pull/3). The full-price review checked its family definition, local restrictions and full-block cover as a dependency, not its `c_v<=p_v` price theorem | +| Failed extension | [Price-boundary counterexample](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md) | Same-palette unrestricted transformed-price extension without extra hypotheses is false. Exact two-coordinate, demand-one counterexample; [Math- PR #3](https://github.com/d6g8k5htny-coder/Math-/pull/3) | +| Restricted positive successor | [Transformed-price budget](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/price_budget_20260924/PROOF.md) | Demands at least 2, probabilities at most 1/4, factor 16/27; [Math- PR #4](https://github.com/d6g8k5htny-coder/Math-/pull/4). The [claim manifest](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/claims/LANDING_CLAIMS.json) binds no nonauthor theorem review to it | +| Full probability-range successor | [Sharp full-price budget](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/full_price_20260924/PROOF.md) | All independent probabilities, demands at least 2, prices `c_v <= phi(p_v)`, same realized family and palette `K >= K_H(d)`; [Math- PR #5](https://github.com/d6g8k5htny-coder/Math-/pull/5). The [complete nonauthor scoped review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_full_price_nonauthor_20260926/REVIEW.md) by xAI Grok, landed in [Math- PR #63](https://github.com/d6g8k5htny-coder/Math-/pull/63), accepts all six slices of Theorem F at exactly this scope; organizational independence is not awarded. [Review #74](https://github.com/d6g8k5htny-coder/main/issues/74) closed on 26 September | +| Shared coordinates, bipartite class | [Bipartite overlap source](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/README.md) | Blocks may overlap when their intersection graph is bipartite; arbitrary capacities, no macro-clutter; palette K = max d_i >= 4, with inactive smaller demands allowed; factor 2/[5-log(5e-4)]<3/4. [Math- PR #118](https://github.com/d6g8k5htny-coder/Math-/pull/118) | +| Shared coordinates, even read-two class | [Even-capacity extension](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md) | Every coordinate in at most two blocks and every capacity even, bipartite or not; same palette K and full-block cover; factor 2/log(512/25)<2/3. [Math- PR #118](https://github.com/d6g8k5htny-coder/Math-/pull/118) | +| Sharper even read-two factor | [Tail and weighted-load source](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md) | Same even read-two class and palette; factor 2/[9-log(36e^2-63e+28)]<1/2; a weighted coordinate-load bound applies once a genuine cover is proved. [Math- PR #122](https://github.com/d6g8k5htny-coder/Math-/pull/122) | + +The full-range successor removes the probability ceiling, not the demand or realized-family hypotheses. Its sharp uniform factor is 1/[3-log(3e-2)]<6/7. Here `3e-2` means `3*e-2` and `5e-4` means `5*e-4`, with e Euler's number ([notation note](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/full_price_20260924/ASCII_3E_MINUS_2.md)). The earlier 16/27 factor remains better on its smaller domain, and demand-one counterexamples remain valid. An inconclusive sufficient-budget test is not an impossibility proof. + +The shared-coordinate packets drop the disjoint-block and macro-clutter structure. Their factors concern different classes and are not improvements on Theorem F's constant; the sources and review assert no comparison. Demand-one blocks are allowed there only as inactive blocks under K >= 4, which does not restore a demand-one budget. Keep the bipartite arbitrary-capacity class and the even-capacity read-two class distinct. In the sources, the sub-2/3 and sub-1/2 factors need every capacity even, and a capacity-one triangle shows that read-two incidence alone is not enough. No factor in these packets is claimed optimal as a cover factor; the nine-coordinate tail is sharp only as a reference tail. + +A [complete scoped review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md) by an Anthropic Claude session records ACCEPT on every listed interface of both packets and found no defect. The reviewer's provider differs from the OpenAI author's, but all lanes share one project account, so organizational-independence credit is 0. An earlier [OpenAI same-provider read](https://github.com/d6g8k5htny-coder/Math-/pull/118#pullrequestreview-5344833684) of the bipartite packet found no blocker. The review's remark R1, extending the sub-1/2 factor to bipartite instances whose active blocks all have capacity at least 2, is the reviewer's result; it was not inserted into either source proof. Sources (Math- #118, #122) and review (Math- #123) landed together through [Math- PR #124](https://github.com/d6g8k5htny-coder/Math-/pull/124) with its [integration record](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/docs/integration/2026-09-28-reviewed-mathematics.md). Neither packet supplies arbitrary downsets or an unrestricted prize result. -The full-range successor removes the probability ceiling, not the demand or realized-family hypotheses. Its sharp uniform factor is 1/[3-log(3e-2)]<6/7. The earlier 16/27 factor remains better on its smaller domain, and demand-one counterexamples remain valid. An inconclusive sufficient-budget test is not an impossibility proof. Newer entries belong in this map only after their actual publication is verified. +Still open: arbitrary downsets and the unrestricted prize; overlap patterns outside these two classes; optimal cover factors for the overlap classes; and a source-bound nonauthor theorem review of the 16/27 theorem, which the claim manifest holds as `HOLD_WITH_DOMAIN`. At Math- `79cb314d` the downstream graph still lists `math.p15-full-price` as `AUTHOR_SIDE_CANDIDATE` ("review open"); the Math- #167 record proposes aligning it with main `STATUS.md` row D6, and that step has not been executed. Entries are listed after their publication is verified; this section was checked at Math- `79cb314d`. Lean work on Theorem F in open draft Math- pull requests is not listed here; its formal target is under [Open work](#open-work). ## Open work -> **As of 7 October 2026:** the discussions linked in this table (#63, #65, #67, #74, #76), the downstream-first queue #86 and formal work item #95 are closed. Closing a discussion does not resolve its obligation; the rows below keep the September task descriptions. Current tasks and claims are on [main #275](https://github.com/d6g8k5htny-coder/main/issues/275); from 8 October 2026, new general coordination goes to the [active board #307](https://github.com/d6g8k5htny-coder/main/issues/307), with the [historical #229 working guidance](https://github.com/d6g8k5htny-coder/main/issues/229#issuecomment-6038554880) retained. +Each row gives a front's current label and what remains open; the topic sections hold scopes and review details. Claim tasks on [main #275](https://github.com/d6g8k5htny-coder/main/issues/275) and coordinate on the [Agent Message Board, main #307](https://github.com/d6g8k5htny-coder/main/issues/307); the earlier board [#229](https://github.com/d6g8k5htny-coder/main/issues/229) keeps its [working guidance](https://github.com/d6g8k5htny-coder/main/issues/229#issuecomment-6038554880). The review discussions #63, #65, #67, #74 and #76, the downstream-first queue [#86](https://github.com/d6g8k5htny-coder/main/issues/86) and formal work item [#95](https://github.com/d6g8k5htny-coder/main/issues/95) are closed records, not open assignments; a closed issue does not by itself complete its mathematics. A review record does not by itself change the Math- [register](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/downstream_gate_20260925/GRAPH.json), which is executed separately and may still show an earlier classification. -| Front | Concrete task | Discussion | +| Front | Current state and remaining work | Records | |---|---|---| -| Gaussian foundations | Review marked Kac–Rice, global elder selection and matrix regression | [#63](https://github.com/d6g8k5htny-coder/main/issues/63) | -| Quantitative Gaussian work | Evaluate usable error constants and lifetime cutoff | [#67](https://github.com/d6g8k5htny-coder/main/issues/67) | -| Coefficient | Review cone truncation, normalized images and outward arithmetic | [#65](https://github.com/d6g8k5htny-coder/main/issues/65) | -| RN / 24-jet | Bound the actual count-weighted integral on its complete declared region | [#67](https://github.com/d6g8k5htny-coder/main/issues/67) | -| RN fixed-remote successor | Review the extra-pin count proof, evaluate its kernel, and control the remaining shrinking-exclusion/collision regions | [#76](https://github.com/d6g8k5htny-coder/main/issues/76) | -| RN shrinking witness pairs | Divided-difference `m=2` upper bound at fixed distance from the pins; sharp order and kernel still open | [Note](rn_d5_shrinking_witness_20260926.md) | -| P15 | Review full-range hazard transfer and sharpness; extend beyond the realized-family hypotheses | [#74](https://github.com/d6g8k5htny-coder/main/issues/74), [#67](https://github.com/d6g8k5htny-coder/main/issues/67) | +| Gaussian foundations | Parent theorem (matrix regression, global elder selection, marked Kac–Rice; OpenAI author): Theorems A–C read at existential scope through the D1 reconciliation, whose Anthropic/Claude reconciler also wrote its reviews C1 and C2 (see [Gaussian persistence](#gaussian-persistence)). The planar compact-`K` refinements of Theorem A are a separate conditional chain. Open: numerical constants, any difference rate outside compact marks, and the second-provider checks the reconciliation's §8 invites | [D1 reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md), [planar compact-`K` chain](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/planar_compact_k_chain_20261006/README.md), [#63](https://github.com/d6g8k5htny-coder/main/issues/63) (closed review discussion) | +| Quantitative Gaussian work | Theorem R's existential `O(1)` remainder: scoped ACCEPTs; R+ and R++: landed Anthropic/Claude author-side packets (see [Gaussian persistence](#gaussian-persistence)). Open: usable error constants and a lifetime cutoff | [D2 review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d2_remainder_full_depth_claude_20260930/REVIEW.md), [R+](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remainder_vanishing_20260930/README.md), [R++](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remainder_rate_20260930/README.md), [confirmation readiness](../experiments/periodic_h0/CONFIRMATION_READINESS.md), [#67](https://github.com/d6g8k5htny-coder/main/issues/67) (closed review discussion) | +| Coefficient | SIDE24 `d = 2, 3` enclosure: scoped ACCEPTs at arithmetic-enclosure scope; small-period `d = 2` enclosures in a later packet (see [Gaussian persistence](#gaussian-persistence)). Open: a finite-lifetime error band and certified continuum numerical confirmation | [SIDE24 review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/side24_v1_coefficient_claude_20260929/REVIEW.md), [small-period enclosures](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/side24_d2_certified_small_L_claude_20261005/NOTE.md), [#65](https://github.com/d6g8k5htny-coder/main/issues/65) (closed review discussion) | +| RN / 24-jet | Numerical RN certificate route (`D3-LEMMA-RN-UNIF`, `OBL-H5-JETMOD`): open, with its carriers absent (see [RN counting](#rn-counting)). Open: certified interval bounds for the full 24-jet set over its `r`-bands, and a bound on the actual count-weighted integral over its complete declared region | [RN-UNIF status](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/docs/math_status/STATUS_RN_UNIF.md), [24-jet status](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/docs/math_status/STATUS_JETMOD.md), [execution guide](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/docs/RESEARCH_EXECUTION.md), [#67](https://github.com/d6g8k5htny-coder/main/issues/67) (closed discussion) | +| RN fixed-remote successor | Reviewed at fixed ρ, fixed η (closed #76); planar and every-fixed-`d` successors reconciled (see [RN counting](#rn-counting)). Open: numerical constants, a certified kernel evaluation, all remote heights in the global count, and the collision rows below | [#76 reconciliation](https://github.com/d6g8k5htny-coder/main/issues/76#issuecomment-5841861362), [D5 reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_reconciliation_20260929/RECONCILIATION.md), [every-fixed-`d` packet](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/d5_dimension_lift_20260929/README.md), [planar kernel numerics](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/c6_remote_coefficient_numerics_20260930/README.md) | +| RN shrinking witness pairs | Separate results, each at its own scope: the September note (upper bound only), remote-collision Theorem C, the planar moving cutoff and the sub-pin corollary (see [RN counting](#rn-counting)). Open: mixed inner/outer pairs, an exact kernel, small-gap uniformity and higher dimensions for the moving cutoff | [Note](rn_d5_shrinking_witness_20260926.md), [remote collision](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remote_collision_20260928/PROOF.md), [off-pin review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_offpin_second_moment_20260928/REVIEW.md), [moving cutoff](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/moving_remote_collision_20261003/README.md), [sub-pin corollary](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/subpin_collision_20261002/README.md) | +| RN collision register | [Math- #160](https://github.com/d6g8k5htny-coder/Math-/pull/160) and [Math- #173](https://github.com/d6g8k5htny-coder/Math-/pull/173): merged, reviewed and declarative; neither has been executed, so `math.rn-region.witness-collision` stays `OPEN_ACTIVE` (see [RN counting](#rn-counting)). Open: execution of both records by a non-Claude lane, and the regional shrinking pin/witness-collision mechanism the register still names | [C6 reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/c6_witness_collision_reconciliation_20260929/RECONCILIATION.md), [residual closure](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/c6_residual_closure_20260930/RECONCILIATION.md) | +| P15 | Theorem F, the full-range price theorem (OpenAI author), has an xAI/Grok nonauthor ACCEPT, reconciled on #74 for the realized disjoint family with demands `d_i >= 2`, every independent probability, `c_v <= phi(p_v)` and the same palette. The bipartite-overlap/even-capacity and tail/weighted-load successors (OpenAI authors) have an Anthropic/Claude scoped ACCEPT and landed through [Math- #124](https://github.com/d6g8k5htny-coder/Math-/pull/124). Open: arbitrary downsets and any unrestricted prize statement; demand one remains an obstruction | [Full-price review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_full_price_nonauthor_20260926/REVIEW.md), [overlap/tail review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md), [integration record](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/docs/integration/2026-09-28-reviewed-mathematics.md), [#74](https://github.com/d6g8k5htny-coder/main/issues/74), [#67](https://github.com/d6g8k5htny-coder/main/issues/67) (closed review discussions) | | Formalization (Layer 1) | Independent alignment review of the 13 Math- pilot targets and the 31 main-side SIDE24 targets (cross-provider); the remaining "Numerical formalizer" steps — exact `c_{d,ref}` definition and a proof-producing enclosure — in the Mathlib package; D6 Theorem F's constant `ρ*` as the next full-theorem target | [Guide](FORMAL_VERIFICATION.md), [work item #95](https://github.com/d6g8k5htny-coder/main/issues/95), [Formal README](../formal/README.md), [review lane](../formal/REVIEW_LANE.md), [rollout record](FORMAL_VERIFICATION_ROLLOUT_20260927.md) | -Check current claims before writing and release completed work. Offered reviews are not accepted tasks or evidence of active agents. This table is a route to current discussions, not a duplicate status database. +Check current claims on #275 and #307 before writing, and release completed work. Offered reviews are not accepted tasks or evidence of active agents. This table routes to source and review records; it is not a status register. -The [discovery / priority ledger](DISCOVERY_PRIORITY_LEDGER_20260925.md) and its [reconnaissance memo](RECON_NOVELTY_20260925.md) record candidate contributions, nearest prior art and source bindings. They are novelty bookkeeping, not status; "apparently novel" is not "accepted". +The [discovery / priority ledger](DISCOVERY_PRIORITY_LEDGER_20260925.md) and its [reconnaissance memo](RECON_NOVELTY_20260925.md) record candidate contributions, nearest prior art and source bindings. They are novelty bookkeeping, not status; "apparently novel" is not "accepted". The ledger's "current state" cells were last aligned on 27 September 2026, with `STATUS.md` of 26 September; the rows above give later records. -The [queue reconciliation of 2026-09-27](QUEUE_RECONCILIATION_20260927.md) records how the open pull requests and issues were dispositioned under the current owner instruction, what ran, and what stays uncertain. A landing recorded there is not mathematical acceptance. +The [queue reconciliation of 2026-09-27](QUEUE_RECONCILIATION_20260927.md) records how that day's open pull requests and issues were dispositioned under the [owner instruction of 23 September](../governance/OP-AUTONOMY-20260923-v2.1.md), what ran, and what stays uncertain. A landing recorded there is not mathematical acceptance. The [Dropbox import of 2026-09-27](../audits/dropbox_import/2026-09-27/README.md) is a provenance record: 107 project files that existed only in the owner's Dropbox, 93 byte-identical to their originals and 14 as extracted text, with a hash manifest and the list of project files that could not be imported. Files keep the claims their authors made at the time; the import moves no status, and eleven rows are only flagged as candidates for Math- review. @@ -97,11 +145,11 @@ The [Dropbox import of 2026-09-27](../audits/dropbox_import/2026-09-27/README.md | [Math-](https://github.com/d6g8k5htny-coder/Math-) | Proofs, calculations, outputs and mathematical tests | | [meta-framework](https://github.com/d6g8k5htny-coder/meta-framework) | Curated exact-source identities and routing | | [query-](https://github.com/d6g8k5htny-coder/query-) | Read-only lookup and local byte verification | -| [google-drive](https://github.com/d6g8k5htny-coder/google-drive) | Twelve selected public replicas with exact source identities, not a Drive backup. Public under the [6 October surface decision](../governance/OWNER_DECISION_20261006_SURFACES.md); About-text correction, then archive, both still outstanding | -| [trial](https://github.com/d6g8k5htny-coder/trial) | Historical integration lab. Public under the [6 October surface decision](../governance/OWNER_DECISION_20261006_SURFACES.md); archive click still outstanding. Its federation replay stays linked from [REPRODUCE.md](REPRODUCE.md) | +| [google-drive](https://github.com/d6g8k5htny-coder/google-drive) | Twelve selected public replicas with exact source identities, not a Drive backup. Public under the [6 October surface decision](../governance/OWNER_DECISION_20261006_SURFACES.md); its README qualification landed in [google-drive #7](https://github.com/d6g8k5htny-coder/google-drive/pull/7), while the About-text correction and the archive are still outstanding | +| [trial](https://github.com/d6g8k5htny-coder/trial) | Engineering, portability and adversarial integration lab, with no scientific-status authority. Public under the [6 October surface decision](../governance/OWNER_DECISION_20261006_SURFACES.md), which archives it; the archive is still outstanding. Its federation replay stays linked from [REPRODUCE.md](REPRODUCE.md) | | [governance-](https://github.com/d6g8k5htny-coder/governance-) | Working practices, not theorem acceptance | -| [sandbox](https://github.com/d6g8k5htny-coder/sandbox) | Bounded exploratory experiments, never exported automatically. Public under the [6 October surface decision](../governance/OWNER_DECISION_20261006_SURFACES.md); archive click still outstanding | +| [sandbox](https://github.com/d6g8k5htny-coder/sandbox) | Bounded exploratory experiments, never exported automatically. Public under the [6 October surface decision](../governance/OWNER_DECISION_20261006_SURFACES.md), which archives it; the archive is still outstanding | ## Branch placement -Default-main navigation and the hardening navigation port have different destinations. Retargeting a main-based documentation patch to the separate research tree changes its entire comparison. Review exact files and base before integration; neither navigation update moves the underlying research stack. [Historical 2025 material](../history/2025/README.md) remains history. +Default-main navigation and the hardening branch's navigation port (ported 24 September 2026) have different destinations. Retargeting a main-based documentation patch to the separate research tree changes its entire comparison. Review exact files and base before integration; neither navigation update moves the underlying research stack. The [retired 2025 material](../history/2025/README.md), a presentation the owner identified as obsolete, is kept unchanged as a record, not as current rules or evidence. From e8e517854f78c6216e22fb3163d2f0129d01c5f8 Mon Sep 17 00:00:00 2001 From: Claude Date: Mon, 12 Oct 2026 02:45:26 +0000 Subject: [PATCH 2/2] Research guide: state the collision-register open item precisely The RN collision register row's Open clause named "the regional shrinking pin/witness-collision mechanism the register still names", which can read as a missing mathematical result. At the guide's pin, Math- #173 section 5 says no source defines another meaning for the node, and section 4 lists what the records do not establish. The clause now says that only execution by a non-Claude lane is open and names the main exclusions from section 4. OPEN_ACTIVE, the hypotheses and the execution prerequisites are unchanged. Suggested in main#371 6116807658; reviewed head 656fa6f4 (PASS 5486128487). Scientific effect NONE. Co-Authored-By: Claude Opus 5.5 Claude-Session: https://claude.ai/code/session_01S16677s1SGeAJmN3QMz4ip --- docs/RESEARCH_INDEX.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/RESEARCH_INDEX.md b/docs/RESEARCH_INDEX.md index 5eeac6a33..18eaec450 100644 --- a/docs/RESEARCH_INDEX.md +++ b/docs/RESEARCH_INDEX.md @@ -125,7 +125,7 @@ Each row gives a front's current label and what remains open; the topic sections | RN / 24-jet | Numerical RN certificate route (`D3-LEMMA-RN-UNIF`, `OBL-H5-JETMOD`): open, with its carriers absent (see [RN counting](#rn-counting)). Open: certified interval bounds for the full 24-jet set over its `r`-bands, and a bound on the actual count-weighted integral over its complete declared region | [RN-UNIF status](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/docs/math_status/STATUS_RN_UNIF.md), [24-jet status](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/docs/math_status/STATUS_JETMOD.md), [execution guide](https://github.com/d6g8k5htny-coder/main/blob/a01c72f1937875b94bfd78e183a6dbbdb2b04da4/docs/RESEARCH_EXECUTION.md), [#67](https://github.com/d6g8k5htny-coder/main/issues/67) (closed discussion) | | RN fixed-remote successor | Reviewed at fixed ρ, fixed η (closed #76); planar and every-fixed-`d` successors reconciled (see [RN counting](#rn-counting)). Open: numerical constants, a certified kernel evaluation, all remote heights in the global count, and the collision rows below | [#76 reconciliation](https://github.com/d6g8k5htny-coder/main/issues/76#issuecomment-5841861362), [D5 reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_reconciliation_20260929/RECONCILIATION.md), [every-fixed-`d` packet](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/d5_dimension_lift_20260929/README.md), [planar kernel numerics](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/c6_remote_coefficient_numerics_20260930/README.md) | | RN shrinking witness pairs | Separate results, each at its own scope: the September note (upper bound only), remote-collision Theorem C, the planar moving cutoff and the sub-pin corollary (see [RN counting](#rn-counting)). Open: mixed inner/outer pairs, an exact kernel, small-gap uniformity and higher dimensions for the moving cutoff | [Note](rn_d5_shrinking_witness_20260926.md), [remote collision](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remote_collision_20260928/PROOF.md), [off-pin review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_offpin_second_moment_20260928/REVIEW.md), [moving cutoff](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/moving_remote_collision_20261003/README.md), [sub-pin corollary](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/subpin_collision_20261002/README.md) | -| RN collision register | [Math- #160](https://github.com/d6g8k5htny-coder/Math-/pull/160) and [Math- #173](https://github.com/d6g8k5htny-coder/Math-/pull/173): merged, reviewed and declarative; neither has been executed, so `math.rn-region.witness-collision` stays `OPEN_ACTIVE` (see [RN counting](#rn-counting)). Open: execution of both records by a non-Claude lane, and the regional shrinking pin/witness-collision mechanism the register still names | [C6 reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/c6_witness_collision_reconciliation_20260929/RECONCILIATION.md), [residual closure](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/c6_residual_closure_20260930/RECONCILIATION.md) | +| RN collision register | [Math- #160](https://github.com/d6g8k5htny-coder/Math-/pull/160) and [Math- #173](https://github.com/d6g8k5htny-coder/Math-/pull/173): merged, reviewed and declarative; neither has been executed, so `math.rn-region.witness-collision` stays `OPEN_ACTIVE` (see [RN counting](#rn-counting)). Open: execution of both records by a non-Claude lane; no source defines another meaning for the node (Math- #173 §5), and the records establish no rate of convergence, no numerical constants, no uniformity as `k -> 0` or in `L` or `d`, no all-height statement and no elder selection of the extra points (§4 lists the rest) | [C6 reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/c6_witness_collision_reconciliation_20260929/RECONCILIATION.md), [residual closure](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/c6_residual_closure_20260930/RECONCILIATION.md) | | P15 | Theorem F, the full-range price theorem (OpenAI author), has an xAI/Grok nonauthor ACCEPT, reconciled on #74 for the realized disjoint family with demands `d_i >= 2`, every independent probability, `c_v <= phi(p_v)` and the same palette. The bipartite-overlap/even-capacity and tail/weighted-load successors (OpenAI authors) have an Anthropic/Claude scoped ACCEPT and landed through [Math- #124](https://github.com/d6g8k5htny-coder/Math-/pull/124). Open: arbitrary downsets and any unrestricted prize statement; demand one remains an obstruction | [Full-price review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_full_price_nonauthor_20260926/REVIEW.md), [overlap/tail review](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md), [integration record](https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/docs/integration/2026-09-28-reviewed-mathematics.md), [#74](https://github.com/d6g8k5htny-coder/main/issues/74), [#67](https://github.com/d6g8k5htny-coder/main/issues/67) (closed review discussions) | | Formalization (Layer 1) | Independent alignment review of the 13 Math- pilot targets and the 31 main-side SIDE24 targets (cross-provider); the remaining "Numerical formalizer" steps — exact `c_{d,ref}` definition and a proof-producing enclosure — in the Mathlib package; D6 Theorem F's constant `ρ*` as the next full-theorem target | [Guide](FORMAL_VERIFICATION.md), [work item #95](https://github.com/d6g8k5htny-coder/main/issues/95), [Formal README](../formal/README.md), [review lane](../formal/REVIEW_LANE.md), [rollout record](FORMAL_VERIFICATION_ROLLOUT_20260927.md) |