{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UNUJOE5JOOWA7CMRUIY6SBFCU4","short_pith_number":"pith:UNUJOE5J","schema_version":"1.0","canonical_sha256":"a3689713a973ac0f8991a231e904a2a7237d5a0549d3fbc035d148e22447c078","source":{"kind":"arxiv","id":"2105.13082","version":2},"attestation_state":"computed","paper":{"title":"PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Oscar Higgott","submitted_at":"2021-05-27T12:10:37Z","abstract_excerpt":"This paper introduces PyMatching, a fast open-source Python package for decoding quantum error-correcting codes with the minimum-weight perfect matching (MWPM) algorithm. PyMatching includes the standard MWPM decoder as well as a variant, which we call local matching, that restricts each syndrome defect to be matched to another defect within a local neighbourhood. The decoding performance of local matching is almost identical to that of the standard MWPM decoder in practice, while reducing the computational complexity approximately quadratically. We benchmark the performance of PyMatching, sho"},"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":"2105.13082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-05-27T12:10:37Z","cross_cats_sorted":[],"title_canon_sha256":"66160d5cd040f1bcf9815f21c4150e5c296433b370bc624cf44a7543637e186e","abstract_canon_sha256":"0146cee1127c04a1d6452be7a502029029fb9e3782297ebcf7dc41fab1332c10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:22.187921Z","signature_b64":"WZ/XNHMObQpOQEtYckIT6KbpFvMuOjSCMjfPZZ/sZ0/Q41IxCmlPU+y+BacXgbB8u1xlOEAdiR2+E8mdcTN9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3689713a973ac0f8991a231e904a2a7237d5a0549d3fbc035d148e22447c078","last_reissued_at":"2026-07-05T02:57:22.187429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:22.187429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Oscar Higgott","submitted_at":"2021-05-27T12:10:37Z","abstract_excerpt":"This paper introduces PyMatching, a fast open-source Python package for decoding quantum error-correcting codes with the minimum-weight perfect matching (MWPM) algorithm. PyMatching includes the standard MWPM decoder as well as a variant, which we call local matching, that restricts each syndrome defect to be matched to another defect within a local neighbourhood. The decoding performance of local matching is almost identical to that of the standard MWPM decoder in practice, while reducing the computational complexity approximately quadratically. We benchmark the performance of PyMatching, sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13082","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/2105.13082/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":"2105.13082","created_at":"2026-07-05T02:57:22.187489+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.13082v2","created_at":"2026-07-05T02:57:22.187489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13082","created_at":"2026-07-05T02:57:22.187489+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNUJOE5JOOWA","created_at":"2026-07-05T02:57:22.187489+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNUJOE5JOOWA7CMR","created_at":"2026-07-05T02:57:22.187489+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNUJOE5J","created_at":"2026-07-05T02:57:22.187489+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":15,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27358","citing_title":"Cultivating logical catalysts for fault-tolerant dyadic phase rotations","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11076","citing_title":"Coset Ensemble Decoder for Quantum Error Correction with Algorithm-Hardware Co-Design","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08758","citing_title":"Neural network decoder confidence as a learned proxy for the logical gap","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07377","citing_title":"Coherent versus stochastic error injection on a repetition-code logical qubit in superconducting hardware","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30385","citing_title":"Blueprint for a fault-tolerant compound photon-atom quantum architecture","ref_index":119,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30217","citing_title":"Programmable Dissipation via Partial Quantum Error Correction","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2407.16176","citing_title":"Quantum memory based on concatenating surface codes and quantum Hamming codes","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2411.16228","citing_title":"Soft information decoding with superconducting qubits","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":34,"is_internal_anchor":false},{"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":22,"is_internal_anchor":false},{"citing_arxiv_id":"2603.24237","citing_title":"Correlated Atom Loss as a Resource for Quantum Error Correction","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":175,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04892","citing_title":"Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14299","citing_title":"Low-valency scalable quantum error correction with a dynamic compass code","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UNUJOE5JOOWA7CMRUIY6SBFCU4","json":"https://pith.science/pith/UNUJOE5JOOWA7CMRUIY6SBFCU4.json","graph_json":"https://pith.science/api/pith-number/UNUJOE5JOOWA7CMRUIY6SBFCU4/graph.json","events_json":"https://pith.science/api/pith-number/UNUJOE5JOOWA7CMRUIY6SBFCU4/events.json","paper":"https://pith.science/paper/UNUJOE5J"},"agent_actions":{"view_html":"https://pith.science/pith/UNUJOE5JOOWA7CMRUIY6SBFCU4","download_json":"https://pith.science/pith/UNUJOE5JOOWA7CMRUIY6SBFCU4.json","view_paper":"https://pith.science/paper/UNUJOE5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.13082&json=true","fetch_graph":"https://pith.science/api/pith-number/UNUJOE5JOOWA7CMRUIY6SBFCU4/graph.json","fetch_events":"https://pith.science/api/pith-number/UNUJOE5JOOWA7CMRUIY6SBFCU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNUJOE5JOOWA7CMRUIY6SBFCU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNUJOE5JOOWA7CMRUIY6SBFCU4/action/storage_attestation","attest_author":"https://pith.science/pith/UNUJOE5JOOWA7CMRUIY6SBFCU4/action/author_attestation","sign_citation":"https://pith.science/pith/UNUJOE5JOOWA7CMRUIY6SBFCU4/action/citation_signature","submit_replication":"https://pith.science/pith/UNUJOE5JOOWA7CMRUIY6SBFCU4/action/replication_record"}},"created_at":"2026-07-05T02:57:22.187489+00:00","updated_at":"2026-07-05T02:57:22.187489+00:00"}