{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6G2A5NE45NEFRQHVKNI5WC4PKZ","short_pith_number":"pith:6G2A5NE4","schema_version":"1.0","canonical_sha256":"f1b40eb49ceb4858c0f55351db0b8f564423974b9b5febf0349ac0f5e408ac71","source":{"kind":"arxiv","id":"2409.01440","version":3},"attestation_state":"computed","paper":{"title":"An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Antonio deMarti iOlius, Imanol Etxezarreta Martinez, Joschka Roffe, Josu Etxezarreta Martinez","submitted_at":"2024-09-02T19:50:57Z","abstract_excerpt":"Fault-tolerant quantum computers must be designed in conjunction with classical co-processors that decode quantum error correction measurement information in real-time. In this work, we introduce the belief propagation plus ordered Tanner forest (BP+OTF) algorithm as an almost-linear time decoder for quantum low-density parity-check codes. The OTF post-processing stage removes qubits from the decoding graph until it has a tree-like structure. Provided that the resultant loop-free OTF graph supports a subset of qubits that can generate the syndrome, BP decoding is then guaranteed to converge. T"},"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":"2409.01440","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-09-02T19:50:57Z","cross_cats_sorted":[],"title_canon_sha256":"b4ac8403301ab06ad6f044a5def277954be82dbe41d3c86824723f7181efae62","abstract_canon_sha256":"74d9a1afc69745c4bf2f9eb6ea2938f4810f7131f1d19438b84407c0e0e4198d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T00:17:07.491786Z","signature_b64":"TvsC1Q7k5+S/09M83+g4Q0krBwfB9I5WNPYmvYmpn+F075VLoMKU0jsvixatELvAAlWSp3gSdIhNwK59LFyzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1b40eb49ceb4858c0f55351db0b8f564423974b9b5febf0349ac0f5e408ac71","last_reissued_at":"2026-07-01T00:17:07.491048Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T00:17:07.491048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Antonio deMarti iOlius, Imanol Etxezarreta Martinez, Joschka Roffe, Josu Etxezarreta Martinez","submitted_at":"2024-09-02T19:50:57Z","abstract_excerpt":"Fault-tolerant quantum computers must be designed in conjunction with classical co-processors that decode quantum error correction measurement information in real-time. In this work, we introduce the belief propagation plus ordered Tanner forest (BP+OTF) algorithm as an almost-linear time decoder for quantum low-density parity-check codes. The OTF post-processing stage removes qubits from the decoding graph until it has a tree-like structure. Provided that the resultant loop-free OTF graph supports a subset of qubits that can generate the syndrome, BP decoding is then guaranteed to converge. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01440","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/2409.01440/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":"2409.01440","created_at":"2026-07-01T00:17:07.491134+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.01440v3","created_at":"2026-07-01T00:17:07.491134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01440","created_at":"2026-07-01T00:17:07.491134+00:00"},{"alias_kind":"pith_short_12","alias_value":"6G2A5NE45NEF","created_at":"2026-07-01T00:17:07.491134+00:00"},{"alias_kind":"pith_short_16","alias_value":"6G2A5NE45NEFRQHV","created_at":"2026-07-01T00:17:07.491134+00:00"},{"alias_kind":"pith_short_8","alias_value":"6G2A5NE4","created_at":"2026-07-01T00:17:07.491134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2504.01164","citing_title":"Diversity Methods for Improving Convergence and Accuracy of Quantum Error Correction Decoders Through Hardware Emulation","ref_index":13,"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":10,"is_internal_anchor":true},{"citing_arxiv_id":"2603.19062","citing_title":"Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6G2A5NE45NEFRQHVKNI5WC4PKZ","json":"https://pith.science/pith/6G2A5NE45NEFRQHVKNI5WC4PKZ.json","graph_json":"https://pith.science/api/pith-number/6G2A5NE45NEFRQHVKNI5WC4PKZ/graph.json","events_json":"https://pith.science/api/pith-number/6G2A5NE45NEFRQHVKNI5WC4PKZ/events.json","paper":"https://pith.science/paper/6G2A5NE4"},"agent_actions":{"view_html":"https://pith.science/pith/6G2A5NE45NEFRQHVKNI5WC4PKZ","download_json":"https://pith.science/pith/6G2A5NE45NEFRQHVKNI5WC4PKZ.json","view_paper":"https://pith.science/paper/6G2A5NE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.01440&json=true","fetch_graph":"https://pith.science/api/pith-number/6G2A5NE45NEFRQHVKNI5WC4PKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6G2A5NE45NEFRQHVKNI5WC4PKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6G2A5NE45NEFRQHVKNI5WC4PKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6G2A5NE45NEFRQHVKNI5WC4PKZ/action/storage_attestation","attest_author":"https://pith.science/pith/6G2A5NE45NEFRQHVKNI5WC4PKZ/action/author_attestation","sign_citation":"https://pith.science/pith/6G2A5NE45NEFRQHVKNI5WC4PKZ/action/citation_signature","submit_replication":"https://pith.science/pith/6G2A5NE45NEFRQHVKNI5WC4PKZ/action/replication_record"}},"created_at":"2026-07-01T00:17:07.491134+00:00","updated_at":"2026-07-01T00:17:07.491134+00:00"}