{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZHHU72LA72T532N6RGVUB2A3L4","short_pith_number":"pith:ZHHU72LA","canonical_record":{"source":{"id":"2602.10991","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-02-11T16:17:36Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"91058c9db97a36f0cd45a1d48aab32df510584be816d9705ed11c239da9f1a7b","abstract_canon_sha256":"fc14b05c96e9ec20c23319735eb0a46f3ec27768856af898345a23faa8858c07"},"schema_version":"1.0"},"canonical_sha256":"c9cf4fe960fea7dde9be89ab40e81b5f1008a4da459aaa18a3ccb5ad0a2c1ea7","source":{"kind":"arxiv","id":"2602.10991","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.10991","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"2602.10991v4","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10991","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZHHU72LA72T5","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_16","alias_value":"ZHHU72LA72T532N6","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_8","alias_value":"ZHHU72LA","created_at":"2026-07-14T01:20:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZHHU72LA72T532N6RGVUB2A3L4","target":"record","payload":{"canonical_record":{"source":{"id":"2602.10991","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-02-11T16:17:36Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"91058c9db97a36f0cd45a1d48aab32df510584be816d9705ed11c239da9f1a7b","abstract_canon_sha256":"fc14b05c96e9ec20c23319735eb0a46f3ec27768856af898345a23faa8858c07"},"schema_version":"1.0"},"canonical_sha256":"c9cf4fe960fea7dde9be89ab40e81b5f1008a4da459aaa18a3ccb5ad0a2c1ea7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:20:54.146285Z","signature_b64":"jZWBdJIyIGYySYzBseHBk3dYojoMttGpk9SRqX5UTizVn/aJqbM620rIoYgeZBAoT25rg2INoLVZP6lrPDoXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9cf4fe960fea7dde9be89ab40e81b5f1008a4da459aaa18a3ccb5ad0a2c1ea7","last_reissued_at":"2026-07-14T01:20:54.144986Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:20:54.144986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.10991","source_version":4,"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-14T01:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iLEUdj6ZYr/e+KmBtSYI7h1PN/z0gentM3b4f2Slpr8USBaJWEBJF7fcETXupvubAYHyx0PWuDjUERmuMLApBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:44:33.834231Z"},"content_sha256":"f609502d358e1b799b7306978179066d4791537f376bc698547323671c8dd180","schema_version":"1.0","event_id":"sha256:f609502d358e1b799b7306978179066d4791537f376bc698547323671c8dd180"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZHHU72LA72T532N6RGVUB2A3L4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Fully specified deterministic Turing machines solve SAT and Subset-Sum in polynomial time via an improved verifier simulation framework.","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Changryeol Lee (Independent Researcher)","submitted_at":"2026-02-11T16:17:36Z","abstract_excerpt":"While prior work established a verifier-based polynomial-time framework for NP, explicit deterministic machines for concrete NP-complete problems have remained elusive.\n  In this paper, we construct fully specified deterministic certificate-oblivious verifier Turing machines for SAT and Subset-Sum within an improved NP verifier simulation framework. A key contribution of this work is the development of a functional implementation that bridges the gap between theoretical proofs and executable software. Our improved feasible-graph construction yields a theoretical reduction in the asymptotic pol"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We construct fully specified deterministic Turing Machines (DTMs) for SAT and Subset-Sum within an improved NP verifier simulation framework. The complete Python implementation behaves in accordance with the predicted polynomial-time bounds.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the improved feasible-graph construction and edge-extension mechanisms convert the nondeterministic verifier simulation into a deterministic polynomial-time procedure without introducing hidden exponential factors in the worst case.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Authors supply deterministic polynomial-time Turing machines and Python code for the NP-complete problems SAT and Subset-Sum via an enhanced NP verifier simulation framework.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Fully specified deterministic Turing machines solve SAT and Subset-Sum in polynomial time via an improved verifier simulation framework.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9d90e31faf72c0cf9deb0568249f9c809b85d5d3b946f6d3d7f841d817c7319f"},"source":{"id":"2602.10991","kind":"arxiv","version":4},"verdict":{"id":"63a00b2a-b5bb-4fde-bab3-ad3da7b56f39","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T05:41:28.825613Z","strongest_claim":"We construct fully specified deterministic Turing Machines (DTMs) for SAT and Subset-Sum within an improved NP verifier simulation framework. The complete Python implementation behaves in accordance with the predicted polynomial-time bounds.","one_line_summary":"Authors supply deterministic polynomial-time Turing machines and Python code for the NP-complete problems SAT and Subset-Sum via an enhanced NP verifier simulation framework.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the improved feasible-graph construction and edge-extension mechanisms convert the nondeterministic verifier simulation into a deterministic polynomial-time procedure without introducing hidden exponential factors in the worst case.","pith_extraction_headline":"Fully specified deterministic Turing machines solve SAT and Subset-Sum in polynomial time via an improved verifier simulation framework."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.10991/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":"63a00b2a-b5bb-4fde-bab3-ad3da7b56f39"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T01:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaNIAUg5LL6Z3ZICXY1rbJ5yRIEhbee8D+3M3S0KYl2L++159cS956vfse+PH/4WRAX07kmjYpQBO17W/B/xDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:44:33.834886Z"},"content_sha256":"57386505c07b4f470a4b4ba438b60fab60a2bd16704c46af153bf835bec93f3d","schema_version":"1.0","event_id":"sha256:57386505c07b4f470a4b4ba438b60fab60a2bd16704c46af153bf835bec93f3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4/bundle.json","state_url":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHHU72LA72T532N6RGVUB2A3L4/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-12T09:44:33Z","links":{"resolver":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4","bundle":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4/bundle.json","state":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHHU72LA72T532N6RGVUB2A3L4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZHHU72LA72T532N6RGVUB2A3L4","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":"fc14b05c96e9ec20c23319735eb0a46f3ec27768856af898345a23faa8858c07","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-02-11T16:17:36Z","title_canon_sha256":"91058c9db97a36f0cd45a1d48aab32df510584be816d9705ed11c239da9f1a7b"},"schema_version":"1.0","source":{"id":"2602.10991","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.10991","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"2602.10991v4","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10991","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZHHU72LA72T5","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_16","alias_value":"ZHHU72LA72T532N6","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_8","alias_value":"ZHHU72LA","created_at":"2026-07-14T01:20:54Z"}],"graph_snapshots":[{"event_id":"sha256:57386505c07b4f470a4b4ba438b60fab60a2bd16704c46af153bf835bec93f3d","target":"graph","created_at":"2026-07-14T01:20:54Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We construct fully specified deterministic Turing Machines (DTMs) for SAT and Subset-Sum within an improved NP verifier simulation framework. The complete Python implementation behaves in accordance with the predicted polynomial-time bounds."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the improved feasible-graph construction and edge-extension mechanisms convert the nondeterministic verifier simulation into a deterministic polynomial-time procedure without introducing hidden exponential factors in the worst case."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Authors supply deterministic polynomial-time Turing machines and Python code for the NP-complete problems SAT and Subset-Sum via an enhanced NP verifier simulation framework."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Fully specified deterministic Turing machines solve SAT and Subset-Sum in polynomial time via an improved verifier simulation framework."}],"snapshot_sha256":"9d90e31faf72c0cf9deb0568249f9c809b85d5d3b946f6d3d7f841d817c7319f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.10991/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While prior work established a verifier-based polynomial-time framework for NP, explicit deterministic machines for concrete NP-complete problems have remained elusive.\n  In this paper, we construct fully specified deterministic certificate-oblivious verifier Turing machines for SAT and Subset-Sum within an improved NP verifier simulation framework. A key contribution of this work is the development of a functional implementation that bridges the gap between theoretical proofs and executable software. Our improved feasible-graph construction yields a theoretical reduction in the asymptotic pol","authors_text":"Changryeol Lee (Independent Researcher)","cross_cats":["cs.FL"],"headline":"Fully specified deterministic Turing machines solve SAT and Subset-Sum in polynomial time via an improved verifier simulation framework.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-02-11T16:17:36Z","title":"Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.10991","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-16T05:41:28.825613Z","id":"63a00b2a-b5bb-4fde-bab3-ad3da7b56f39","model_set":{"reader":"grok-4.3"},"one_line_summary":"Authors supply deterministic polynomial-time Turing machines and Python code for the NP-complete problems SAT and Subset-Sum via an enhanced NP verifier simulation framework.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Fully specified deterministic Turing machines solve SAT and Subset-Sum in polynomial time via an improved verifier simulation framework.","strongest_claim":"We construct fully specified deterministic Turing Machines (DTMs) for SAT and Subset-Sum within an improved NP verifier simulation framework. The complete Python implementation behaves in accordance with the predicted polynomial-time bounds.","weakest_assumption":"That the improved feasible-graph construction and edge-extension mechanisms convert the nondeterministic verifier simulation into a deterministic polynomial-time procedure without introducing hidden exponential factors in the worst case."}},"verdict_id":"63a00b2a-b5bb-4fde-bab3-ad3da7b56f39"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f609502d358e1b799b7306978179066d4791537f376bc698547323671c8dd180","target":"record","created_at":"2026-07-14T01:20:54Z","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":"fc14b05c96e9ec20c23319735eb0a46f3ec27768856af898345a23faa8858c07","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-02-11T16:17:36Z","title_canon_sha256":"91058c9db97a36f0cd45a1d48aab32df510584be816d9705ed11c239da9f1a7b"},"schema_version":"1.0","source":{"id":"2602.10991","kind":"arxiv","version":4}},"canonical_sha256":"c9cf4fe960fea7dde9be89ab40e81b5f1008a4da459aaa18a3ccb5ad0a2c1ea7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9cf4fe960fea7dde9be89ab40e81b5f1008a4da459aaa18a3ccb5ad0a2c1ea7","first_computed_at":"2026-07-14T01:20:54.144986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:20:54.144986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jZWBdJIyIGYySYzBseHBk3dYojoMttGpk9SRqX5UTizVn/aJqbM620rIoYgeZBAoT25rg2INoLVZP6lrPDoXAA==","signature_status":"signed_v1","signed_at":"2026-07-14T01:20:54.146285Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.10991","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f609502d358e1b799b7306978179066d4791537f376bc698547323671c8dd180","sha256:57386505c07b4f470a4b4ba438b60fab60a2bd16704c46af153bf835bec93f3d"],"state_sha256":"d57f34a1caf2b4bbc986542ac7f0694d5fc039df2f17900537d6c583f663f9f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"el0NwVdpccOgfE1zdH6wvOVabOKURWlezgS60+cPXtxFlbgiqozhbuFCMd/2bl+fVU8qWiR7pA3MPqIjuVQ/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T09:44:33.839575Z","bundle_sha256":"9cbd91ab3ba7bc9f6645200fd0837f8e6d4cae08ee6817d39513bd8c9626bc57"}}