{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:74QJL2QV7KFMTTPXVDNWGRCAD3","short_pith_number":"pith:74QJL2QV","schema_version":"1.0","canonical_sha256":"ff2095ea15fa8ac9cdf7a8db6344401ef5c1d32fe32a0fcba7c2f914ac4a86d0","source":{"kind":"arxiv","id":"2507.00254","version":3},"attestation_state":"computed","paper":{"title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ang Li, Frank Mueller, Ming Wang","submitted_at":"2025-06-30T20:47:28Z","abstract_excerpt":"This work presents a hardware-efficient and fully parallelizable decoder for quantum LDPC codes that leverages belief propagation (BP) with a speculative post-processing strategy inspired by classical Chase decoding algorithm. By monitoring bit-level oscillation patterns during BP, our method identifies unreliable bits and generates multiple candidate vectors to selectively flip syndromes. Each modified syndrome is then decoded independently using short-depth BP, a process we refer to as BP-SF (syndrome flip). This design eliminates the need for costly Gaussian elimination used in the current "},"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":"2507.00254","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-30T20:47:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9b0fb6e31fe4adcd7af95cfb84369b167eaa90150b82c154a9e43fb967a419b4","abstract_canon_sha256":"b9f6b09000f1794a07112064f017234658ed8643ae4336bee39471db4c3bf85a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T00:24:31.841893Z","signature_b64":"Vk+idjV2RZTWm3qQJmhEALDf3yYePq1Jl5IRbS22M3UAUrSq2OpiCGbeWqyCxsyELqb8D+fwR30LN17JYVltDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2095ea15fa8ac9cdf7a8db6344401ef5c1d32fe32a0fcba7c2f914ac4a86d0","last_reissued_at":"2026-07-29T00:24:31.840932Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T00:24:31.840932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ang Li, Frank Mueller, Ming Wang","submitted_at":"2025-06-30T20:47:28Z","abstract_excerpt":"This work presents a hardware-efficient and fully parallelizable decoder for quantum LDPC codes that leverages belief propagation (BP) with a speculative post-processing strategy inspired by classical Chase decoding algorithm. By monitoring bit-level oscillation patterns during BP, our method identifies unreliable bits and generates multiple candidate vectors to selectively flip syndromes. Each modified syndrome is then decoded independently using short-depth BP, a process we refer to as BP-SF (syndrome flip). This design eliminates the need for costly Gaussian elimination used in the current "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00254","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/2507.00254/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":"2507.00254","created_at":"2026-07-29T00:24:31.841393+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.00254v3","created_at":"2026-07-29T00:24:31.841393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00254","created_at":"2026-07-29T00:24:31.841393+00:00"},{"alias_kind":"pith_short_12","alias_value":"74QJL2QV7KFM","created_at":"2026-07-29T00:24:31.841393+00:00"},{"alias_kind":"pith_short_16","alias_value":"74QJL2QV7KFMTTPX","created_at":"2026-07-29T00:24:31.841393+00:00"},{"alias_kind":"pith_short_8","alias_value":"74QJL2QV","created_at":"2026-07-29T00:24:31.841393+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"2607.08386","citing_title":"Parallel QEC Decoding Applied to Distributed Quantum Computing","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21468","citing_title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","ref_index":87,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20926","citing_title":"Learning-Based List Sequential Belief Propagation Decoding of Quantum LDPC Codes","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2509.01892","citing_title":"Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing","ref_index":52,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03951","citing_title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21472","citing_title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","ref_index":86,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74QJL2QV7KFMTTPXVDNWGRCAD3","json":"https://pith.science/pith/74QJL2QV7KFMTTPXVDNWGRCAD3.json","graph_json":"https://pith.science/api/pith-number/74QJL2QV7KFMTTPXVDNWGRCAD3/graph.json","events_json":"https://pith.science/api/pith-number/74QJL2QV7KFMTTPXVDNWGRCAD3/events.json","paper":"https://pith.science/paper/74QJL2QV"},"agent_actions":{"view_html":"https://pith.science/pith/74QJL2QV7KFMTTPXVDNWGRCAD3","download_json":"https://pith.science/pith/74QJL2QV7KFMTTPXVDNWGRCAD3.json","view_paper":"https://pith.science/paper/74QJL2QV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.00254&json=true","fetch_graph":"https://pith.science/api/pith-number/74QJL2QV7KFMTTPXVDNWGRCAD3/graph.json","fetch_events":"https://pith.science/api/pith-number/74QJL2QV7KFMTTPXVDNWGRCAD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74QJL2QV7KFMTTPXVDNWGRCAD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74QJL2QV7KFMTTPXVDNWGRCAD3/action/storage_attestation","attest_author":"https://pith.science/pith/74QJL2QV7KFMTTPXVDNWGRCAD3/action/author_attestation","sign_citation":"https://pith.science/pith/74QJL2QV7KFMTTPXVDNWGRCAD3/action/citation_signature","submit_replication":"https://pith.science/pith/74QJL2QV7KFMTTPXVDNWGRCAD3/action/replication_record"}},"created_at":"2026-07-29T00:24:31.841393+00:00","updated_at":"2026-07-29T00:24:31.841393+00:00"}