{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:H3MYRRYK4U2UM2K3T5HSFECGEH","short_pith_number":"pith:H3MYRRYK","schema_version":"1.0","canonical_sha256":"3ed988c70ae53546695b9f4f22904621ef200f526b55062c401b07c60c5613f4","source":{"kind":"arxiv","id":"2606.21192","version":1},"attestation_state":"computed","paper":{"title":"Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hiroki Hamaguchi, Kou Hamada, Nobuyuki Yoshioka, Teruo Tanimoto, Yasunari Suzuki, Yosuke Ueno","submitted_at":"2026-06-19T08:03:26Z","abstract_excerpt":"Fault-tolerant quantum computing based on lattice surgery requires place-and-route compilation with low spacetime overhead. Routing, in particular, faces a basic tension between suppressing path conflicts through greater spatial allocation and exploiting the time direction to realize ancilla-efficient spacetime routing. Existing approaches do not fully resolve this trade-off while retaining compatibility with inner factory layouts and termination guarantees. Here we introduce double-slice routing, a constant-depth spacetime-routing method that uses two consecutive time slices with a guarantee "},"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":"2606.21192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-19T08:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"0c10fc7cba23e98fe280d9579da3c4ec232b5d0925d1d349d9bc622212d52167","abstract_canon_sha256":"3195f52d8a54a76abb64e2471167d61275674418e149cd4882c225ba78204155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:32.985135Z","signature_b64":"KVvnQHUl7D0FXoLTyrqecU/9mkG2wuhhZr6GizLwNlmJb+cuAXV+eQld3xEVa/UZeohJOQb+xxE+xRPIkwFCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ed988c70ae53546695b9f4f22904621ef200f526b55062c401b07c60c5613f4","last_reissued_at":"2026-06-23T01:12:32.984661Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:32.984661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hiroki Hamaguchi, Kou Hamada, Nobuyuki Yoshioka, Teruo Tanimoto, Yasunari Suzuki, Yosuke Ueno","submitted_at":"2026-06-19T08:03:26Z","abstract_excerpt":"Fault-tolerant quantum computing based on lattice surgery requires place-and-route compilation with low spacetime overhead. Routing, in particular, faces a basic tension between suppressing path conflicts through greater spatial allocation and exploiting the time direction to realize ancilla-efficient spacetime routing. Existing approaches do not fully resolve this trade-off while retaining compatibility with inner factory layouts and termination guarantees. Here we introduce double-slice routing, a constant-depth spacetime-routing method that uses two consecutive time slices with a guarantee "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21192","kind":"arxiv","version":1},"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/2606.21192/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":"2606.21192","created_at":"2026-06-23T01:12:32.984731+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21192v1","created_at":"2026-06-23T01:12:32.984731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21192","created_at":"2026-06-23T01:12:32.984731+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3MYRRYK4U2U","created_at":"2026-06-23T01:12:32.984731+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3MYRRYK4U2UM2K3","created_at":"2026-06-23T01:12:32.984731+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3MYRRYK","created_at":"2026-06-23T01:12:32.984731+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H3MYRRYK4U2UM2K3T5HSFECGEH","json":"https://pith.science/pith/H3MYRRYK4U2UM2K3T5HSFECGEH.json","graph_json":"https://pith.science/api/pith-number/H3MYRRYK4U2UM2K3T5HSFECGEH/graph.json","events_json":"https://pith.science/api/pith-number/H3MYRRYK4U2UM2K3T5HSFECGEH/events.json","paper":"https://pith.science/paper/H3MYRRYK"},"agent_actions":{"view_html":"https://pith.science/pith/H3MYRRYK4U2UM2K3T5HSFECGEH","download_json":"https://pith.science/pith/H3MYRRYK4U2UM2K3T5HSFECGEH.json","view_paper":"https://pith.science/paper/H3MYRRYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21192&json=true","fetch_graph":"https://pith.science/api/pith-number/H3MYRRYK4U2UM2K3T5HSFECGEH/graph.json","fetch_events":"https://pith.science/api/pith-number/H3MYRRYK4U2UM2K3T5HSFECGEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3MYRRYK4U2UM2K3T5HSFECGEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3MYRRYK4U2UM2K3T5HSFECGEH/action/storage_attestation","attest_author":"https://pith.science/pith/H3MYRRYK4U2UM2K3T5HSFECGEH/action/author_attestation","sign_citation":"https://pith.science/pith/H3MYRRYK4U2UM2K3T5HSFECGEH/action/citation_signature","submit_replication":"https://pith.science/pith/H3MYRRYK4U2UM2K3T5HSFECGEH/action/replication_record"}},"created_at":"2026-06-23T01:12:32.984731+00:00","updated_at":"2026-06-23T01:12:32.984731+00:00"}