{"payload":{"schema_version":"research-record-v0","publication":{"version":1,"sha256":"4538cbc040cc71da2c7eb89812f36065aae7bd4cccd0eefad94bd0c30115ca46","published_at":"2026-09-30T20:13:42.290706+00:00","reason":"Initial checked pilot publication; source attribution, rights, wording and coverage reviewed by OpenMath staff.","withdrawn":false,"draft":{"schema_version":"research-record-v0","problem":{"problem_id":"problem-p-vs-np","slug":"p-vs-np","title":"P versus NP","question":"Is every decision problem with solutions verifiable in polynomial time also solvable in polynomial time?","scope":"Deterministic polynomial-time decision problems versus nondeterministic polynomial-time decision problems.","aliases":["P = NP","P != NP"],"fields":["Theoretical computer science"],"msc":["68Q15"],"topics":[],"background":"undergraduate","scale":"major conjecture","depth":"source-linked","source_entry_ids":["p-vs-np:entry:0:v1"],"status_report_ids":["p-vs-np:report:0:v1"],"editorial":null,"literature":[{"title":"Clay problem page and official description","url":"https://www.claymath.org/millennium/p-vs-np/","note":"Source state checked on 1 October 2026. The page does not provide a status-update date; current literature has not been independently reviewed."}],"formalizations":[],"related":[],"tasks":[],"insights":[],"coverage_gaps":["No exhaustive literature or source-list coverage.","Independent mathematical assessment has not been performed."],"checked_on":"2026-10-01"},"sources":[{"id":"clay-millennium@observed-2026-10-01","source_id":"clay-millennium","title":"Clay · Millennium Problems","owner":"Clay Mathematics Institute","url":"https://www.claymath.org/millennium-problems/","subject_scope":"Seven Millennium Prize Problems; five selected here","revision":"observed-2026-10-01","content_sha256":null,"update_method":"Manual checked import; new observations require staff preview and publication","identifier_policy":"Canonical source URL plus explicit item/declaration locator; no fuzzy identity merge","observed_on":"2026-10-01","source_updated_on":null,"rights":"metadata-link","license":"Not established; links and OpenMath paraphrases only","terms_url":"https://www.claymath.org/millennium-problems/","attribution":"Clay Mathematics Institute","rights_note":"Store metadata and original OpenMath paraphrases; follow the original source for authoritative wording.","check_interval_days":30}],"entries":[{"id":"p-vs-np:entry:0:v1","source_version_id":"clay-millennium@observed-2026-10-01","item_id":"https://www.claymath.org/millennium/p-vs-np/","url":"https://www.claymath.org/millennium/p-vs-np/","wording":"Is every decision problem with solutions verifiable in polynomial time also solvable in polynomial time?","wording_kind":"paraphrase","locator":"https://www.claymath.org/millennium/p-vs-np/","supersedes":null}],"reports":[{"id":"p-vs-np:report:0:v1","entry_id":"p-vs-np:entry:0:v1","state":"reported_open","source_label":"Unsolved","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","source_date":null,"observed_on":"2026-10-01","evidence_url":"https://www.claymath.org/millennium/p-vs-np/","supersedes":null}]},"status":{"state":"open","label":"Open","extent":"unspecified","summary":"Resolution scope has not been assessed in this publication.","basis":"source","attributed_to":"Clay · Millennium Problems","as_of":"2026-10-01","progress_label":null,"progress_claim_ids":[],"remaining":null,"views":["open"]}},"data_mode":"published catalog snapshot; historical Phase 0 checks only","context_packs":[],"reference_fixture_checks":[],"repeat_instructions":"No verification task is attached to this discovery record."},"payload_sha256":"becb61bfdd2476d8e2a0e418fb8d219e12ddd3864173bc92a27c2fc6ef7a20c7","canonicalization":"RFC 8785 JSON Canonicalization Scheme. Hash the payload, excluding this envelope. Immutable embedded domain hashes retain their original profile."}