{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RBOY6C2MZT65PVFV4IKSX3QAZB","short_pith_number":"pith:RBOY6C2M","schema_version":"1.0","canonical_sha256":"885d8f0b4cccfdd7d4b5e2152bee00c844d5ecd0588f5007c94da23f9ab53849","source":{"kind":"arxiv","id":"2406.14527","version":2},"attestation_state":"computed","paper":{"title":"Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben Barber, Stasiu Wolanski","submitted_at":"2024-06-20T17:39:31Z","abstract_excerpt":"Error correction allows a quantum computer to preserve states long beyond the decoherence time of its physical qubits. Key to any scheme of error correction is the decoding algorithm, which estimates the error state of qubits from the results of syndrome measurements. The leading proposal for quantum error correction, the surface code, has fast and accurate decoders, but several recently proposed quantum low-density parity check (qLDPC) codes allow more logical information to be encoded in significantly fewer physical qubits. The state-of-the-art decoder for general qLDPC codes, BP-OSD, has a "},"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":"2406.14527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-06-20T17:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"6d06ba64120c6a7ea2689b89bd10775a4c73e8aad28429fe0aa66f21105ff514","abstract_canon_sha256":"5140e243223e04fb6f502f1f03c89099966ab6e99a129d9c804221ea2d2729e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:36.354455Z","signature_b64":"QycA4hdiu458FCzWyqZLYCkWJrhi94ALc/sZ4O4yglgMpc+Wx/bIDsGL0ygp99mAo+C6eGXYNBIdodhDBvtoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"885d8f0b4cccfdd7d4b5e2152bee00c844d5ecd0588f5007c94da23f9ab53849","last_reissued_at":"2026-07-05T09:56:36.353943Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:36.353943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben Barber, Stasiu Wolanski","submitted_at":"2024-06-20T17:39:31Z","abstract_excerpt":"Error correction allows a quantum computer to preserve states long beyond the decoherence time of its physical qubits. Key to any scheme of error correction is the decoding algorithm, which estimates the error state of qubits from the results of syndrome measurements. The leading proposal for quantum error correction, the surface code, has fast and accurate decoders, but several recently proposed quantum low-density parity check (qLDPC) codes allow more logical information to be encoded in significantly fewer physical qubits. The state-of-the-art decoder for general qLDPC codes, BP-OSD, has a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14527","kind":"arxiv","version":2},"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/2406.14527/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":"2406.14527","created_at":"2026-07-05T09:56:36.354004+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.14527v2","created_at":"2026-07-05T09:56:36.354004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14527","created_at":"2026-07-05T09:56:36.354004+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBOY6C2MZT65","created_at":"2026-07-05T09:56:36.354004+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBOY6C2MZT65PVFV","created_at":"2026-07-05T09:56:36.354004+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBOY6C2M","created_at":"2026-07-05T09:56:36.354004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20263","citing_title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","ref_index":88,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18240","citing_title":"Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2406.17995","citing_title":"Managing Classical Processing Requirements for Quantum Error Correction","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2410.11942","citing_title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","ref_index":116,"is_internal_anchor":false},{"citing_arxiv_id":"2501.08036","citing_title":"Decoding Quantum LDPC Codes using Collaborative Check Node Removal","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2509.01892","citing_title":"Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14170","citing_title":"Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03218","citing_title":"Edge-Based Anisotropic Decoding for Generalized Bicycle Codes","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04151","citing_title":"Topological subsystem bivariate bicycle codes with four-qubit check operators","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RBOY6C2MZT65PVFV4IKSX3QAZB","json":"https://pith.science/pith/RBOY6C2MZT65PVFV4IKSX3QAZB.json","graph_json":"https://pith.science/api/pith-number/RBOY6C2MZT65PVFV4IKSX3QAZB/graph.json","events_json":"https://pith.science/api/pith-number/RBOY6C2MZT65PVFV4IKSX3QAZB/events.json","paper":"https://pith.science/paper/RBOY6C2M"},"agent_actions":{"view_html":"https://pith.science/pith/RBOY6C2MZT65PVFV4IKSX3QAZB","download_json":"https://pith.science/pith/RBOY6C2MZT65PVFV4IKSX3QAZB.json","view_paper":"https://pith.science/paper/RBOY6C2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.14527&json=true","fetch_graph":"https://pith.science/api/pith-number/RBOY6C2MZT65PVFV4IKSX3QAZB/graph.json","fetch_events":"https://pith.science/api/pith-number/RBOY6C2MZT65PVFV4IKSX3QAZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBOY6C2MZT65PVFV4IKSX3QAZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBOY6C2MZT65PVFV4IKSX3QAZB/action/storage_attestation","attest_author":"https://pith.science/pith/RBOY6C2MZT65PVFV4IKSX3QAZB/action/author_attestation","sign_citation":"https://pith.science/pith/RBOY6C2MZT65PVFV4IKSX3QAZB/action/citation_signature","submit_replication":"https://pith.science/pith/RBOY6C2MZT65PVFV4IKSX3QAZB/action/replication_record"}},"created_at":"2026-07-05T09:56:36.354004+00:00","updated_at":"2026-07-05T09:56:36.354004+00:00"}