{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JPFKTAVORGWB2RF4Q5E6QFCONU","short_pith_number":"pith:JPFKTAVO","canonical_record":{"source":{"id":"1808.02892","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T18:00:01Z","cross_cats_sorted":["cond-mat.mes-hall"],"title_canon_sha256":"958055401712c99feb3f20245e14c0844173608fbdbf105cc780334b0b6d0e65","abstract_canon_sha256":"c275604e82ddb1b9c6f3cb005923332149d22733b1047fcdc9c41bf88c15535a"},"schema_version":"1.0"},"canonical_sha256":"4bcaa982ae89ac1d44bc8749e8144e6d25f492d8631164a05efb6bd4d7cbb08b","source":{"kind":"arxiv","id":"1808.02892","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02892","created_at":"2026-05-17T23:51:58Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02892v3","created_at":"2026-05-17T23:51:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02892","created_at":"2026-05-17T23:51:58Z"},{"alias_kind":"pith_short_12","alias_value":"JPFKTAVORGWB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JPFKTAVORGWB2RF4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JPFKTAVO","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JPFKTAVORGWB2RF4Q5E6QFCONU","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02892","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T18:00:01Z","cross_cats_sorted":["cond-mat.mes-hall"],"title_canon_sha256":"958055401712c99feb3f20245e14c0844173608fbdbf105cc780334b0b6d0e65","abstract_canon_sha256":"c275604e82ddb1b9c6f3cb005923332149d22733b1047fcdc9c41bf88c15535a"},"schema_version":"1.0"},"canonical_sha256":"4bcaa982ae89ac1d44bc8749e8144e6d25f492d8631164a05efb6bd4d7cbb08b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:58.923781Z","signature_b64":"7sypnE6ochdZbp+xhGPg/KlEm/c1gnlgj2bAfnsMdvYVFh0ecXRXPDiRn05nzncMSnROgVcEkOKfNhRUt5euAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bcaa982ae89ac1d44bc8749e8144e6d25f492d8631164a05efb6bd4d7cbb08b","last_reissued_at":"2026-05-17T23:51:58.923421Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:58.923421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02892","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJ/Zsdq1bK4xTISUMBUdaG97zjDxY1zeBc0bWdt+5s0XwBlRqtTSaDj+5IiTjPhnszEx/Q93w8pAcn97jcjjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:18:45.813396Z"},"content_sha256":"109fb9da9ee8354c654ccf1c0b44567cbb88e49e8816936c70602d25ed2cc125","schema_version":"1.0","event_id":"sha256:109fb9da9ee8354c654ccf1c0b44567cbb88e49e8816936c70602d25ed2cc125"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JPFKTAVORGWB2RF4Q5E6QFCONU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"Daniel Litinski","submitted_at":"2018-08-08T18:00:01Z","abstract_excerpt":"Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales. They are strategies for space-time trade-offs, going from slow computations using few qubits to fast computations using many qubits. Our schemes are based on surface-code patches, which not only feature a low space cost compared to other surface-code schemes, but are also conceptually simple, simple enough that they can be described as a tile-based game with a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02892","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEeAOc2bzz6K1wvXRgVULn0DJhKgXAOe7IWFX3pHxiQTyL4C9wW7fAWlYXmBLgC0MtFd9lrphTVP/FfHQ6mwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:18:45.814016Z"},"content_sha256":"e6b30ee564f9ea2c2ea6dab96e025943881f103238fdaf198512688ecd9030ff","schema_version":"1.0","event_id":"sha256:e6b30ee564f9ea2c2ea6dab96e025943881f103238fdaf198512688ecd9030ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/bundle.json","state_url":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T15:18:45Z","links":{"resolver":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU","bundle":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/bundle.json","state":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JPFKTAVORGWB2RF4Q5E6QFCONU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c275604e82ddb1b9c6f3cb005923332149d22733b1047fcdc9c41bf88c15535a","cross_cats_sorted":["cond-mat.mes-hall"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T18:00:01Z","title_canon_sha256":"958055401712c99feb3f20245e14c0844173608fbdbf105cc780334b0b6d0e65"},"schema_version":"1.0","source":{"id":"1808.02892","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02892","created_at":"2026-05-17T23:51:58Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02892v3","created_at":"2026-05-17T23:51:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02892","created_at":"2026-05-17T23:51:58Z"},{"alias_kind":"pith_short_12","alias_value":"JPFKTAVORGWB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JPFKTAVORGWB2RF4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JPFKTAVO","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:e6b30ee564f9ea2c2ea6dab96e025943881f103238fdaf198512688ecd9030ff","target":"graph","created_at":"2026-05-17T23:51:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales. They are strategies for space-time trade-offs, going from slow computations using few qubits to fast computations using many qubits. Our schemes are based on surface-code patches, which not only feature a low space cost compared to other surface-code schemes, but are also conceptually simple, simple enough that they can be described as a tile-based game with a ","authors_text":"Daniel Litinski","cross_cats":["cond-mat.mes-hall"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T18:00:01Z","title":"A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02892","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:109fb9da9ee8354c654ccf1c0b44567cbb88e49e8816936c70602d25ed2cc125","target":"record","created_at":"2026-05-17T23:51:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c275604e82ddb1b9c6f3cb005923332149d22733b1047fcdc9c41bf88c15535a","cross_cats_sorted":["cond-mat.mes-hall"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T18:00:01Z","title_canon_sha256":"958055401712c99feb3f20245e14c0844173608fbdbf105cc780334b0b6d0e65"},"schema_version":"1.0","source":{"id":"1808.02892","kind":"arxiv","version":3}},"canonical_sha256":"4bcaa982ae89ac1d44bc8749e8144e6d25f492d8631164a05efb6bd4d7cbb08b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bcaa982ae89ac1d44bc8749e8144e6d25f492d8631164a05efb6bd4d7cbb08b","first_computed_at":"2026-05-17T23:51:58.923421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:58.923421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7sypnE6ochdZbp+xhGPg/KlEm/c1gnlgj2bAfnsMdvYVFh0ecXRXPDiRn05nzncMSnROgVcEkOKfNhRUt5euAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:58.923781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02892","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:109fb9da9ee8354c654ccf1c0b44567cbb88e49e8816936c70602d25ed2cc125","sha256:e6b30ee564f9ea2c2ea6dab96e025943881f103238fdaf198512688ecd9030ff"],"state_sha256":"bc1aba69f555cd2758678445c7ddb1ce7f829fe64a8ce1e368d26e0eb8b6b0ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82Z0P5oqC3Ehz9JBiK3QNZqhSU/uPJxpNkXuMCuCI+OBbGPYcXJP7MkYo5Ktj63dsAiYdErDN9Vegsaf11deAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:18:45.817262Z","bundle_sha256":"c3049a7712cbc5e2b55a1823e1a3305692c753cd8e5ccdea2384fac6bef472a5"}}