{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CXI5PQTXCHSKPPQQ7GOB7OGW3O","short_pith_number":"pith:CXI5PQTX","schema_version":"1.0","canonical_sha256":"15d1d7c27711e4a7be10f99c1fb8d6db8ba78f7530b220d64beb1343717aab3b","source":{"kind":"arxiv","id":"1008.4747","version":4},"attestation_state":"computed","paper":{"title":"Entanglement-assisted quantum low-density parity-check codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"David Clark, Maarten De Boeck, Peter Vandendriessche, Vladimir D. Tonchev, Yuichiro Fujiwara","submitted_at":"2010-08-27T16:10:08Z","abstract_excerpt":"This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes (EAQECCs) with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error correction performance, high rates, and low decoding complexity. The proposed method produces infinitely many new codes with a wide variety of parameters and entanglement requirements. Our framework encompass"},"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":"1008.4747","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-27T16:10:08Z","cross_cats_sorted":["math.CO","math.IT","quant-ph"],"title_canon_sha256":"0d2fac93440d55ed936dac1dc806665c1c0e71883ef97781590c4495cd6e0179","abstract_canon_sha256":"407c0824024b154c038468e2c970e7a78513cace223eb3179203ee40846582b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:09.009995Z","signature_b64":"DtleXN9QS/N18xHiB2bzLMe5VYOb7yqVjD6l+YNFybZyZu7sBD27u0J1RcKimM41hgBkau6Yv+uunRymagmmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d1d7c27711e4a7be10f99c1fb8d6db8ba78f7530b220d64beb1343717aab3b","last_reissued_at":"2026-05-18T03:47:09.009516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:09.009516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entanglement-assisted quantum low-density parity-check codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"David Clark, Maarten De Boeck, Peter Vandendriessche, Vladimir D. Tonchev, Yuichiro Fujiwara","submitted_at":"2010-08-27T16:10:08Z","abstract_excerpt":"This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes (EAQECCs) with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error correction performance, high rates, and low decoding complexity. The proposed method produces infinitely many new codes with a wide variety of parameters and entanglement requirements. Our framework encompass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4747","kind":"arxiv","version":4},"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":"1008.4747","created_at":"2026-05-18T03:47:09.009588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4747v4","created_at":"2026-05-18T03:47:09.009588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4747","created_at":"2026-05-18T03:47:09.009588+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXI5PQTXCHSK","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXI5PQTXCHSKPPQQ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXI5PQTX","created_at":"2026-05-18T12:26:06.534383+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/CXI5PQTXCHSKPPQQ7GOB7OGW3O","json":"https://pith.science/pith/CXI5PQTXCHSKPPQQ7GOB7OGW3O.json","graph_json":"https://pith.science/api/pith-number/CXI5PQTXCHSKPPQQ7GOB7OGW3O/graph.json","events_json":"https://pith.science/api/pith-number/CXI5PQTXCHSKPPQQ7GOB7OGW3O/events.json","paper":"https://pith.science/paper/CXI5PQTX"},"agent_actions":{"view_html":"https://pith.science/pith/CXI5PQTXCHSKPPQQ7GOB7OGW3O","download_json":"https://pith.science/pith/CXI5PQTXCHSKPPQQ7GOB7OGW3O.json","view_paper":"https://pith.science/paper/CXI5PQTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4747&json=true","fetch_graph":"https://pith.science/api/pith-number/CXI5PQTXCHSKPPQQ7GOB7OGW3O/graph.json","fetch_events":"https://pith.science/api/pith-number/CXI5PQTXCHSKPPQQ7GOB7OGW3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXI5PQTXCHSKPPQQ7GOB7OGW3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXI5PQTXCHSKPPQQ7GOB7OGW3O/action/storage_attestation","attest_author":"https://pith.science/pith/CXI5PQTXCHSKPPQQ7GOB7OGW3O/action/author_attestation","sign_citation":"https://pith.science/pith/CXI5PQTXCHSKPPQQ7GOB7OGW3O/action/citation_signature","submit_replication":"https://pith.science/pith/CXI5PQTXCHSKPPQQ7GOB7OGW3O/action/replication_record"}},"created_at":"2026-05-18T03:47:09.009588+00:00","updated_at":"2026-05-18T03:47:09.009588+00:00"}