{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IP6WJKPRDYQLWB3I3J5NQNBUL3","short_pith_number":"pith:IP6WJKPR","canonical_record":{"source":{"id":"1405.0348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-02T06:05:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b5a1461f7fbf96d09cc4043ad8eab60b7b2818d5ff45fc68bb22b5c102351a11","abstract_canon_sha256":"fcb8b4a99672e0a310f68fe0e793c21b1eed906e736ee75f3870a0d0f7b2869b"},"schema_version":"1.0"},"canonical_sha256":"43fd64a9f11e20bb0768da7ad834345ec79600aa92af402c806cb0df71d81c4e","source":{"kind":"arxiv","id":"1405.0348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0348","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0348v1","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0348","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"IP6WJKPRDYQL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IP6WJKPRDYQLWB3I","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IP6WJKPR","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IP6WJKPRDYQLWB3I3J5NQNBUL3","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-02T06:05:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b5a1461f7fbf96d09cc4043ad8eab60b7b2818d5ff45fc68bb22b5c102351a11","abstract_canon_sha256":"fcb8b4a99672e0a310f68fe0e793c21b1eed906e736ee75f3870a0d0f7b2869b"},"schema_version":"1.0"},"canonical_sha256":"43fd64a9f11e20bb0768da7ad834345ec79600aa92af402c806cb0df71d81c4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:48.160428Z","signature_b64":"Pbh/pZiY2v6csweJCfg6MKQcs0rT+N5ZA0xqPDReKT5LOPT39lzU6RxhUL7ue6k5m66WqfnmzBOaDbNq5udWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43fd64a9f11e20bb0768da7ad834345ec79600aa92af402c806cb0df71d81c4e","last_reissued_at":"2026-05-18T02:52:48.159941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:48.159941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0348","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-18T02:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+S/Uy1G+KeSirJM25+qVZfI7Gsu9n40YR3tfZoRVYrbFQHDliS40VW9WgQ0HAOxJVd6gUFwZmnbcKcjf1kxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:07:51.900991Z"},"content_sha256":"0a3ab0d1bade45652ee69ce2883f7d69a851e917b92c435a93fae7e7b4b7f1e6","schema_version":"1.0","event_id":"sha256:0a3ab0d1bade45652ee69ce2883f7d69a851e917b92c435a93fae7e7b4b7f1e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IP6WJKPRDYQLWB3I3J5NQNBUL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Numerical Techniques for Finding the Distances of Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko","submitted_at":"2014-05-02T06:05:03Z","abstract_excerpt":"We survey the existing techniques for calculating code distances of classical codes and apply these techniques to generic quantum codes. For classical and quantum LDPC codes, we also present a new linked-cluster technique. It reduces complexity exponent of all existing deterministic techniques designed for codes with small relative distances (which include all known families of quantum LDPC codes), and also surpasses the probabilistic technique for sufficiently high code rates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0348","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-18T02:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axn3kYR2gDe7N+vZWnbuTZlOw2lvL/I7ZGYdenGqFUIdiMoy6BLeEUi9hUGTErBiD2bUjpjUGC1nG/5S6foYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:07:51.901359Z"},"content_sha256":"1556954deabcb8c3ec6a7886a708378518ac02cc173b83d88607e6f3f131e9ab","schema_version":"1.0","event_id":"sha256:1556954deabcb8c3ec6a7886a708378518ac02cc173b83d88607e6f3f131e9ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IP6WJKPRDYQLWB3I3J5NQNBUL3/bundle.json","state_url":"https://pith.science/pith/IP6WJKPRDYQLWB3I3J5NQNBUL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IP6WJKPRDYQLWB3I3J5NQNBUL3/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-03T20:07:51Z","links":{"resolver":"https://pith.science/pith/IP6WJKPRDYQLWB3I3J5NQNBUL3","bundle":"https://pith.science/pith/IP6WJKPRDYQLWB3I3J5NQNBUL3/bundle.json","state":"https://pith.science/pith/IP6WJKPRDYQLWB3I3J5NQNBUL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IP6WJKPRDYQLWB3I3J5NQNBUL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IP6WJKPRDYQLWB3I3J5NQNBUL3","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":"fcb8b4a99672e0a310f68fe0e793c21b1eed906e736ee75f3870a0d0f7b2869b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-02T06:05:03Z","title_canon_sha256":"b5a1461f7fbf96d09cc4043ad8eab60b7b2818d5ff45fc68bb22b5c102351a11"},"schema_version":"1.0","source":{"id":"1405.0348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0348","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0348v1","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0348","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"IP6WJKPRDYQL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IP6WJKPRDYQLWB3I","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IP6WJKPR","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:1556954deabcb8c3ec6a7886a708378518ac02cc173b83d88607e6f3f131e9ab","target":"graph","created_at":"2026-05-18T02:52:48Z","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 survey the existing techniques for calculating code distances of classical codes and apply these techniques to generic quantum codes. For classical and quantum LDPC codes, we also present a new linked-cluster technique. It reduces complexity exponent of all existing deterministic techniques designed for codes with small relative distances (which include all known families of quantum LDPC codes), and also surpasses the probabilistic technique for sufficiently high code rates.","authors_text":"Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-02T06:05:03Z","title":"Numerical Techniques for Finding the Distances of Quantum Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0348","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:0a3ab0d1bade45652ee69ce2883f7d69a851e917b92c435a93fae7e7b4b7f1e6","target":"record","created_at":"2026-05-18T02:52:48Z","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":"fcb8b4a99672e0a310f68fe0e793c21b1eed906e736ee75f3870a0d0f7b2869b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-02T06:05:03Z","title_canon_sha256":"b5a1461f7fbf96d09cc4043ad8eab60b7b2818d5ff45fc68bb22b5c102351a11"},"schema_version":"1.0","source":{"id":"1405.0348","kind":"arxiv","version":1}},"canonical_sha256":"43fd64a9f11e20bb0768da7ad834345ec79600aa92af402c806cb0df71d81c4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43fd64a9f11e20bb0768da7ad834345ec79600aa92af402c806cb0df71d81c4e","first_computed_at":"2026-05-18T02:52:48.159941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:48.159941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pbh/pZiY2v6csweJCfg6MKQcs0rT+N5ZA0xqPDReKT5LOPT39lzU6RxhUL7ue6k5m66WqfnmzBOaDbNq5udWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:48.160428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a3ab0d1bade45652ee69ce2883f7d69a851e917b92c435a93fae7e7b4b7f1e6","sha256:1556954deabcb8c3ec6a7886a708378518ac02cc173b83d88607e6f3f131e9ab"],"state_sha256":"b5d5bc49ea0afbbd632b4f9fe08b7613654a0a01288f923a8e0b46aa2bb40ecf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R5ajZswDu0IHMnjnkhPv+L792cJKBkhnnJis5Lcc/txQlaWtvlZZfMqymrYxTqlD3DTqIZQC/EMfIwtqfV4nCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:07:51.904363Z","bundle_sha256":"fc1146e1551e365d31f03ee4dc9d66e307f84bad5719338d3e7228ab4f972040"}}