{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4U5WZPCQTF53S23VEFAFQ724XH","short_pith_number":"pith:4U5WZPCQ","schema_version":"1.0","canonical_sha256":"e53b6cbc50997bb96b752140587f5cb9d81fe400cf9b45138b120b1bc2ce1c60","source":{"kind":"arxiv","id":"1307.1740","version":3},"attestation_state":"computed","paper":{"title":"Minimum weight perfect matching of fault-tolerant topological quantum error correction in average $O(1)$ parallel time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2013-07-06T00:41:19Z","abstract_excerpt":"Consider a 2-D square array of qubits of extent $L\\times L$. We provide a proof that the minimum weight perfect matching problem associated with running a particular class of topological quantum error correction codes on this array can be exactly solved with a 2-D square array of classical computing devices, each of which is nominally associated with a fixed number $N$ of qubits, in constant average time per round of error detection independent of $L$ provided physical error rates are below fixed nonzero values, and other physically reasonable assumptions. This proof is applicable to the fully"},"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":"1307.1740","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-07-06T00:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"b0732bd9401ff6be2b58efc02af7396067861f9013885de0c86fba7e80631b11","abstract_canon_sha256":"28bbccdb56858a47252fbfe80cce126b21ef34ae7b0691dc6c9e808b09d2b537"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:45.742618Z","signature_b64":"iHIBB7Z1cddADi4W30AGUwjCLePGnlnYGvnkyBIrlpmpJgZa0ommOTSCj/j92N8lAtsESokH9RQskl8GBozlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e53b6cbc50997bb96b752140587f5cb9d81fe400cf9b45138b120b1bc2ce1c60","last_reissued_at":"2026-05-18T02:40:45.742155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:45.742155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum weight perfect matching of fault-tolerant topological quantum error correction in average $O(1)$ parallel time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2013-07-06T00:41:19Z","abstract_excerpt":"Consider a 2-D square array of qubits of extent $L\\times L$. We provide a proof that the minimum weight perfect matching problem associated with running a particular class of topological quantum error correction codes on this array can be exactly solved with a 2-D square array of classical computing devices, each of which is nominally associated with a fixed number $N$ of qubits, in constant average time per round of error detection independent of $L$ provided physical error rates are below fixed nonzero values, and other physically reasonable assumptions. This proof is applicable to the fully"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1740","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":""},"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":"1307.1740","created_at":"2026-05-18T02:40:45.742226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1740v3","created_at":"2026-05-18T02:40:45.742226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1740","created_at":"2026-05-18T02:40:45.742226+00:00"},{"alias_kind":"pith_short_12","alias_value":"4U5WZPCQTF53","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4U5WZPCQTF53S23V","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4U5WZPCQ","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2312.03508","citing_title":"Convolutional neural network based decoders for surface codes","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25424","citing_title":"A graph-aware bounded distance decoder for all stabilizer codes","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00038","citing_title":"Lottery BP: Unlocking Quantum Error Decoding at Scale","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04459","citing_title":"Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4U5WZPCQTF53S23VEFAFQ724XH","json":"https://pith.science/pith/4U5WZPCQTF53S23VEFAFQ724XH.json","graph_json":"https://pith.science/api/pith-number/4U5WZPCQTF53S23VEFAFQ724XH/graph.json","events_json":"https://pith.science/api/pith-number/4U5WZPCQTF53S23VEFAFQ724XH/events.json","paper":"https://pith.science/paper/4U5WZPCQ"},"agent_actions":{"view_html":"https://pith.science/pith/4U5WZPCQTF53S23VEFAFQ724XH","download_json":"https://pith.science/pith/4U5WZPCQTF53S23VEFAFQ724XH.json","view_paper":"https://pith.science/paper/4U5WZPCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1740&json=true","fetch_graph":"https://pith.science/api/pith-number/4U5WZPCQTF53S23VEFAFQ724XH/graph.json","fetch_events":"https://pith.science/api/pith-number/4U5WZPCQTF53S23VEFAFQ724XH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4U5WZPCQTF53S23VEFAFQ724XH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4U5WZPCQTF53S23VEFAFQ724XH/action/storage_attestation","attest_author":"https://pith.science/pith/4U5WZPCQTF53S23VEFAFQ724XH/action/author_attestation","sign_citation":"https://pith.science/pith/4U5WZPCQTF53S23VEFAFQ724XH/action/citation_signature","submit_replication":"https://pith.science/pith/4U5WZPCQTF53S23VEFAFQ724XH/action/replication_record"}},"created_at":"2026-05-18T02:40:45.742226+00:00","updated_at":"2026-05-18T02:40:45.742226+00:00"}