{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7NPXTRW7LRQQE4V3S7DYUEI7ZP","short_pith_number":"pith:7NPXTRW7","canonical_record":{"source":{"id":"1306.5173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T15:32:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"51f95b5f352f5460288b05189b6bb60fa64d291fa2ae9b5029892132a198d79f","abstract_canon_sha256":"82f0d0bc343b50913021d9213e0da23393fb3cb49e949efc138f64c954835b7f"},"schema_version":"1.0"},"canonical_sha256":"fb5f79c6df5c610272bb97c78a111fcbfcec1785116fb5297867acd881eb7128","source":{"kind":"arxiv","id":"1306.5173","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5173","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5173v2","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5173","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"7NPXTRW7LRQQ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7NPXTRW7LRQQE4V3","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7NPXTRW7","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7NPXTRW7LRQQE4V3S7DYUEI7ZP","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T15:32:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"51f95b5f352f5460288b05189b6bb60fa64d291fa2ae9b5029892132a198d79f","abstract_canon_sha256":"82f0d0bc343b50913021d9213e0da23393fb3cb49e949efc138f64c954835b7f"},"schema_version":"1.0"},"canonical_sha256":"fb5f79c6df5c610272bb97c78a111fcbfcec1785116fb5297867acd881eb7128","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:42.025374Z","signature_b64":"Svv+qczU85JhTUQgcK1QqiIEqmoCowF0+34pKGkCSkRmznaKu9lOvFyQtKs3qAFU66rfBY8YTOZFUiGn4k2FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb5f79c6df5c610272bb97c78a111fcbfcec1785116fb5297867acd881eb7128","last_reissued_at":"2026-05-18T03:18:42.024603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:42.024603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5173","source_version":2,"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-18T03:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cg552NHlZn2Ho3L8foEKTyWo1etWSg1Vm6tRynQ469eyOGpGd355XzVJgKaaXKLu//BbHymreghqwn44lglYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:08:25.291478Z"},"content_sha256":"27be8deeda93b6834b081400ec9b09b74a55a249b3e76688b8e4c2c154ef67c4","schema_version":"1.0","event_id":"sha256:27be8deeda93b6834b081400ec9b09b74a55a249b3e76688b8e4c2c154ef67c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7NPXTRW7LRQQE4V3S7DYUEI7ZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hardnesses of Several Quantum Decoding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Chung-Chin Lu, Kao-Yueh Kuo","submitted_at":"2013-06-21T15:32:32Z","abstract_excerpt":"We classify the time complexities of three important decoding problems for quantum stabilizer codes. First, regardless of the channel model, quantum bounded distance decoding is shown to be NP-hard, like what Berlekamp, McEliece and Tilborg did for classical binary linear codes in 1978. Then over the depolarizing channel, the decoding problems for finding a most likely error and for minimizing the decoding error probability are also shown to be NP-hard. Our results indicate that finding a polynomial-time decoding algorithm for general stabilizer codes may be impossible, but this, on the other "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5173","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"},"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-18T03:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AA0dXR9EOflztcdX9DVlLcFEBL/4Hi9MUH5Ue0QyTDJ+q1GjPNa4TzNPoBSl5xv2LprnaZcOgqipHAJAuvYPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:08:25.291832Z"},"content_sha256":"9322b99d1800de8917264f0005de4e94145aa05e672503d14e491fe82451a5a8","schema_version":"1.0","event_id":"sha256:9322b99d1800de8917264f0005de4e94145aa05e672503d14e491fe82451a5a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/bundle.json","state_url":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/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-05-31T20:08:25Z","links":{"resolver":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP","bundle":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/bundle.json","state":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7NPXTRW7LRQQE4V3S7DYUEI7ZP","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":"82f0d0bc343b50913021d9213e0da23393fb3cb49e949efc138f64c954835b7f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T15:32:32Z","title_canon_sha256":"51f95b5f352f5460288b05189b6bb60fa64d291fa2ae9b5029892132a198d79f"},"schema_version":"1.0","source":{"id":"1306.5173","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5173","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5173v2","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5173","created_at":"2026-05-18T03:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"7NPXTRW7LRQQ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7NPXTRW7LRQQE4V3","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7NPXTRW7","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:9322b99d1800de8917264f0005de4e94145aa05e672503d14e491fe82451a5a8","target":"graph","created_at":"2026-05-18T03:18:42Z","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 classify the time complexities of three important decoding problems for quantum stabilizer codes. First, regardless of the channel model, quantum bounded distance decoding is shown to be NP-hard, like what Berlekamp, McEliece and Tilborg did for classical binary linear codes in 1978. Then over the depolarizing channel, the decoding problems for finding a most likely error and for minimizing the decoding error probability are also shown to be NP-hard. Our results indicate that finding a polynomial-time decoding algorithm for general stabilizer codes may be impossible, but this, on the other ","authors_text":"Chung-Chin Lu, Kao-Yueh Kuo","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T15:32:32Z","title":"On the Hardnesses of Several Quantum Decoding Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5173","kind":"arxiv","version":2},"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:27be8deeda93b6834b081400ec9b09b74a55a249b3e76688b8e4c2c154ef67c4","target":"record","created_at":"2026-05-18T03:18:42Z","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":"82f0d0bc343b50913021d9213e0da23393fb3cb49e949efc138f64c954835b7f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T15:32:32Z","title_canon_sha256":"51f95b5f352f5460288b05189b6bb60fa64d291fa2ae9b5029892132a198d79f"},"schema_version":"1.0","source":{"id":"1306.5173","kind":"arxiv","version":2}},"canonical_sha256":"fb5f79c6df5c610272bb97c78a111fcbfcec1785116fb5297867acd881eb7128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb5f79c6df5c610272bb97c78a111fcbfcec1785116fb5297867acd881eb7128","first_computed_at":"2026-05-18T03:18:42.024603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:42.024603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Svv+qczU85JhTUQgcK1QqiIEqmoCowF0+34pKGkCSkRmznaKu9lOvFyQtKs3qAFU66rfBY8YTOZFUiGn4k2FDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:42.025374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5173","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27be8deeda93b6834b081400ec9b09b74a55a249b3e76688b8e4c2c154ef67c4","sha256:9322b99d1800de8917264f0005de4e94145aa05e672503d14e491fe82451a5a8"],"state_sha256":"2e4deeef6ba65525d1fcf229d50dac0f43d7a7332557ca4fe419d0ba39b2bf24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSRlKNSZlEUsC8KYPSrHHrOnq2n6KfE9LEkf9lyWpvZFhLdanwQBbsxDiDZWEHwIxb3GcS3Aqxd7EwMmE3skBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:08:25.294673Z","bundle_sha256":"23c2509f8df674993df0b2b728cca7d798e570b1785f2d50c42771b22d68c696"}}