{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FIZHE7FLWJM3TRPVMVVFF6WGDH","short_pith_number":"pith:FIZHE7FL","schema_version":"1.0","canonical_sha256":"2a32727cabb259b9c5f5656a52fac619dc81e55cb95a464f821b47ab60388f1d","source":{"kind":"arxiv","id":"1208.0257","version":2},"attestation_state":"computed","paper":{"title":"Hamming Approximation of NP Witnesses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel Sheldon, Neal E. Young","submitted_at":"2012-08-01T15:48:57Z","abstract_excerpt":"Given a satisfiable 3-SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider any polynomial-time verifier for any NP-complete language. A d(n)-Hamming-approximation algorithm for the verifier is one that, given any member x of the language, outputs in polynomial time a string a with Hamming distance at most d(n) to some witness w, where (x,w) is accepted by the verifier. Previous results have shown that, if P != NP, then every NP-complete language has a verifier for which there is no (n/2-n^("},"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":"1208.0257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-08-01T15:48:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"de2b356be5dae16c9f6b4f20fe84b75a9232107d929001e9910d7d156384c678","abstract_canon_sha256":"7d0791bd57ff59c8ee339823af88a791713bda74d677a81252daeda30725be9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:49.759936Z","signature_b64":"qmYFvbDln6cgal0dSPubkLUfegmU6SsD+rLS8N2yVKW0zvTqoq5Aa00FNk59dDhP95/5Iztg4hLcvkGbUZXNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a32727cabb259b9c5f5656a52fac619dc81e55cb95a464f821b47ab60388f1d","last_reissued_at":"2026-05-18T03:16:49.759169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:49.759169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamming Approximation of NP Witnesses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel Sheldon, Neal E. Young","submitted_at":"2012-08-01T15:48:57Z","abstract_excerpt":"Given a satisfiable 3-SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider any polynomial-time verifier for any NP-complete language. A d(n)-Hamming-approximation algorithm for the verifier is one that, given any member x of the language, outputs in polynomial time a string a with Hamming distance at most d(n) to some witness w, where (x,w) is accepted by the verifier. Previous results have shown that, if P != NP, then every NP-complete language has a verifier for which there is no (n/2-n^("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0257","kind":"arxiv","version":2},"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":"1208.0257","created_at":"2026-05-18T03:16:49.759297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0257v2","created_at":"2026-05-18T03:16:49.759297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0257","created_at":"2026-05-18T03:16:49.759297+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIZHE7FLWJM3","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIZHE7FLWJM3TRPV","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIZHE7FL","created_at":"2026-05-18T12:27:06.952714+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/FIZHE7FLWJM3TRPVMVVFF6WGDH","json":"https://pith.science/pith/FIZHE7FLWJM3TRPVMVVFF6WGDH.json","graph_json":"https://pith.science/api/pith-number/FIZHE7FLWJM3TRPVMVVFF6WGDH/graph.json","events_json":"https://pith.science/api/pith-number/FIZHE7FLWJM3TRPVMVVFF6WGDH/events.json","paper":"https://pith.science/paper/FIZHE7FL"},"agent_actions":{"view_html":"https://pith.science/pith/FIZHE7FLWJM3TRPVMVVFF6WGDH","download_json":"https://pith.science/pith/FIZHE7FLWJM3TRPVMVVFF6WGDH.json","view_paper":"https://pith.science/paper/FIZHE7FL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0257&json=true","fetch_graph":"https://pith.science/api/pith-number/FIZHE7FLWJM3TRPVMVVFF6WGDH/graph.json","fetch_events":"https://pith.science/api/pith-number/FIZHE7FLWJM3TRPVMVVFF6WGDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIZHE7FLWJM3TRPVMVVFF6WGDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIZHE7FLWJM3TRPVMVVFF6WGDH/action/storage_attestation","attest_author":"https://pith.science/pith/FIZHE7FLWJM3TRPVMVVFF6WGDH/action/author_attestation","sign_citation":"https://pith.science/pith/FIZHE7FLWJM3TRPVMVVFF6WGDH/action/citation_signature","submit_replication":"https://pith.science/pith/FIZHE7FLWJM3TRPVMVVFF6WGDH/action/replication_record"}},"created_at":"2026-05-18T03:16:49.759297+00:00","updated_at":"2026-05-18T03:16:49.759297+00:00"}