{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MS6EXITI4WQLCSVHE4OB3JIRKX","short_pith_number":"pith:MS6EXITI","schema_version":"1.0","canonical_sha256":"64bc4ba268e5a0b14aa7271c1da51155c3bd7e3cd34798e0f9ef9a7951d372a8","source":{"kind":"arxiv","id":"2005.00809","version":10},"attestation_state":"computed","paper":{"title":"On P Versus NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lev Gordeev","submitted_at":"2020-05-02T12:03:50Z","abstract_excerpt":"It is shown that graph-theoretic problem CLIQUE can't be solved in polynomial time by any deterministic TM. This upgrades the well-known partial result that claims only monotone unsolvability thereof, and eventually implies P $\\neq$ NP as CLIQUE is NP-complete. This paper essentially simplifies my previous presentation that used more complex models of computation based on standard Boolean semantics while fixing technical errors spotted by a generic proof assistant Isabelle that has been implemented by Ren\\'e Thiemann."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2005.00809","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-05-02T12:03:50Z","cross_cats_sorted":[],"title_canon_sha256":"9a88e420a526c9f24a8ce204ec32ae16145da1a38eb53c94bb03831fc88f74c3","abstract_canon_sha256":"8be5cb43d3c7237d2246ee1aac68f5e2cb5de5bf5e344332937bdfdbf64ada8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:13.325925Z","signature_b64":"7GzPRfb6DdaTktcCtMTCWCwbZINGCJ7yFC73xsvbsDIYO3n4qYXCUhZmC9m/RVHl6bZ1S+5f+svMJPr4/YnYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64bc4ba268e5a0b14aa7271c1da51155c3bd7e3cd34798e0f9ef9a7951d372a8","last_reissued_at":"2026-05-18T03:10:13.325357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:13.325357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On P Versus NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lev Gordeev","submitted_at":"2020-05-02T12:03:50Z","abstract_excerpt":"It is shown that graph-theoretic problem CLIQUE can't be solved in polynomial time by any deterministic TM. This upgrades the well-known partial result that claims only monotone unsolvability thereof, and eventually implies P $\\neq$ NP as CLIQUE is NP-complete. This paper essentially simplifies my previous presentation that used more complex models of computation based on standard Boolean semantics while fixing technical errors spotted by a generic proof assistant Isabelle that has been implemented by Ren\\'e Thiemann."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.00809","kind":"arxiv","version":10},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2005.00809","created_at":"2026-05-18T03:10:13.325462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.00809v10","created_at":"2026-05-18T03:10:13.325462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.00809","created_at":"2026-05-18T03:10:13.325462+00:00"},{"alias_kind":"pith_short_12","alias_value":"MS6EXITI4WQL","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"MS6EXITI4WQLCSVH","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"MS6EXITI","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MS6EXITI4WQLCSVHE4OB3JIRKX","json":"https://pith.science/pith/MS6EXITI4WQLCSVHE4OB3JIRKX.json","graph_json":"https://pith.science/api/pith-number/MS6EXITI4WQLCSVHE4OB3JIRKX/graph.json","events_json":"https://pith.science/api/pith-number/MS6EXITI4WQLCSVHE4OB3JIRKX/events.json","paper":"https://pith.science/paper/MS6EXITI"},"agent_actions":{"view_html":"https://pith.science/pith/MS6EXITI4WQLCSVHE4OB3JIRKX","download_json":"https://pith.science/pith/MS6EXITI4WQLCSVHE4OB3JIRKX.json","view_paper":"https://pith.science/paper/MS6EXITI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.00809&json=true","fetch_graph":"https://pith.science/api/pith-number/MS6EXITI4WQLCSVHE4OB3JIRKX/graph.json","fetch_events":"https://pith.science/api/pith-number/MS6EXITI4WQLCSVHE4OB3JIRKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MS6EXITI4WQLCSVHE4OB3JIRKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MS6EXITI4WQLCSVHE4OB3JIRKX/action/storage_attestation","attest_author":"https://pith.science/pith/MS6EXITI4WQLCSVHE4OB3JIRKX/action/author_attestation","sign_citation":"https://pith.science/pith/MS6EXITI4WQLCSVHE4OB3JIRKX/action/citation_signature","submit_replication":"https://pith.science/pith/MS6EXITI4WQLCSVHE4OB3JIRKX/action/replication_record"}},"created_at":"2026-05-18T03:10:13.325462+00:00","updated_at":"2026-05-18T03:10:13.325462+00:00"}