{"schema_version":"source-reader-v1","record":{"source_id":"pnp-cook","versions":[{"work":{"authors":["Stephen Cook"],"kind":"research_paper","publication":"published","publication_note":"Published author exposition or original paper.","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":"Stephen Cook · The P versus NP problem — proof text","url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","version":"official-description-sha256-018f3d473d16","assessment":"paper_proof","note":"External source text. Its mathematical claims and independent OpenMath review are assessed separately.","sha256":"018f3d473d16c35e807e8cdfbd0bed3ccf7a56452e3e10c6b1d84b56eaf2cf59"}]},"id":"pnp-cook@official-description-sha256-018f3d473d16","source_id":"pnp-cook","title":"Stephen Cook · The P versus NP problem","owner":"Stephen Cook","url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"official-description-sha256-018f3d473d16","content_sha256":"018f3d473d16c35e807e8cdfbd0bed3ccf7a56452e3e10c6b1d84b56eaf2cf59","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://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","attribution":"Stephen Cook","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-equality:v1","source_version_id":"pnp-cook@official-description-sha256-018f3d473d16","item_id":"equality","url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","wording":"Every language in NP is decidable by a deterministic polynomial-time algorithm.","wording_kind":"paraphrase","locator":"Definition 2 and problem statement, pp. 2–3","supersedes":null},{"id":"pnp-entry-inequality:v1","source_version_id":"pnp-cook@official-description-sha256-018f3d473d16","item_id":"inequality","url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","wording":"There exists a language in NP that is not decidable by any deterministic polynomial-time algorithm.","wording_kind":"paraphrase","locator":"Problem statement and discussion, pp. 2–3","supersedes":null},{"id":"pnp-entry-np-complete-hard:v1","source_version_id":"pnp-cook@official-description-sha256-018f3d473d16","item_id":"np-complete-hard","url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","wording":"If P ≠ NP, every NP-complete decision language is outside P.","wording_kind":"paraphrase","locator":"Definition 4 and Proposition 1(c), pp. 4–5","supersedes":null},{"id":"pnp-entry-np-conp:v1","source_version_id":"pnp-cook@official-description-sha256-018f3d473d16","item_id":"np-conp","url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","wording":"NP and coNP are distinct.","wording_kind":"paraphrase","locator":"Proof complexity discussion, pp. 5–6","supersedes":null},{"id":"pnp-entry-np-search:v1","source_version_id":"pnp-cook@official-description-sha256-018f3d473d16","item_id":"np-search","url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","wording":"If P = NP, then every polynomially balanced, polynomial-time-decidable witness relation admits polynomial-time witness search or correct reporting that no witness exists.","wording_kind":"paraphrase","locator":"Decision versus search discussion, p. 5","supersedes":null},{"id":"pnp-entry-sat-equivalence:v1","source_version_id":"pnp-cook@official-description-sha256-018f3d473d16","item_id":"sat-equivalence","url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","wording":"P = NP if and only if SAT is in P.","wording_kind":"paraphrase","locator":"Definition 4, Proposition 1(c) and SAT NP-completeness discussion, pp. 4–5","supersedes":null},{"id":"pnp-entry-sat-in-p:v1","source_version_id":"pnp-cook@official-description-sha256-018f3d473d16","item_id":"sat-in-p","url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","wording":"Boolean satisfiability has a uniform deterministic polynomial-time decision algorithm.","wording_kind":"paraphrase","locator":"Proposition 1(c) and SAT NP-completeness discussion, p. 5","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-cook@official-description-sha256-018f3d473d16","available_versions":[{"id":"pnp-cook@official-description-sha256-018f3d473d16","revision":"official-description-sha256-018f3d473d16","observed_on":"2026-10-10","title":"Stephen Cook · The P versus NP problem","publication":"published","content_sha256":"018f3d473d16c35e807e8cdfbd0bed3ccf7a56452e3e10c6b1d84b56eaf2cf59","used_in_current_publications":true}],"usages":[{"id":"source-use-3fc855a197b5797892c8","entry_id":"pnp-entry-equality:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Unresolved assertion in the cited scope","claim":{"id":"claim-pnp-equality","version":2,"slug":"pnp-equality","title":"P = NP"},"fragment":"claim-pnp-equality","assessment":{"id":"pnp-report-equality:v1","entry_id":"pnp-entry-equality:v1","state":"reported_open","source_label":"Unresolved assertion in the cited scope","scope":"The affirmative answer to the canonical question.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-4c2ccccafb9a36559e4b","entry_id":"pnp-entry-equality:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"definition","title":"Decision problem and certificate","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-15eb581a4372da7ad6a7","entry_id":"pnp-entry-equality: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-a4de8db414804ac3d6ba","entry_id":"pnp-entry-equality:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"reading","title":"Read the setting and notation before comparing the results.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-47fec22a60b5667c1d92","entry_id":"pnp-entry-equality:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"P = NP","claim":{"id":"claim-pnp-equality","version":2,"slug":"pnp-equality","title":"P = NP"},"fragment":"claim-pnp-equality","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-d02aa36494e44ce10859","entry_id":"pnp-entry-inequality:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Unresolved assertion in the cited scope","claim":{"id":"claim-pnp-inequality","version":3,"slug":"pnp-inequality","title":"P ≠ NP"},"fragment":"claim-pnp-inequality","assessment":{"id":"pnp-report-inequality:v1","entry_id":"pnp-entry-inequality:v1","state":"reported_open","source_label":"Unresolved assertion in the cited scope","scope":"The conjectural negative answer to the same canonical question.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-a3aed4f121cdf28a6f69","entry_id":"pnp-entry-inequality: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-82794d688fab58d19c5a","entry_id":"pnp-entry-inequality:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"P ≠ NP","claim":{"id":"claim-pnp-inequality","version":3,"slug":"pnp-inequality","title":"P ≠ NP"},"fragment":"claim-pnp-inequality","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-3b35cb9252347218cfab","entry_id":"pnp-entry-np-complete-hard: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-np-complete-hard","version":2,"slug":"pnp-np-complete-hard","title":"If P ≠ NP, NP-complete problems have no polynomial algorithm"},"fragment":"claim-pnp-np-complete-hard","assessment":{"id":"pnp-report-np-complete-hard:v1","entry_id":"pnp-entry-np-complete-hard:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"Rules out uniform polynomial-time algorithms, not efficient restricted-instance methods or heuristics.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-783557497350746802a4","entry_id":"pnp-entry-np-complete-hard: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-38bec9255905c452f1d9","entry_id":"pnp-entry-np-complete-hard:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"If P ≠ NP, NP-complete problems have no polynomial algorithm","claim":{"id":"claim-pnp-np-complete-hard","version":2,"slug":"pnp-np-complete-hard","title":"If P ≠ NP, NP-complete problems have no polynomial algorithm"},"fragment":"claim-pnp-np-complete-hard","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-343b3ca3ae6e26913417","entry_id":"pnp-entry-np-conp:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Unresolved assertion in the cited scope","claim":{"id":"claim-pnp-np-conp","version":2,"slug":"pnp-np-conp","title":"NP ≠ coNP"},"fragment":"claim-pnp-np-conp","assessment":{"id":"pnp-report-np-conp:v1","entry_id":"pnp-entry-np-conp:v1","state":"reported_open","source_label":"Unresolved assertion in the cited scope","scope":"A stronger related separation; not equivalent to P ≠ NP.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-266f498b1e586917a65c","entry_id":"pnp-entry-np-conp: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-2ed08f2aa7ac4a50567d","entry_id":"pnp-entry-np-conp:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"NP ≠ coNP","claim":{"id":"claim-pnp-np-conp","version":2,"slug":"pnp-np-conp","title":"NP ≠ coNP"},"fragment":"claim-pnp-np-conp","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-eeeab87fe73abd03d31a","entry_id":"pnp-entry-np-search: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-np-search","version":2,"slug":"pnp-np-search","title":"If P = NP, NP witnesses can be found efficiently"},"fragment":"claim-pnp-np-search","assessment":{"id":"pnp-report-np-search:v1","entry_id":"pnp-entry-np-search:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"An asymptotic search consequence for these relations; output length and encoding restrictions matter.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-d908dafdf2a1ca2542ce","entry_id":"pnp-entry-np-search: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-6b3c7221788b02b2b066","entry_id":"pnp-entry-np-search:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"If P = NP, NP witnesses can be found efficiently","claim":{"id":"claim-pnp-np-search","version":2,"slug":"pnp-np-search","title":"If P = NP, NP witnesses can be found efficiently"},"fragment":"claim-pnp-np-search","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-6bf1f2f18e357e4f571f","entry_id":"pnp-entry-sat-equivalence: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-sat-equivalence","version":2,"slug":"pnp-sat-equivalence","title":"SAT captures P versus NP"},"fragment":"claim-pnp-sat-equivalence","assessment":{"id":"pnp-report-sat-equivalence:v1","entry_id":"pnp-entry-sat-equivalence:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"An established equivalence between two unresolved assertions.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-dc10e16c0ec8744fbe4d","entry_id":"pnp-entry-sat-equivalence:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"connection","title":"SAT is an equivalent decision target: a deterministic polynomial-time SAT algorithm establishes P = NP.","claim":{"id":"claim-pnp-sat-equivalence","version":2,"slug":"pnp-sat-equivalence","title":"SAT captures P versus NP"},"fragment":"claim-pnp-sat-equivalence","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-677c7e8e984e27e76650","entry_id":"pnp-entry-sat-equivalence:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"NP-completeness gives a common target","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e2fb4cff4c5b7f22599e","entry_id":"pnp-entry-sat-equivalence: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-b509720a3528d1f1b115","entry_id":"pnp-entry-sat-equivalence:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"SAT captures P versus NP","claim":{"id":"claim-pnp-sat-equivalence","version":2,"slug":"pnp-sat-equivalence","title":"SAT captures P versus NP"},"fragment":"claim-pnp-sat-equivalence","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-0017747064395f5a4208","entry_id":"pnp-entry-sat-in-p:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Unresolved assertion in the cited scope","claim":{"id":"claim-pnp-sat-in-p","version":2,"slug":"pnp-sat-in-p","title":"SAT in polynomial time"},"fragment":"claim-pnp-sat-in-p","assessment":{"id":"pnp-report-sat-in-p:v1","entry_id":"pnp-entry-sat-in-p:v1","state":"reported_open","source_label":"Unresolved assertion in the cited scope","scope":"The SAT decision target; presently unresolved.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-eacd1f5022add40da949","entry_id":"pnp-entry-sat-in-p: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-b8dfc7fb7bd845559358","entry_id":"pnp-entry-sat-in-p:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"SAT in polynomial time","claim":{"id":"claim-pnp-sat-in-p","version":2,"slug":"pnp-sat-in-p","title":"SAT in polynomial time"},"fragment":"claim-pnp-sat-in-p","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}