{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CFGHME32OKJZO5CNOO6WMO4VYN","short_pith_number":"pith:CFGHME32","schema_version":"1.0","canonical_sha256":"114c76137a729397744d73bd663b95c35f651a62b2f55b3105970fd1d2480730","source":{"kind":"arxiv","id":"1206.0800","version":2},"attestation_state":"computed","paper":{"title":"Proof of finite surface code threshold for matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2012-06-05T00:23:49Z","abstract_excerpt":"The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising quantum error correction code, requiring only a physically reasonable 2-D lattice of qubits with nearest neighbor interactions. However, existing proofs that reliable quantum computation is possible using this code assume the ability to measure four-body operators and, despite making this difficult to realize assumption, require that the error rate of these "},"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":"1206.0800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-05T00:23:49Z","cross_cats_sorted":[],"title_canon_sha256":"352c7ef62f116cd4fbed6cd356da609dcd277a9552ff1860b0798678f0899646","abstract_canon_sha256":"1c74b622a8b5128163fbf605657da216296c956f588e91364153909c5225087f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:28.585047Z","signature_b64":"toobXQHhrsSc15mrcwvCMb3MX4gdHUTIM9Q0Dou5/OwHLjrilM0tVVVXe0AgvzcvhTaLRmpimifWA5JS3DyABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"114c76137a729397744d73bd663b95c35f651a62b2f55b3105970fd1d2480730","last_reissued_at":"2026-05-18T03:39:28.584186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:28.584186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof of finite surface code threshold for matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2012-06-05T00:23:49Z","abstract_excerpt":"The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising quantum error correction code, requiring only a physically reasonable 2-D lattice of qubits with nearest neighbor interactions. However, existing proofs that reliable quantum computation is possible using this code assume the ability to measure four-body operators and, despite making this difficult to realize assumption, require that the error rate of these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0800","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":""},"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":"1206.0800","created_at":"2026-05-18T03:39:28.584348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0800v2","created_at":"2026-05-18T03:39:28.584348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0800","created_at":"2026-05-18T03:39:28.584348+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFGHME32OKJZ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFGHME32OKJZO5CN","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFGHME32","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CFGHME32OKJZO5CNOO6WMO4VYN","json":"https://pith.science/pith/CFGHME32OKJZO5CNOO6WMO4VYN.json","graph_json":"https://pith.science/api/pith-number/CFGHME32OKJZO5CNOO6WMO4VYN/graph.json","events_json":"https://pith.science/api/pith-number/CFGHME32OKJZO5CNOO6WMO4VYN/events.json","paper":"https://pith.science/paper/CFGHME32"},"agent_actions":{"view_html":"https://pith.science/pith/CFGHME32OKJZO5CNOO6WMO4VYN","download_json":"https://pith.science/pith/CFGHME32OKJZO5CNOO6WMO4VYN.json","view_paper":"https://pith.science/paper/CFGHME32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0800&json=true","fetch_graph":"https://pith.science/api/pith-number/CFGHME32OKJZO5CNOO6WMO4VYN/graph.json","fetch_events":"https://pith.science/api/pith-number/CFGHME32OKJZO5CNOO6WMO4VYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFGHME32OKJZO5CNOO6WMO4VYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFGHME32OKJZO5CNOO6WMO4VYN/action/storage_attestation","attest_author":"https://pith.science/pith/CFGHME32OKJZO5CNOO6WMO4VYN/action/author_attestation","sign_citation":"https://pith.science/pith/CFGHME32OKJZO5CNOO6WMO4VYN/action/citation_signature","submit_replication":"https://pith.science/pith/CFGHME32OKJZO5CNOO6WMO4VYN/action/replication_record"}},"created_at":"2026-05-18T03:39:28.584348+00:00","updated_at":"2026-05-18T03:39:28.584348+00:00"}