{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Y7LCLXGGYQKOXNZOCWWSUDZ2WR","short_pith_number":"pith:Y7LCLXGG","schema_version":"1.0","canonical_sha256":"c7d625dcc6c414ebb72e15ad2a0f3ab4535854382c66bd01b240e52c76d6731a","source":{"kind":"arxiv","id":"1111.4022","version":3},"attestation_state":"computed","paper":{"title":"Surface code quantum computing by lattice surgery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler, Dominic Horsman, Rodney Van Meter, Simon Devitt","submitted_at":"2011-11-17T06:01:47Z","abstract_excerpt":"In recent years, surface codes have become a leading method for quantum error correction in theoretical large scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural 2-dimensional nearest neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect- based codes. Planar codes require fewer qubits to implement (for the same strength of error correctio"},"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":"1111.4022","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-11-17T06:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"6b4946b2353aabb9202ee70c74c0173dbfd9f55fe409edc29ffc43afccbad7a7","abstract_canon_sha256":"be9f489bc5ed1ad40beece4757faadeb4a1d73b4128133cb8b7553282b47c4d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:43.146285Z","signature_b64":"aTN2HADbcS0mHSKr4L/6QeL+wai7lD9ZCDk9YH3CJHJsmWw6EOBxFHS0MOeUn5SWk50uqL1o5/3cAcIdmCCkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7d625dcc6c414ebb72e15ad2a0f3ab4535854382c66bd01b240e52c76d6731a","last_reissued_at":"2026-07-05T06:02:43.145854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:43.145854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Surface code quantum computing by lattice surgery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler, Dominic Horsman, Rodney Van Meter, Simon Devitt","submitted_at":"2011-11-17T06:01:47Z","abstract_excerpt":"In recent years, surface codes have become a leading method for quantum error correction in theoretical large scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural 2-dimensional nearest neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect- based codes. Planar codes require fewer qubits to implement (for the same strength of error correctio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4022","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/1111.4022/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":"1111.4022","created_at":"2026-07-05T06:02:43.145914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4022v3","created_at":"2026-07-05T06:02:43.145914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4022","created_at":"2026-07-05T06:02:43.145914+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7LCLXGGYQKO","created_at":"2026-07-05T06:02:43.145914+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7LCLXGGYQKOXNZO","created_at":"2026-07-05T06:02:43.145914+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7LCLXGG","created_at":"2026-07-05T06:02:43.145914+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08508","citing_title":"Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23738","citing_title":"Optimizing Parallel Execution of Commuting Pauli Product Rotations","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2511.15783","citing_title":"Automorphism in Gauge Theories: Higher Symmetries and Transversal Non-Clifford Logical Gates","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2512.09189","citing_title":"Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y7LCLXGGYQKOXNZOCWWSUDZ2WR","json":"https://pith.science/pith/Y7LCLXGGYQKOXNZOCWWSUDZ2WR.json","graph_json":"https://pith.science/api/pith-number/Y7LCLXGGYQKOXNZOCWWSUDZ2WR/graph.json","events_json":"https://pith.science/api/pith-number/Y7LCLXGGYQKOXNZOCWWSUDZ2WR/events.json","paper":"https://pith.science/paper/Y7LCLXGG"},"agent_actions":{"view_html":"https://pith.science/pith/Y7LCLXGGYQKOXNZOCWWSUDZ2WR","download_json":"https://pith.science/pith/Y7LCLXGGYQKOXNZOCWWSUDZ2WR.json","view_paper":"https://pith.science/paper/Y7LCLXGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4022&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7LCLXGGYQKOXNZOCWWSUDZ2WR/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7LCLXGGYQKOXNZOCWWSUDZ2WR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7LCLXGGYQKOXNZOCWWSUDZ2WR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7LCLXGGYQKOXNZOCWWSUDZ2WR/action/storage_attestation","attest_author":"https://pith.science/pith/Y7LCLXGGYQKOXNZOCWWSUDZ2WR/action/author_attestation","sign_citation":"https://pith.science/pith/Y7LCLXGGYQKOXNZOCWWSUDZ2WR/action/citation_signature","submit_replication":"https://pith.science/pith/Y7LCLXGGYQKOXNZOCWWSUDZ2WR/action/replication_record"}},"created_at":"2026-07-05T06:02:43.145914+00:00","updated_at":"2026-07-05T06:02:43.145914+00:00"}