Theorem 1.1, p. 2
There exists a function in E^{prMA}/1 requiring Boolean circuits of size Ω(2^n/n).
Passage details
Passage ID: pnp-entry-near-maximum-2026:v1
Source item: near-maximum-2026
Source record: pnp-ren@arXiv-2607.09963v1
The precise statements and locators cited in this P versus NP research record.
Source-reported preprint/project; independent mathematical assessment pending.
The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.
There exists a function in E^{prMA}/1 requiring Boolean circuits of size Ω(2^n/n).
Passage ID: pnp-entry-near-maximum-2026:v1
Source item: near-maximum-2026
Source record: pnp-ren@arXiv-2607.09963v1
Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.
Problem publication v14
Source assessment
Proved
Established implication or scoped theorem in cited mathematics
An oracle/advice class above the target NP; no general NP separation follows.
Observed Oct 10, 2026
Linked manuscripts, code and data. External proof reports, statement correspondence and OpenMath execution are separate checks.
Manuscript / exposition · external
External source text. Its mathematical claims and independent OpenMath review are assessed separately.
Resource revision: arXiv-2607.09963v1
SHA-256 for this linked file. A matching checksum identifies the same bytes; it does not assess the mathematics.
d8f22d2adb4008ac80f0e31c27ffe4025c086e52859978e8e5ce678bc1765b51Recorded authorship
Hanlin Ren · Ryan Williams
Hanlin Ren; Ryan Williams
AI involvement is not reported by this cited source; this is not a claim of its absence.
OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.
Ren–Williams · Near-maximum circuit lower bounds
Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.
Source terms ↗