{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2ZTCQZXKKRN2PBJMONHDVGCZOP","short_pith_number":"pith:2ZTCQZXK","schema_version":"1.0","canonical_sha256":"d6662866ea545ba7852c734e3a985973d7b2162239cb1ddbe511793bcd09c99c","source":{"kind":"arxiv","id":"2306.17142","version":2},"attestation_state":"computed","paper":{"title":"Belief propagation as a partial decoder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Brendan Reid, Earl Campbell, Joan Camps, Laura Caune","submitted_at":"2023-06-29T17:44:20Z","abstract_excerpt":"One of the fundamental challenges in enabling fault-tolerant quantum computation is realising fast enough quantum decoders. We present a new two-stage decoder that accelerates the decoding cycle and boosts accuracy. In the first stage, a partial decoder based on belief propagation is used to correct errors that occurred with high probability. In the second stage, a conventional decoder corrects any remaining errors. We study the performance of our two-stage decoder with simulations using the surface code under circuit-level noise. When the conventional decoder is minimum-weight perfect matchin"},"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":"2306.17142","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-29T17:44:20Z","cross_cats_sorted":[],"title_canon_sha256":"c666797a624dedf27f256dec8205d8b66fc4e55250457425f97029819e3fb356","abstract_canon_sha256":"dfb9f94a4d78a5d0b864cbb3e06aef42171b98a625bda83169a278ca69c294bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:21.594091Z","signature_b64":"FC8BbEbi8spnESyaO6TbMNTX95TTgPShLiTYGe5l5YRWSWb1YTCrSUz/Rub/R5krWE9QmUdWjrzgVBdcutNaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6662866ea545ba7852c734e3a985973d7b2162239cb1ddbe511793bcd09c99c","last_reissued_at":"2026-07-05T06:33:21.593589Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:21.593589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Belief propagation as a partial decoder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Brendan Reid, Earl Campbell, Joan Camps, Laura Caune","submitted_at":"2023-06-29T17:44:20Z","abstract_excerpt":"One of the fundamental challenges in enabling fault-tolerant quantum computation is realising fast enough quantum decoders. We present a new two-stage decoder that accelerates the decoding cycle and boosts accuracy. In the first stage, a partial decoder based on belief propagation is used to correct errors that occurred with high probability. In the second stage, a conventional decoder corrects any remaining errors. We study the performance of our two-stage decoder with simulations using the surface code under circuit-level noise. When the conventional decoder is minimum-weight perfect matchin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.17142","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/2306.17142/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":"2306.17142","created_at":"2026-07-05T06:33:21.593651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.17142v2","created_at":"2026-07-05T06:33:21.593651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.17142","created_at":"2026-07-05T06:33:21.593651+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZTCQZXKKRN2","created_at":"2026-07-05T06:33:21.593651+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZTCQZXKKRN2PBJM","created_at":"2026-07-05T06:33:21.593651+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZTCQZXK","created_at":"2026-07-05T06:33:21.593651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2406.17995","citing_title":"Managing Classical Processing Requirements for Quantum Error Correction","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2603.29439","citing_title":"PAEMS: Precise and Adaptive Error Model for Superconducting Quantum Processors","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12841","citing_title":"Fast and accurate AI-based pre-decoders for surface codes","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2ZTCQZXKKRN2PBJMONHDVGCZOP","json":"https://pith.science/pith/2ZTCQZXKKRN2PBJMONHDVGCZOP.json","graph_json":"https://pith.science/api/pith-number/2ZTCQZXKKRN2PBJMONHDVGCZOP/graph.json","events_json":"https://pith.science/api/pith-number/2ZTCQZXKKRN2PBJMONHDVGCZOP/events.json","paper":"https://pith.science/paper/2ZTCQZXK"},"agent_actions":{"view_html":"https://pith.science/pith/2ZTCQZXKKRN2PBJMONHDVGCZOP","download_json":"https://pith.science/pith/2ZTCQZXKKRN2PBJMONHDVGCZOP.json","view_paper":"https://pith.science/paper/2ZTCQZXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.17142&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZTCQZXKKRN2PBJMONHDVGCZOP/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZTCQZXKKRN2PBJMONHDVGCZOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZTCQZXKKRN2PBJMONHDVGCZOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZTCQZXKKRN2PBJMONHDVGCZOP/action/storage_attestation","attest_author":"https://pith.science/pith/2ZTCQZXKKRN2PBJMONHDVGCZOP/action/author_attestation","sign_citation":"https://pith.science/pith/2ZTCQZXKKRN2PBJMONHDVGCZOP/action/citation_signature","submit_replication":"https://pith.science/pith/2ZTCQZXKKRN2PBJMONHDVGCZOP/action/replication_record"}},"created_at":"2026-07-05T06:33:21.593651+00:00","updated_at":"2026-07-05T06:33:21.593651+00:00"}