{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EZQQQ6HX72QPATBJDTEJZF3OXR","short_pith_number":"pith:EZQQQ6HX","schema_version":"1.0","canonical_sha256":"26610878f7fea0f04c291cc89c976ebc5f2902a9e9000c55cc8ec10b176538d0","source":{"kind":"arxiv","id":"1904.02703","version":3},"attestation_state":"computed","paper":{"title":"Degenerate Quantum LDPC Codes With Good Finite Length Performance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Gleb Kalachev, Pavel Panteleev","submitted_at":"2019-04-04T17:58:58Z","abstract_excerpt":"We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that with the help of OSD-like post-processing the performance of the standard belief propagation (BP) decoder on many QLDPC codes can be improved by several orders of magnitude. Using this new BP-OSD decoder we study the performance of several known classes of degenerate QLDPC codes including hypergraph product codes, hyperbicycle codes, homological product codes, and Haah"},"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":"1904.02703","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-04-04T17:58:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3591c8b19a4dc64c71d11eefa80f931fe9634ee086dd23818206f1b80348b4f0","abstract_canon_sha256":"26faae4aaa58ae533feb9d4666783e6d67e51bab38b3f26571256d636b4d2738"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:34:19.051925Z","signature_b64":"sEqspK0lL9heMuID9oRLtp+lBlqH7phntBoO9ue1DJpHG/d6370hPXpqak1mXKrO4gdPQMjoY/pwYY8hTi7UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26610878f7fea0f04c291cc89c976ebc5f2902a9e9000c55cc8ec10b176538d0","last_reissued_at":"2026-07-05T03:34:19.051482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:34:19.051482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degenerate Quantum LDPC Codes With Good Finite Length Performance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Gleb Kalachev, Pavel Panteleev","submitted_at":"2019-04-04T17:58:58Z","abstract_excerpt":"We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that with the help of OSD-like post-processing the performance of the standard belief propagation (BP) decoder on many QLDPC codes can be improved by several orders of magnitude. Using this new BP-OSD decoder we study the performance of several known classes of degenerate QLDPC codes including hypergraph product codes, hyperbicycle codes, homological product codes, and Haah"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02703","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.02703/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1904.02703","created_at":"2026-07-05T03:34:19.051537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02703v3","created_at":"2026-07-05T03:34:19.051537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02703","created_at":"2026-07-05T03:34:19.051537+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZQQQ6HX72QP","created_at":"2026-07-05T03:34:19.051537+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZQQQ6HX72QPATBJ","created_at":"2026-07-05T03:34:19.051537+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZQQQ6HX","created_at":"2026-07-05T03:34:19.051537+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08771","citing_title":"Algebra of Bivariate-Bicycle Surface Codes","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02418","citing_title":"Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2304.04743","citing_title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20013","citing_title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05126","citing_title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZQQQ6HX72QPATBJDTEJZF3OXR","json":"https://pith.science/pith/EZQQQ6HX72QPATBJDTEJZF3OXR.json","graph_json":"https://pith.science/api/pith-number/EZQQQ6HX72QPATBJDTEJZF3OXR/graph.json","events_json":"https://pith.science/api/pith-number/EZQQQ6HX72QPATBJDTEJZF3OXR/events.json","paper":"https://pith.science/paper/EZQQQ6HX"},"agent_actions":{"view_html":"https://pith.science/pith/EZQQQ6HX72QPATBJDTEJZF3OXR","download_json":"https://pith.science/pith/EZQQQ6HX72QPATBJDTEJZF3OXR.json","view_paper":"https://pith.science/paper/EZQQQ6HX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02703&json=true","fetch_graph":"https://pith.science/api/pith-number/EZQQQ6HX72QPATBJDTEJZF3OXR/graph.json","fetch_events":"https://pith.science/api/pith-number/EZQQQ6HX72QPATBJDTEJZF3OXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZQQQ6HX72QPATBJDTEJZF3OXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZQQQ6HX72QPATBJDTEJZF3OXR/action/storage_attestation","attest_author":"https://pith.science/pith/EZQQQ6HX72QPATBJDTEJZF3OXR/action/author_attestation","sign_citation":"https://pith.science/pith/EZQQQ6HX72QPATBJDTEJZF3OXR/action/citation_signature","submit_replication":"https://pith.science/pith/EZQQQ6HX72QPATBJDTEJZF3OXR/action/replication_record"}},"created_at":"2026-07-05T03:34:19.051537+00:00","updated_at":"2026-07-05T03:34:19.051537+00:00"}