Manuscript Hawk04-B@2 · Hawk04-B.tex · section · ba3b0713

OpenAI catalogue entries: separations only

OpenAI catalogue entries: separations only · lines 2695–2751

Back to manuscript

The supplied companion record attributes the following family descriptions to OpenAI. That attribution and their mathematical claims are not independently verified here SuppliedCatalogue. No family is a premise, an evaluation of the present typed program, or a certificate for the four-Majorana control.

In particular, Family 279 by OpenAI, described as “Exact quantum factoring over a fixed finite gate set,” is not an exact-compilation theorem for our admitted unitary constants. Family 227 by OpenAI, described by Sherrington–Kirkpatrick mixing, phase-transition, and critical-autocorrelation topics, is not a scrambling estimate or out-of-time-order evaluation of (eq:H). The control proof uses neither family. O.1 stays NOT_CLOSED.

FamilySupplied documentary topicWhat is not imported
279Exact quantum factoring over a fixed finite gate setCompilation, uniformity, complexity, or implementation of .
227Sherrington–Kirkpatrick dynamical transition, mixing, and critical autocorrelationsQuantum scrambling, an OTOC bound, or a diary-recovery estimate for the source–scalar model.
274Moore's parity conjecture for A limitation on this differently specified finite fragment, or an evaluation of its black-hole interpretation.
276Classical capacity of qubit generalized amplitude-damping channelsA complete-complement decoder or a substitute for Theorem thm:exact.
119Courtade–Kumar and Hellinger-contraction topics on the discrete cubeA quantum destination map, residual-independence certificate, or gravitational conclusion.

The table identifies supplied topics without endorsing their asserted theorems. Similar terminology does not identify models, gate sets, channels, access resources, or observables. No catalogue entry admits the analytic coefficient in Appendix app:analytic, opens XV-B's admission exit, or discharges the separate XVI-N obligations.