{"schema_version":"source-reader-v1","record":{"source_id":"pnp-openai","versions":[{"work":{"authors":["OpenAI internal model; author attribution per manuscript"],"kind":"research_project","publication":"project","publication_note":"Source-reported preprint/project; independent mathematical assessment pending.","ai_role":"self_reported","ai_note":"OpenAI reports internal-model production and accompanying formalizations at mixed stages of assessment. These Claims remain proposed in this curation; external formal evidence does not become an OpenMath check.","artifacts":[{"kind":"project_notes","title":"Unique Games gap reductions — formalization scope","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/102.md","version":"fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","assessment":"external_report","note":"Pinned provider scope document and comparator links. OpenMath has not executed the code or independently reviewed the mathematical correspondence."},{"kind":"project_notes","title":"Depth-three circuit lower bound — formalization scope","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/112.md","version":"fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","assessment":"external_report","note":"Pinned provider scope document and comparator links. OpenMath has not executed the code or independently reviewed the mathematical correspondence."},{"kind":"project_notes","title":"Complex permanent determinantal lower bound — formalization scope","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/108.md","version":"fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","assessment":"external_report","note":"Pinned provider scope document and comparator links. OpenMath has not executed the code or independently reviewed the mathematical correspondence."},{"kind":"pdf","title":"Unique Games proposal — manuscript","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/The-Unique-Games-Theorem-September-23-2026/paper.pdf","version":"fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","assessment":"external_report","note":"Pinned provider manuscript; the proposed result has not received independent OpenMath mathematical review. See the matching formalization scope document separately."},{"kind":"pdf","title":"Depth-three proposal — manuscript","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Beyond-the-Square-Root-Exponent-for-Depth-Three-Boolean-Circuits-September-23-2026/main.pdf","version":"fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","assessment":"external_report","note":"Pinned provider manuscript; the proposed result has not received independent OpenMath mathematical review. See the matching formalization scope document separately."},{"kind":"pdf","title":"Permanent proposal — manuscript","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/A-cubic-lower-bound-for-border-determinantal-complexity-of-the-permanent-September-24-2026/A-cubic-lower-bound-for-border-determinantal-complexity-of-the-permanent-September-24-2026.pdf","version":"fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","assessment":"external_report","note":"Pinned provider manuscript; the proposed result has not received independent OpenMath mathematical review. See the matching formalization scope document separately."}],"published":{"value":"2026-10-06"}},"id":"pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","source_id":"pnp-openai","title":"OpenAI · Mathematics release: complexity proposals","owner":"OpenAI internal model; author attribution per manuscript","url":"https://github.com/openai/math/tree/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","content_sha256":null,"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://github.com/openai/math/tree/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","attribution":"OpenAI internal model; author attribution per manuscript","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-depth-three-proposal:v1","source_version_id":"pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","item_id":"depth-three-proposal","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/112.md","wording":"A fixed language in P requires more than 2^{A√n} depth-three OR–AND–OR gates for every fixed A > 0, at every sufficiently large input length.","wording_kind":"paraphrase","locator":"Family 112; lean/docs/112.md and DepthThree comparator","supersedes":null},{"id":"pnp-entry-permanent-proposal:v1","source_version_id":"pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","item_id":"permanent-proposal","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/108.md","wording":"For m ≥ 1408, every affine-linear determinant representation, including coefficientwise limits, of the complex m×m permanent has size at least m^3/(5529600e).","wording_kind":"paraphrase","locator":"Family 108; lean/docs/108.md, PermanentCubic comparator; supporting theorem scope excludes ABP consequences","supersedes":null},{"id":"pnp-entry-ugc-proposal:v1","source_version_id":"pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","item_id":"ugc-proposal","url":"https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/102.md","wording":"For every fixed ε, δ in (0,1/2), there is a deterministic polynomial-time reduction from binary 3SAT to unique games over a fixed alphabet, with completeness at least 1−ε and soundness at most δ.","wording_kind":"paraphrase","locator":"Family 102; lean/docs/102.md and linked paper/comparator","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","available_versions":[{"id":"pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","revision":"fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","observed_on":"2026-10-10","title":"OpenAI · Mathematics release: complexity proposals","publication":"project","content_sha256":null,"used_in_current_publications":true}],"usages":[{"id":"source-use-ab8cffa8818266aab4e3","entry_id":"pnp-entry-depth-three-proposal:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Provider proposes this result; assessment pending","claim":{"id":"claim-pnp-depth-three-proposal","version":2,"slug":"pnp-depth-three-proposal","title":"Proposed depth-three bound beyond the square-root exponent"},"fragment":"claim-pnp-depth-three-proposal","assessment":{"id":"pnp-report-depth-three-proposal:v1","entry_id":"pnp-entry-depth-three-proposal:v1","state":"proposed_solution","source_label":"Provider proposes this result; assessment pending","scope":"Restricted depth only; not a fixed n^{1/2+ε} exponent and not unrestricted circuits.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://github.com/openai/math/tree/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-464cb8156dab02ba5945","entry_id":"pnp-entry-depth-three-proposal:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"New AI-produced complexity proposals","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-5219aa60bbe343a536d7","entry_id":"pnp-entry-depth-three-proposal: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-90b2ca406528f805fe20","entry_id":"pnp-entry-depth-three-proposal:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"Proposed depth-three bound beyond the square-root exponent","claim":{"id":"claim-pnp-depth-three-proposal","version":2,"slug":"pnp-depth-three-proposal","title":"Proposed depth-three bound beyond the square-root exponent"},"fragment":"claim-pnp-depth-three-proposal","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-22e4c7edb5db7f944793","entry_id":"pnp-entry-permanent-proposal:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Provider proposes this result; assessment pending","claim":{"id":"claim-pnp-permanent-proposal","version":2,"slug":"pnp-permanent-proposal","title":"Proposed cubic complex determinantal lower bound"},"fragment":"claim-pnp-permanent-proposal","assessment":{"id":"pnp-report-permanent-proposal:v1","entry_id":"pnp-entry-permanent-proposal:v1","state":"proposed_solution","source_label":"Provider proposes this result; assessment pending","scope":"A proposed bound in an algebraic model; does not separate VP from VNP or Boolean P from NP.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://github.com/openai/math/tree/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-ee0a04cbafe5ceaea1d6","entry_id":"pnp-entry-permanent-proposal:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"New AI-produced complexity proposals","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-5c8b6d1aabf1c406c124","entry_id":"pnp-entry-permanent-proposal: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-8e1b0923dabfdf8250aa","entry_id":"pnp-entry-permanent-proposal:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"Proposed cubic complex determinantal lower bound","claim":{"id":"claim-pnp-permanent-proposal","version":2,"slug":"pnp-permanent-proposal","title":"Proposed cubic complex determinantal lower bound"},"fragment":"claim-pnp-permanent-proposal","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-c24a31eb5450c917e3bc","entry_id":"pnp-entry-ugc-proposal:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Provider proposes this result; assessment pending","claim":{"id":"claim-pnp-ugc-proposal","version":2,"slug":"pnp-ugc-proposal","title":"Proposed Unique Games gap reductions"},"fragment":"claim-pnp-ugc-proposal","assessment":{"id":"pnp-report-ugc-proposal:v1","entry_id":"pnp-entry-ugc-proposal:v1","state":"proposed_solution","source_label":"Provider proposes this result; assessment pending","scope":"Provider proposal for Unique Games hardness; a hardness reduction does not prove P ≠ NP.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://github.com/openai/math/tree/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-3ac8ad6859135ca9238c","entry_id":"pnp-entry-ugc-proposal:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"New AI-produced complexity proposals","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-097e6438960247b1263c","entry_id":"pnp-entry-ugc-proposal: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-ad101fdf7eae40659f37","entry_id":"pnp-entry-ugc-proposal:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"Proposed Unique Games gap reductions","claim":{"id":"claim-pnp-ugc-proposal","version":2,"slug":"pnp-ugc-proposal","title":"Proposed Unique Games gap reductions"},"fragment":"claim-pnp-ugc-proposal","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}