{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RICRTVFD62HYO5JNFSVHFSFXKF","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":"82724c024eef3149180f74240ad2121100c48e33e0442c3e6b748b066b4d909e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-07T16:40:59Z","title_canon_sha256":"c5e742cdcff512dd83d02a9f4aa2798ea12033dc29313179bcc6f8b6d9f1a635"},"schema_version":"1.0","source":{"id":"1010.1481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1481","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1481v1","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1481","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"RICRTVFD62HY","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RICRTVFD62HYO5JN","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RICRTVFD","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:f5199b9387b2f1d0bc5dfc5ea6d5cc606aee96221c7dac7f13fa0cb45f01cdd0","target":"graph","created_at":"2026-05-18T04:39:40Z","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"},"paper":{"abstract_excerpt":"We present a simple deterministic gap-preserving reduction from SAT to the Minimum Distance of Code Problem over $\\F_2$. We also show how to extend the reduction to work over any finite field. Previously a randomized reduction was known due to Dumer, Micciancio, and Sudan, which was recently derandomized by Cheng and Wan. These reductions rely on highly non-trivial coding theoretic constructions whereas our reduction is elementary.\n  As an additional feature, our reduction gives a constant factor hardness even for asymptotically good codes, i.e., having constant rate and relative distance. Pre","authors_text":"Per Austrin, Subhash Khot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-07T16:40:59Z","title":"A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1481","kind":"arxiv","version":1},"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:0c2c4562af8d221c244aeff4d72fa526d216b0cdfbdc26cb1b12199f1f5c552c","target":"record","created_at":"2026-05-18T04:39:40Z","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":"82724c024eef3149180f74240ad2121100c48e33e0442c3e6b748b066b4d909e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-07T16:40:59Z","title_canon_sha256":"c5e742cdcff512dd83d02a9f4aa2798ea12033dc29313179bcc6f8b6d9f1a635"},"schema_version":"1.0","source":{"id":"1010.1481","kind":"arxiv","version":1}},"canonical_sha256":"8a0519d4a3f68f87752d2caa72c8b751684862fc6bc677740de7758d7fbb4de2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a0519d4a3f68f87752d2caa72c8b751684862fc6bc677740de7758d7fbb4de2","first_computed_at":"2026-05-18T04:39:40.989837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:40.989837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TviRJTCo0f6jMLCH+nyLf10Jg69G4vPrelmpfvMMwf7BfBq+oix6m+ySnPWt7/NsfMjZTSFw3tXfRzoqBsztCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:40.990488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c2c4562af8d221c244aeff4d72fa526d216b0cdfbdc26cb1b12199f1f5c552c","sha256:f5199b9387b2f1d0bc5dfc5ea6d5cc606aee96221c7dac7f13fa0cb45f01cdd0"],"state_sha256":"5c1b636516beeef2b5950c951a11b3515a83d411eb3426f8860ff8619c2f19de"}