ICML 2026 · exact CPU theory reproduction

At unit complexity, two printed pseudo-dimension bounds collapse to zero

A single affine coordinate family satisfies every stated assumption, pseudo-shatters p points, and exposes the missing positive logarithmic guards in Theorems 4.1 and 7.2.

2 exactliteral theorem falsifications

Pdim ≥ puniversal algebraic witness

510 / 510diagnostic labelings independently recomputed

USD 0one local CPU process

Theorem 4.1K=1, d₁=1, M=Δ=1. A valid one-atom FOL gives a zero printed RHS while coordinate thresholds realize every labeling.Claim 1 · falsified ↗ Theorem 7.2Unique θ*=α path. One affine path and one affine tuning piece give M_total=Δ_total=1, again collapsing the RHS.Claim 4 · falsified ↗ Fail-sensitive controllog₂(1+z) restores an order-p term compatible with the exact lower bound; the checker imports no primary code.Conclusion and rerun ↗

OpenReview JnuwpwbZ8D · arXiv 2602.02406 · exact algebraic witness · independent source and complexity checker · no GPU or Hub Job · poster workflow: Chenruishuo/posterly.