{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GMRWX3L3FCV5NITGZZZPZ4NPVN","short_pith_number":"pith:GMRWX3L3","schema_version":"1.0","canonical_sha256":"33236bed7b28abd6a266ce72fcf1afab775c7ae071e06a4318accedd52c5da88","source":{"kind":"arxiv","id":"2309.11719","version":4},"attestation_state":"computed","paper":{"title":"Long-range-enhanced surface codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam M. Kaufman, Andrew Lucas, Matteo Marinelli, Yifan Hong","submitted_at":"2023-09-21T01:39:31Z","abstract_excerpt":"The surface code is a quantum error-correcting code for one logical qubit, protected by spatially localized parity checks in two dimensions. Due to fundamental constraints from spatial locality, storing more logical qubits requires either sacrificing the robustness of the surface code against errors or increasing the number of physical qubits. We bound the minimal number of spatially nonlocal parity checks necessary to add logical qubits to a surface code while maintaining, or improving, robustness to errors. We saturate the lower limit of this bound, when the number of added logical qubits is"},"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":"2309.11719","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-21T01:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"00ac337c03642f9b871e88c45ec2ed0c033c846c798de14c45586c5023fd3cf0","abstract_canon_sha256":"94ff8815c533caa2a1dd45a658d04816934cbe7754dfde72d9008c00d06dfee2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:24.317792Z","signature_b64":"MeNNU8N9SQybDzbsZUBTmCp2fezgxuQ3NITYd0zgC1Dnhwm/YyMizPnfwTH1modKkCkM4aUAHH6XwKhEQsbcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33236bed7b28abd6a266ce72fcf1afab775c7ae071e06a4318accedd52c5da88","last_reissued_at":"2026-07-05T09:19:24.317338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:24.317338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long-range-enhanced surface codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam M. Kaufman, Andrew Lucas, Matteo Marinelli, Yifan Hong","submitted_at":"2023-09-21T01:39:31Z","abstract_excerpt":"The surface code is a quantum error-correcting code for one logical qubit, protected by spatially localized parity checks in two dimensions. Due to fundamental constraints from spatial locality, storing more logical qubits requires either sacrificing the robustness of the surface code against errors or increasing the number of physical qubits. We bound the minimal number of spatially nonlocal parity checks necessary to add logical qubits to a surface code while maintaining, or improving, robustness to errors. We saturate the lower limit of this bound, when the number of added logical qubits is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.11719","kind":"arxiv","version":4},"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/2309.11719/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":"2309.11719","created_at":"2026-07-05T09:19:24.317403+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.11719v4","created_at":"2026-07-05T09:19:24.317403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.11719","created_at":"2026-07-05T09:19:24.317403+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMRWX3L3FCV5","created_at":"2026-07-05T09:19:24.317403+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMRWX3L3FCV5NITG","created_at":"2026-07-05T09:19:24.317403+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMRWX3L3","created_at":"2026-07-05T09:19:24.317403+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25026","citing_title":"Networked Realization of Quantum LDPC Codes","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GMRWX3L3FCV5NITGZZZPZ4NPVN","json":"https://pith.science/pith/GMRWX3L3FCV5NITGZZZPZ4NPVN.json","graph_json":"https://pith.science/api/pith-number/GMRWX3L3FCV5NITGZZZPZ4NPVN/graph.json","events_json":"https://pith.science/api/pith-number/GMRWX3L3FCV5NITGZZZPZ4NPVN/events.json","paper":"https://pith.science/paper/GMRWX3L3"},"agent_actions":{"view_html":"https://pith.science/pith/GMRWX3L3FCV5NITGZZZPZ4NPVN","download_json":"https://pith.science/pith/GMRWX3L3FCV5NITGZZZPZ4NPVN.json","view_paper":"https://pith.science/paper/GMRWX3L3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.11719&json=true","fetch_graph":"https://pith.science/api/pith-number/GMRWX3L3FCV5NITGZZZPZ4NPVN/graph.json","fetch_events":"https://pith.science/api/pith-number/GMRWX3L3FCV5NITGZZZPZ4NPVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMRWX3L3FCV5NITGZZZPZ4NPVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMRWX3L3FCV5NITGZZZPZ4NPVN/action/storage_attestation","attest_author":"https://pith.science/pith/GMRWX3L3FCV5NITGZZZPZ4NPVN/action/author_attestation","sign_citation":"https://pith.science/pith/GMRWX3L3FCV5NITGZZZPZ4NPVN/action/citation_signature","submit_replication":"https://pith.science/pith/GMRWX3L3FCV5NITGZZZPZ4NPVN/action/replication_record"}},"created_at":"2026-07-05T09:19:24.317403+00:00","updated_at":"2026-07-05T09:19:24.317403+00:00"}