{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4S76J3NMMICRS6I574KDISQUV5","short_pith_number":"pith:4S76J3NM","schema_version":"1.0","canonical_sha256":"e4bfe4edac620519791dff14344a14af644d1f404415600429fc017b8a372e29","source":{"kind":"arxiv","id":"2605.14170","version":1},"attestation_state":"computed","paper":{"title":"Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Sheida Rabeti","submitted_at":"2026-05-13T22:49:35Z","abstract_excerpt":"In this paper, we propose a belief-propagation (BP)-based decoder, termed the Multiple-Bases Belief-Propagation List Decoder (MBBP-LD), for quantum low-density parity-check (QLDPC) codes. The key idea is to generate \\emph{structured decoding diversity} by constructing multiple redundant parity-check representations via cycle-free subtree decompositions of the Tanner graph, and running BP decoding in parallel across these representations. This extends the classical Multiple-Bases Belief-Propagation (MBBP) framework to the quantum setting while preserving the linear-time complexity and efficienc"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T22:49:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"582cf939a3e8615c5080165b4c032c5ae7ecbb70e6f2626351163750b96cc565","abstract_canon_sha256":"5cc2ea8abb256e3ef7eecdf4e4d39eb37659453074a747c01e718e9cda486f5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.365368Z","signature_b64":"GWwP/IO3BysEtyZ0OFSDb9/frnVUp0PYx4rBsmuO2+wduMPoQpW9Zf3KNDXIycA6ieD/n6Rvigt5/G3tFjDDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4bfe4edac620519791dff14344a14af644d1f404415600429fc017b8a372e29","last_reissued_at":"2026-05-17T23:39:11.364287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.364287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Sheida Rabeti","submitted_at":"2026-05-13T22:49:35Z","abstract_excerpt":"In this paper, we propose a belief-propagation (BP)-based decoder, termed the Multiple-Bases Belief-Propagation List Decoder (MBBP-LD), for quantum low-density parity-check (QLDPC) codes. The key idea is to generate \\emph{structured decoding diversity} by constructing multiple redundant parity-check representations via cycle-free subtree decompositions of the Tanner graph, and running BP decoding in parallel across these representations. This extends the classical Multiple-Bases Belief-Propagation (MBBP) framework to the quantum setting while preserving the linear-time complexity and efficienc"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For bivariate bicycle codes [[144,12,12]] and [[288,12,18]], MBBP-LD achieves up to 20% reduction in error rate compared to BPGD and up to 30% compared to BP-OSD in the low- and moderate-error regimes while requiring substantially fewer total BP iterations.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The cycle-free subtree decompositions of the Tanner graph produce sufficiently diverse and consistent parity-check representations that improve BP convergence without introducing new inconsistencies or requiring super-linear overhead.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f61845408fbe5f7ec45fc4021c9834031a7021acd895e23a395f29ba969b914b"},"source":{"id":"2605.14170","kind":"arxiv","version":1},"verdict":{"id":"92af6d86-1966-4956-bfa6-5c79a0d177ec","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:43:21.738775Z","strongest_claim":"For bivariate bicycle codes [[144,12,12]] and [[288,12,18]], MBBP-LD achieves up to 20% reduction in error rate compared to BPGD and up to 30% compared to BP-OSD in the low- and moderate-error regimes while requiring substantially fewer total BP iterations.","one_line_summary":"MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The cycle-free subtree decompositions of the Tanner graph produce sufficiently diverse and consistent parity-check representations that improve BP convergence without introducing new inconsistencies or requiring super-linear overhead.","pith_extraction_headline":"MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees."},"references":{"count":23,"sample":[{"doi":"","year":1962,"title":"R. Gallager, “Low-density parity-check codes,”IRE Transactions on information theory, vol. 8, no. 1, pp. 21–28, 1962","work_id":"e4fcd8e9-c455-415e-b63f-fd5aa6f9b259","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Fifteen years of quantum LDPC coding and improved decoding strategies,","work_id":"6d1032ff-1fa0-4f30-a96d-e26cb7c65ad3","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Quantum low-density parity- check codes,","work_id":"fcccd828-c25e-4fb1-8187-d0d9eab61fdd","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Quantum low-density parity-check codes","work_id":"309b64a3-ed84-4a6b-ab00-a1b9d6ac53d0","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Degenerate quantum LDPC codes with good finite length performance","work_id":"45bee9f2-7c04-4106-9652-e6cd494b04c0","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":23,"snapshot_sha256":"3d2319fa80357c040efa06bf9318a75b20e5080ff07e812e937b19df3c923fda","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":"2605.14170","created_at":"2026-05-17T23:39:11.364707+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14170v1","created_at":"2026-05-17T23:39:11.364707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14170","created_at":"2026-05-17T23:39:11.364707+00:00"},{"alias_kind":"pith_short_12","alias_value":"4S76J3NMMICR","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"4S76J3NMMICRS6I5","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"4S76J3NM","created_at":"2026-05-18T12:33:37.589309+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/4S76J3NMMICRS6I574KDISQUV5","json":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5.json","graph_json":"https://pith.science/api/pith-number/4S76J3NMMICRS6I574KDISQUV5/graph.json","events_json":"https://pith.science/api/pith-number/4S76J3NMMICRS6I574KDISQUV5/events.json","paper":"https://pith.science/paper/4S76J3NM"},"agent_actions":{"view_html":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5","download_json":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5.json","view_paper":"https://pith.science/paper/4S76J3NM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14170&json=true","fetch_graph":"https://pith.science/api/pith-number/4S76J3NMMICRS6I574KDISQUV5/graph.json","fetch_events":"https://pith.science/api/pith-number/4S76J3NMMICRS6I574KDISQUV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5/action/storage_attestation","attest_author":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5/action/author_attestation","sign_citation":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5/action/citation_signature","submit_replication":"https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5/action/replication_record"}},"created_at":"2026-05-17T23:39:11.364707+00:00","updated_at":"2026-05-17T23:39:11.364707+00:00"}