{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:2WDC2ETGIIK7QFIN2CRXOAICKS","short_pith_number":"pith:2WDC2ETG","canonical_record":{"source":{"id":"cs/0507026","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-07-08T16:22:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cb88d1476d6a2971f36d2d27ac166176d18324232eee92040a3727af33245143","abstract_canon_sha256":"1068626ecc0cec6ea3dcbcf3f19c194291f7f025ef617d7bcabece97725c39d0"},"schema_version":"1.0"},"canonical_sha256":"d5862d12664215f8150dd0a3770102548e8662fb65be44591480528c39ac24a1","source":{"kind":"arxiv","id":"cs/0507026","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0507026","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0507026v1","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0507026","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"2WDC2ETGIIK7","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"2WDC2ETGIIK7QFIN","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"2WDC2ETG","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:2WDC2ETGIIK7QFIN2CRXOAICKS","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0507026","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-07-08T16:22:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cb88d1476d6a2971f36d2d27ac166176d18324232eee92040a3727af33245143","abstract_canon_sha256":"1068626ecc0cec6ea3dcbcf3f19c194291f7f025ef617d7bcabece97725c39d0"},"schema_version":"1.0"},"canonical_sha256":"d5862d12664215f8150dd0a3770102548e8662fb65be44591480528c39ac24a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:49.069410Z","signature_b64":"mUOGYBgIU++F0aQXW9rLpm4mPzf5w/qipuIAczdHFiIYx8oYeGrhEr9ndhcvQW5Q1o2SQgcWxc237tw122rJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5862d12664215f8150dd0a3770102548e8662fb65be44591480528c39ac24a1","last_reissued_at":"2026-05-18T01:06:49.068741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:49.068741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0507026","source_version":1,"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-05-18T01:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KVGMXKKK8j+N9vm6ArAE47DFpUpxyvcu4SNMQEKKw++PhnHUTFDZZlxDVmt9WkZ3PRGpEx9dDau7f3L7iTouBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:13:43.419343Z"},"content_sha256":"99f7d9f4152a3621b975e30f29285bac8c2bf7ac0acce5d19243e29d1f238aee","schema_version":"1.0","event_id":"sha256:99f7d9f4152a3621b975e30f29285bac8c2bf7ac0acce5d19243e29d1f238aee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:2WDC2ETGIIK7QFIN2CRXOAICKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hard Problems of Algebraic Geometry Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qi Cheng","submitted_at":"2005-07-08T16:22:52Z","abstract_excerpt":"The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for general linear codes, the techniques used to prove their hardness often rely on the construction of artificial codes. In general, much less is known about the hardness of the specific classes of natural linear codes. In this paper, we show that both problems are\n NP-hard for algebraic geometry codes. We achieve this by reducing a well-known NP-complete probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0507026","kind":"arxiv","version":1},"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"},"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-05-18T01:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qq56dwtCHgO2+IUusOCvBkXh4stA9cnPZ8FIar2Kk+/OuHBcy3+rQC1pwqMzWDv+anuYoLZFSUpdrSecKflRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:13:43.419739Z"},"content_sha256":"0cb187bd4b28e6b64a10de1d23a2aa8910fcc0d83a91cfa8654c4fde03f57176","schema_version":"1.0","event_id":"sha256:0cb187bd4b28e6b64a10de1d23a2aa8910fcc0d83a91cfa8654c4fde03f57176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WDC2ETGIIK7QFIN2CRXOAICKS/bundle.json","state_url":"https://pith.science/pith/2WDC2ETGIIK7QFIN2CRXOAICKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WDC2ETGIIK7QFIN2CRXOAICKS/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-06-09T13:13:43Z","links":{"resolver":"https://pith.science/pith/2WDC2ETGIIK7QFIN2CRXOAICKS","bundle":"https://pith.science/pith/2WDC2ETGIIK7QFIN2CRXOAICKS/bundle.json","state":"https://pith.science/pith/2WDC2ETGIIK7QFIN2CRXOAICKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WDC2ETGIIK7QFIN2CRXOAICKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:2WDC2ETGIIK7QFIN2CRXOAICKS","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":"1068626ecc0cec6ea3dcbcf3f19c194291f7f025ef617d7bcabece97725c39d0","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-07-08T16:22:52Z","title_canon_sha256":"cb88d1476d6a2971f36d2d27ac166176d18324232eee92040a3727af33245143"},"schema_version":"1.0","source":{"id":"cs/0507026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0507026","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0507026v1","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0507026","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"2WDC2ETGIIK7","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"2WDC2ETGIIK7QFIN","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"2WDC2ETG","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:0cb187bd4b28e6b64a10de1d23a2aa8910fcc0d83a91cfa8654c4fde03f57176","target":"graph","created_at":"2026-05-18T01:06:49Z","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":"The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for general linear codes, the techniques used to prove their hardness often rely on the construction of artificial codes. In general, much less is known about the hardness of the specific classes of natural linear codes. In this paper, we show that both problems are\n NP-hard for algebraic geometry codes. We achieve this by reducing a well-known NP-complete probl","authors_text":"Qi Cheng","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-07-08T16:22:52Z","title":"Hard Problems of Algebraic Geometry Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0507026","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:99f7d9f4152a3621b975e30f29285bac8c2bf7ac0acce5d19243e29d1f238aee","target":"record","created_at":"2026-05-18T01:06:49Z","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":"1068626ecc0cec6ea3dcbcf3f19c194291f7f025ef617d7bcabece97725c39d0","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-07-08T16:22:52Z","title_canon_sha256":"cb88d1476d6a2971f36d2d27ac166176d18324232eee92040a3727af33245143"},"schema_version":"1.0","source":{"id":"cs/0507026","kind":"arxiv","version":1}},"canonical_sha256":"d5862d12664215f8150dd0a3770102548e8662fb65be44591480528c39ac24a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5862d12664215f8150dd0a3770102548e8662fb65be44591480528c39ac24a1","first_computed_at":"2026-05-18T01:06:49.068741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:49.068741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mUOGYBgIU++F0aQXW9rLpm4mPzf5w/qipuIAczdHFiIYx8oYeGrhEr9ndhcvQW5Q1o2SQgcWxc237tw122rJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:49.069410Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0507026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99f7d9f4152a3621b975e30f29285bac8c2bf7ac0acce5d19243e29d1f238aee","sha256:0cb187bd4b28e6b64a10de1d23a2aa8910fcc0d83a91cfa8654c4fde03f57176"],"state_sha256":"5ed7a5095d06dc683f481a6c012e55994b23f8b1516d3798a05d5786d9b04ac0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TPLZxFyLm5I3x5rrz8NSc/4OitpzI9NCVEDEAtqG9vcH68OUFLJfhWCeQYcrhrVCpQbaRwv/ozqk7mkECdSWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:13:43.421780Z","bundle_sha256":"faf7e6e93eeec18a81a49f832de379d3a246a9f8aa7d3e1260b92ddf8a04cdd5"}}