{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MJJC3DPCUUPF25O75QEQKPRDYJ","short_pith_number":"pith:MJJC3DPC","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"},"canonical_sha256":"62522d8de2a51e5d75dfec09053e23c243d5e81ff544896d86d3fd3dfdf4b6d5","source":{"kind":"arxiv","id":"2508.13166","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.13166","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"2508.13166v8","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13166","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"MJJC3DPCUUPF","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"pith_short_16","alias_value":"MJJC3DPCUUPF25O7","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"pith_short_8","alias_value":"MJJC3DPC","created_at":"2026-07-13T01:17:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MJJC3DPCUUPF25O75QEQKPRDYJ","target":"record","payload":{"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"},"canonical_sha256":"62522d8de2a51e5d75dfec09053e23c243d5e81ff544896d86d3fd3dfdf4b6d5","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"},"source_kind":"arxiv","source_id":"2508.13166","source_version":8,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T01:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3asnkAk/GWkWcLR2PjwkhwaSMSC54ZjQCOr/XwuUacRqulGYaDnFWQwHHowTyDjDgdlxxjXRTdbYrOzkl/ojDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:46:28.302892Z"},"content_sha256":"bd47817ae410e5699ed5feca1e82442b29c37884f024293d426ffc4000e611fb","schema_version":"1.0","event_id":"sha256:bd47817ae410e5699ed5feca1e82442b29c37884f024293d426ffc4000e611fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MJJC3DPCUUPF25O75QEQKPRDYJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T01:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTrRVwqgOaCPOOszPkPhnE4M/ju7Eusb8q+wRovQW8jKdaYKYgNIls/XddU5bTvu6WNhunzGGPyH+NHTnYLbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:46:28.304877Z"},"content_sha256":"42c93ddf98705303c0d4d21384e92f3b05f3bc6190f45919cbd7b443b7f3ae52","schema_version":"1.0","event_id":"sha256:42c93ddf98705303c0d4d21384e92f3b05f3bc6190f45919cbd7b443b7f3ae52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/bundle.json","state_url":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T13:46:28Z","links":{"resolver":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ","bundle":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/bundle.json","state":"https://pith.science/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJJC3DPCUUPF25O75QEQKPRDYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MJJC3DPCUUPF25O75QEQKPRDYJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a353b69c4486c4fe964a945d831c6b897d5fb3c7e45119ae3df3787815122b4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-08-02T09:04:47Z","title_canon_sha256":"495e3fac5a5e72762e90c05cc0281e346ccd1d575626012daed16f595b30e7e0"},"schema_version":"1.0","source":{"id":"2508.13166","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.13166","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"2508.13166v8","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13166","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"MJJC3DPCUUPF","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"pith_short_16","alias_value":"MJJC3DPCUUPF25O7","created_at":"2026-07-13T01:17:45Z"},{"alias_kind":"pith_short_8","alias_value":"MJJC3DPC","created_at":"2026-07-13T01:17:45Z"}],"graph_snapshots":[{"event_id":"sha256:42c93ddf98705303c0d4d21384e92f3b05f3bc6190f45919cbd7b443b7f3ae52","target":"graph","created_at":"2026-07-13T01:17:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.13166/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Changryeol Lee (Independent Researcher)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-08-02T09:04:47Z","title":"Graph-Based Deterministic Polynomial Framwork for NP Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.13166","kind":"arxiv","version":8},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bd47817ae410e5699ed5feca1e82442b29c37884f024293d426ffc4000e611fb","target":"record","created_at":"2026-07-13T01:17:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a353b69c4486c4fe964a945d831c6b897d5fb3c7e45119ae3df3787815122b4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-08-02T09:04:47Z","title_canon_sha256":"495e3fac5a5e72762e90c05cc0281e346ccd1d575626012daed16f595b30e7e0"},"schema_version":"1.0","source":{"id":"2508.13166","kind":"arxiv","version":8}},"canonical_sha256":"62522d8de2a51e5d75dfec09053e23c243d5e81ff544896d86d3fd3dfdf4b6d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62522d8de2a51e5d75dfec09053e23c243d5e81ff544896d86d3fd3dfdf4b6d5","first_computed_at":"2026-07-13T01:17:45.190091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T01:17:45.190091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jUbrVQZVeXwrSt4ctOct7BCcVTbdkTnnh9vnOtfRO2a3TxsuwBhlGRLZH3M3AV0cqBBUQTDj1HQJlcQy7qkVCA==","signature_status":"signed_v1","signed_at":"2026-07-13T01:17:45.191771Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.13166","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd47817ae410e5699ed5feca1e82442b29c37884f024293d426ffc4000e611fb","sha256:42c93ddf98705303c0d4d21384e92f3b05f3bc6190f45919cbd7b443b7f3ae52"],"state_sha256":"dc6df4577b55d12a16613dd5928e6aaebbd06fc011f8a1043135fc184684431a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LyLetHYGga782TdUp4zbajIjaFgLvQd0wF9tnoNiXASfn0+5tZD/GJ9MuDM/seJfkbbKWGVmb2nKynLUe7EBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T13:46:28.314780Z","bundle_sha256":"6e09fd87c1d9e09c9ff7568fcf42fbdc25d9915e31cd6bfb2886cbe9034f44b0"}}