{"schema_version":"source-reader-v1","record":{"source_id":"pnp-clay","versions":[{"work":{"authors":["Clay Mathematics Institute"],"kind":"research_project","publication":"project","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":[]},"id":"pnp-clay@observed-2026-10-10","source_id":"pnp-clay","title":"Clay · P versus NP","owner":"Clay Mathematics Institute","url":"https://www.claymath.org/millennium/p-vs-np/","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"observed-2026-10-10","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://www.claymath.org/millennium/p-vs-np/","attribution":"Clay Mathematics Institute","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-general-status:v1","source_version_id":"pnp-clay@observed-2026-10-10","item_id":"general-status","url":"https://www.claymath.org/millennium/p-vs-np/","wording":"Can every decision problem with polynomially bounded, polynomial-time-checkable certificates also be decided in deterministic polynomial time?","wording_kind":"paraphrase","locator":"Page heading: Unsolved; observed 10 October 2026","supersedes":"p-vs-np:entry:0:v1"}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-clay@observed-2026-10-10","available_versions":[{"id":"pnp-clay@observed-2026-10-10","revision":"observed-2026-10-10","observed_on":"2026-10-10","title":"Clay · P versus NP","publication":"project","content_sha256":null,"used_in_current_publications":true}],"usages":[{"id":"source-use-85dc75e847fd304e3417","entry_id":"pnp-entry-general-status:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Unsolved","claim":null,"fragment":"research-state","assessment":{"id":"pnp-report-general-status:v2","entry_id":"pnp-entry-general-status:v1","state":"reported_open","source_label":"Unsolved","scope":"The canonical classical uniform worst-case decision question P = NP; no supporting theorem decides this status.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.claymath.org/millennium/p-vs-np/","supersedes":"p-vs-np:report:0:v1"},"superseded":false,"formalization":null,"update":null},{"id":"source-use-64329b23b6ad7edd28fc","entry_id":"pnp-entry-general-status: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}],"linked_entries":[],"linked_sources":[]}}