{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZHHU72LA72T532N6RGVUB2A3L4","short_pith_number":"pith:ZHHU72LA","schema_version":"1.0","canonical_sha256":"c9cf4fe960fea7dde9be89ab40e81b5f1008a4da459aaa18a3ccb5ad0a2c1ea7","source":{"kind":"arxiv","id":"2602.10991","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2602.10991","created_at":"2026-07-14T01:20:54.145436+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.10991v4","created_at":"2026-07-14T01:20:54.145436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10991","created_at":"2026-07-14T01:20:54.145436+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHHU72LA72T5","created_at":"2026-07-14T01:20:54.145436+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHHU72LA72T532N6","created_at":"2026-07-14T01:20:54.145436+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHHU72LA","created_at":"2026-07-14T01:20:54.145436+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/ZHHU72LA72T532N6RGVUB2A3L4","json":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4.json","graph_json":"https://pith.science/api/pith-number/ZHHU72LA72T532N6RGVUB2A3L4/graph.json","events_json":"https://pith.science/api/pith-number/ZHHU72LA72T532N6RGVUB2A3L4/events.json","paper":"https://pith.science/paper/ZHHU72LA"},"agent_actions":{"view_html":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4","download_json":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4.json","view_paper":"https://pith.science/paper/ZHHU72LA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.10991&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHHU72LA72T532N6RGVUB2A3L4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHHU72LA72T532N6RGVUB2A3L4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4/action/storage_attestation","attest_author":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4/action/author_attestation","sign_citation":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4/action/citation_signature","submit_replication":"https://pith.science/pith/ZHHU72LA72T532N6RGVUB2A3L4/action/replication_record"}},"created_at":"2026-07-14T01:20:54.145436+00:00","updated_at":"2026-07-14T01:20:54.145436+00:00"}