{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MJJC3DPCUUPF25O75QEQKPRDYJ","short_pith_number":"pith:MJJC3DPC","schema_version":"1.0","canonical_sha256":"62522d8de2a51e5d75dfec09053e23c243d5e81ff544896d86d3fd3dfdf4b6d5","source":{"kind":"arxiv","id":"2508.13166","version":8},"attestation_state":"computed","paper":{"title":"Graph-Based Deterministic Polynomial Framwork for NP Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Changryeol Lee (Independent Researcher)","submitted_at":"2025-08-02T09:04:47Z","abstract_excerpt":"The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P=NP by introducing a universal, graph-based deterministic framework applicable to all NP problems without requiring reduction to an NP-complete problem. We model computational transitions as edges within a unified graph structure, where edges correspond to the steps of a deterministic verifier Turing machine for all possible certificates. Due to the overlap of edges among computation paths, the total cardina"},"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":"2508.13166","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-08-02T09:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"495e3fac5a5e72762e90c05cc0281e346ccd1d575626012daed16f595b30e7e0","abstract_canon_sha256":"a353b69c4486c4fe964a945d831c6b897d5fb3c7e45119ae3df3787815122b4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:17:45.191771Z","signature_b64":"jUbrVQZVeXwrSt4ctOct7BCcVTbdkTnnh9vnOtfRO2a3TxsuwBhlGRLZH3M3AV0cqBBUQTDj1HQJlcQy7qkVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62522d8de2a51e5d75dfec09053e23c243d5e81ff544896d86d3fd3dfdf4b6d5","last_reissued_at":"2026-07-13T01:17:45.190091Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:17:45.190091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Based Deterministic Polynomial Framwork for NP Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Changryeol Lee (Independent Researcher)","submitted_at":"2025-08-02T09:04:47Z","abstract_excerpt":"The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P=NP by introducing a universal, graph-based deterministic framework applicable to all NP problems without requiring reduction to an NP-complete problem. We model computational transitions as edges within a unified graph structure, where edges correspond to the steps of a deterministic verifier Turing machine for all possible certificates. Due to the overlap of edges among computation paths, the total cardina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.13166","kind":"arxiv","version":8},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.13166/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.13166","created_at":"2026-07-13T01:17:45.190866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.13166v8","created_at":"2026-07-13T01:17:45.190866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13166","created_at":"2026-07-13T01:17:45.190866+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJJC3DPCUUPF","created_at":"2026-07-13T01:17:45.190866+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJJC3DPCUUPF25O7","created_at":"2026-07-13T01:17:45.190866+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJJC3DPC","created_at":"2026-07-13T01:17:45.190866+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/MJJC3DPCUUPF25O75QEQKPRDYJ","json":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ.json","graph_json":"https://pith.science/api/pith-number/MJJC3DPCUUPF25O75QEQKPRDYJ/graph.json","events_json":"https://pith.science/api/pith-number/MJJC3DPCUUPF25O75QEQKPRDYJ/events.json","paper":"https://pith.science/paper/MJJC3DPC"},"agent_actions":{"view_html":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ","download_json":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ.json","view_paper":"https://pith.science/paper/MJJC3DPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.13166&json=true","fetch_graph":"https://pith.science/api/pith-number/MJJC3DPCUUPF25O75QEQKPRDYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MJJC3DPCUUPF25O75QEQKPRDYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/action/storage_attestation","attest_author":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/action/author_attestation","sign_citation":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/action/citation_signature","submit_replication":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/action/replication_record"}},"created_at":"2026-07-13T01:17:45.190866+00:00","updated_at":"2026-07-13T01:17:45.190866+00:00"}