{"schema_version":"source-reader-v1","record":{"source_id":"pnp-ren","versions":[{"work":{"authors":["Hanlin Ren","Ryan Williams"],"kind":"research_paper","publication":"preprint","publication_note":"Source-reported preprint/project; independent mathematical assessment pending.","ai_role":"not_reported","ai_note":"AI involvement is not reported by this cited source; this is not a claim of its absence.","artifacts":[{"kind":"pdf","title":"Ren–Williams · Near-maximum circuit lower bounds — proof text","url":"https://arxiv.org/pdf/2607.09963v1","version":"arXiv-2607.09963v1","assessment":"paper_proof","note":"External source text. Its mathematical claims and independent OpenMath review are assessed separately.","sha256":"d8f22d2adb4008ac80f0e31c27ffe4025c086e52859978e8e5ce678bc1765b51"}],"published":{"value":"2026-07-10"}},"id":"pnp-ren@arXiv-2607.09963v1","source_id":"pnp-ren","title":"Ren–Williams · Near-maximum circuit lower bounds","owner":"Hanlin Ren; Ryan Williams","url":"https://arxiv.org/pdf/2607.09963v1","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"arXiv-2607.09963v1","content_sha256":"d8f22d2adb4008ac80f0e31c27ffe4025c086e52859978e8e5ce678bc1765b51","update_method":"Manual primary-source check; changes require a new source version and staff publication.","identifier_policy":"Source URL and exact theorem/section locator; no inferred identity merge.","observed_on":"2026-10-10","source_updated_on":null,"rights":"metadata-link","license":"Full-text redistribution rights not asserted","terms_url":"https://arxiv.org/pdf/2607.09963v1","attribution":"Hanlin Ren; Ryan Williams","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-near-maximum-2026:v1","source_version_id":"pnp-ren@arXiv-2607.09963v1","item_id":"near-maximum-2026","url":"https://arxiv.org/pdf/2607.09963v1","wording":"There exists a function in E^{prMA}/1 requiring Boolean circuits of size Ω(2^n/n).","wording_kind":"paraphrase","locator":"Theorem 1.1, p. 2","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-ren@arXiv-2607.09963v1","available_versions":[{"id":"pnp-ren@arXiv-2607.09963v1","revision":"arXiv-2607.09963v1","observed_on":"2026-10-10","title":"Ren–Williams · Near-maximum circuit lower bounds","publication":"preprint","content_sha256":"d8f22d2adb4008ac80f0e31c27ffe4025c086e52859978e8e5ce678bc1765b51","used_in_current_publications":true}],"usages":[{"id":"source-use-e20f8349699c380ac4bd","entry_id":"pnp-entry-near-maximum-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-near-maximum-2026","version":2,"slug":"pnp-near-maximum-2026","title":"Near-maximum general circuit lower bound in an oracle class"},"fragment":"claim-pnp-near-maximum-2026","assessment":{"id":"pnp-report-near-maximum-2026:v1","entry_id":"pnp-entry-near-maximum-2026:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"An oracle/advice class above the target NP; no general NP separation follows.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://arxiv.org/pdf/2607.09963v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-ccbb9c6ac433ec7a3a27","entry_id":"pnp-entry-near-maximum-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"Near-maximum circuit hardness with an oracle and advice","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-4da03b0f5bab43f5c412","entry_id":"pnp-entry-near-maximum-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-0a9d527d64716b7038e2","entry_id":"pnp-entry-near-maximum-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"Near-maximum general circuit lower bound in an oracle class","claim":{"id":"claim-pnp-near-maximum-2026","version":2,"slug":"pnp-near-maximum-2026","title":"Near-maximum general circuit lower bound in an oracle class"},"fragment":"claim-pnp-near-maximum-2026","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}