GARDEN-019 — Sidorenko

WHAT THIS CERTIFICATE RECORDS, IN PLAIN TERMS. Sidorenko is overlaid on the MuncyNautics frame: the seat names WHERE the problem lives in the frame, the species (S6 — The Positivity) names WHAT KIND of owe its residual is, the forbidder is the executed witness — bipartite = the disjointness clause (odd loops, the failures, are self-pairings); closed classes close by writing the remainder AS squares; even-power spectral books cannot dip… — and the structured residual states exactly what remains open: sum-of-squares completion — the Cancellation’s own species. AND THIS ENTRY SUPPLIES THE MANIFEST SQUARE THAT ERDŐS–TURÁN NEEDS. Sidorenko says the random-like configuration MINIMISES the homomorphism count, so any deviat… Standing is honest: SUPPORTED means the overlay reading is demonstrated and measured but the named residual is not yet discharged. Method: MuncyNautics Seam Recovery, Derrick E. Muncy.

MN-RECOVERY-CERTIFICATE-1.1

MN-CERT-GARDEN-019-RERUN-20260830

MN-CERT-GARDEN-019-INTAKE-20260830 (intake stub: all channels NOT_COMPUTED)

GARDEN-019

Sidorenko

Derrick E. Muncy

MuncyNautics Seam Recovery Method v1.0 · Overlay Codex executed record

The Overlay Codex (44 problems) · overlay-data.js (project record) · Overlay Codex, Annals format

S6 — The Positivity

floor

the symmetric (quasirandom) seat — the floor of every bipartite book

bipartite = the disjointness clause (odd loops, the failures, are self-pairings); closed classes close by writing the remainder AS squares; even-power spectral books cannot dip

t(H, G) ≥ p^{e(H)} for bipartite H — a floor audited per graph

the floor kept as a manifest square: 1 − Q = b²/𝔷² ≥ 0 in the graph register — deviation from random only pushes UP (measured ratios 1.24–14.96, floor never pierced); odd loops (the failures) are self-pairings, excluded by the disjointness clause

sum-of-squares completion — the Cancellation’s own species. AND THIS ENTRY SUPPLIES THE MANIFEST SQUARE THAT ERDŐS–TURÁN NEEDS. Sidorenko says the random-like configuration MINIMISES the homomorphism count, so any deviation from random can only increase it — which is 1 − Q = b²/𝔷² ≥ 0 in the graph register. Measured cold on 60-vertex graphs, t(C₄,G) against the floor p⁴: random gives 0.00842809 against 0.00678519, ratio 1.2421; a half-clique 0.05457639 against 0.00364808, ratio 14.9603; a complete bipartite 0.12500000 against 0.06684624, ratio 1.8700; a circulant 0.01766034 against 0.00716697, ratio 2.4641 — the floor holds in every case and structure only ever pushes UP, never down. Erdős–Turán is that same square read as a lower bound on structure rather than an upper bound on randomness, so THE TWO ENTRIES SHARE ONE DISCHARGE: complete the square once and both are paid

Correction = reconstruction from the recovery: restored arguments, seats, phases and arms in the equation itself. No raw appended constants; any finite term must be derived from the recovered channels, never fitted.

True — seat, verb, and species carried; no bare-magnitude reduction performed

Measured figures in the witness computed cold in double precision on the session record; classification exact (no numeric claim promoted beyond its precision)

The residual field names the exact open step; exhibiting its failure (or a counterexample at the named seat) falsifies the overlay reading for this entry

WITNESS_EXECUTED_EXACT

YELLOW — the residual is a named open step; no GREEN issued on an open owe

SUPPORTED

2026-08-31T03:05:49.533Z