{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LF4S2REH2SA3G3A4V5G5OL5WXI","short_pith_number":"pith:LF4S2REH","canonical_record":{"source":{"id":"1609.08062","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-26T16:42:03Z","cross_cats_sorted":[],"title_canon_sha256":"a96e91b1aaf7dc7cd8bc5069faab86fccac7c022cc7222d23700c603a08d92c2","abstract_canon_sha256":"b1b2ee0315cedba0d127cb222672e4f6a3267394b38b93533d037a681087be50"},"schema_version":"1.0"},"canonical_sha256":"59792d4487d481b36c1caf4dd72fb6ba34f2bb7146d5f7fe8b1647bb7406b880","source":{"kind":"arxiv","id":"1609.08062","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08062","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08062v3","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08062","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"LF4S2REH2SA3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LF4S2REH2SA3G3A4","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LF4S2REH","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LF4S2REH2SA3G3A4V5G5OL5WXI","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08062","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-26T16:42:03Z","cross_cats_sorted":[],"title_canon_sha256":"a96e91b1aaf7dc7cd8bc5069faab86fccac7c022cc7222d23700c603a08d92c2","abstract_canon_sha256":"b1b2ee0315cedba0d127cb222672e4f6a3267394b38b93533d037a681087be50"},"schema_version":"1.0"},"canonical_sha256":"59792d4487d481b36c1caf4dd72fb6ba34f2bb7146d5f7fe8b1647bb7406b880","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:22.434574Z","signature_b64":"BNAvFr0oGAl6TBtRc1MXHHp4vyI28K8iaJDBOneyw7/HvjdZDVC6dX70bXufbLJt2o5OSbHFELIhcfOWfgbvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59792d4487d481b36c1caf4dd72fb6ba34f2bb7146d5f7fe8b1647bb7406b880","last_reissued_at":"2026-05-18T00:31:22.434097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:22.434097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08062","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-18T00:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oh2CdRgy45AB+50TrMQxXQ2eEJvS2kzZv4YtRQXodFYWFuTql0I1FmUUC8cy2XgT863KBVhhILJMf424uG1OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:41:11.324469Z"},"content_sha256":"5b702ba393e924ba2f65734a83db6c6eca95e3076e7a1387a82840847bb1e41c","schema_version":"1.0","event_id":"sha256:5b702ba393e924ba2f65734a83db6c6eca95e3076e7a1387a82840847bb1e41c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LF4S2REH2SA3G3A4V5G5OL5WXI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault-tolerant interface between quantum memories and quantum processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hans J. Briegel, Hendrik Poulsen Nautrup, Nicolai Friis","submitted_at":"2016-09-26T16:42:03Z","abstract_excerpt":"Topological error correction codes are promising candidates to protect quantum computations from the deteriorating effects of noise. While some codes provide high noise thresholds suitable for robust quantum memories, others allow straightforward gate implementation needed for data processing. To exploit the particular advantages of different topological codes for fault-tolerant quantum computation, it is necessary to be able to switch between them. Here we propose a practical solution, subsystem lattice surgery, which requires only two-body nearest neighbor interactions in a fixed layout in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08062","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-18T00:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JHrGXZLOiAObK3LjjSlir2TCodmLLYNx/KKvmus+9t3MV0udWPH8x1hzQSHWAVkbA8TKYgmLTkzi2SWcNmCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:41:11.324818Z"},"content_sha256":"92a805962ea882a2024a8b30308cd040c7028783145624fe1f64f05ce77b588b","schema_version":"1.0","event_id":"sha256:92a805962ea882a2024a8b30308cd040c7028783145624fe1f64f05ce77b588b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LF4S2REH2SA3G3A4V5G5OL5WXI/bundle.json","state_url":"https://pith.science/pith/LF4S2REH2SA3G3A4V5G5OL5WXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LF4S2REH2SA3G3A4V5G5OL5WXI/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-06-03T02:41:11Z","links":{"resolver":"https://pith.science/pith/LF4S2REH2SA3G3A4V5G5OL5WXI","bundle":"https://pith.science/pith/LF4S2REH2SA3G3A4V5G5OL5WXI/bundle.json","state":"https://pith.science/pith/LF4S2REH2SA3G3A4V5G5OL5WXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LF4S2REH2SA3G3A4V5G5OL5WXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LF4S2REH2SA3G3A4V5G5OL5WXI","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":"b1b2ee0315cedba0d127cb222672e4f6a3267394b38b93533d037a681087be50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-26T16:42:03Z","title_canon_sha256":"a96e91b1aaf7dc7cd8bc5069faab86fccac7c022cc7222d23700c603a08d92c2"},"schema_version":"1.0","source":{"id":"1609.08062","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08062","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08062v3","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08062","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"LF4S2REH2SA3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LF4S2REH2SA3G3A4","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LF4S2REH","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:92a805962ea882a2024a8b30308cd040c7028783145624fe1f64f05ce77b588b","target":"graph","created_at":"2026-05-18T00:31:22Z","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":"Topological error correction codes are promising candidates to protect quantum computations from the deteriorating effects of noise. While some codes provide high noise thresholds suitable for robust quantum memories, others allow straightforward gate implementation needed for data processing. To exploit the particular advantages of different topological codes for fault-tolerant quantum computation, it is necessary to be able to switch between them. Here we propose a practical solution, subsystem lattice surgery, which requires only two-body nearest neighbor interactions in a fixed layout in a","authors_text":"Hans J. Briegel, Hendrik Poulsen Nautrup, Nicolai Friis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-26T16:42:03Z","title":"Fault-tolerant interface between quantum memories and quantum processors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08062","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:5b702ba393e924ba2f65734a83db6c6eca95e3076e7a1387a82840847bb1e41c","target":"record","created_at":"2026-05-18T00:31:22Z","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":"b1b2ee0315cedba0d127cb222672e4f6a3267394b38b93533d037a681087be50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-26T16:42:03Z","title_canon_sha256":"a96e91b1aaf7dc7cd8bc5069faab86fccac7c022cc7222d23700c603a08d92c2"},"schema_version":"1.0","source":{"id":"1609.08062","kind":"arxiv","version":3}},"canonical_sha256":"59792d4487d481b36c1caf4dd72fb6ba34f2bb7146d5f7fe8b1647bb7406b880","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59792d4487d481b36c1caf4dd72fb6ba34f2bb7146d5f7fe8b1647bb7406b880","first_computed_at":"2026-05-18T00:31:22.434097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:22.434097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BNAvFr0oGAl6TBtRc1MXHHp4vyI28K8iaJDBOneyw7/HvjdZDVC6dX70bXufbLJt2o5OSbHFELIhcfOWfgbvAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:22.434574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08062","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b702ba393e924ba2f65734a83db6c6eca95e3076e7a1387a82840847bb1e41c","sha256:92a805962ea882a2024a8b30308cd040c7028783145624fe1f64f05ce77b588b"],"state_sha256":"d71fa9e9ed5f11a8efdcad6f57ab47ca2e777aedd3809734fde8507a9bc71916"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63Bh00bezjWFf1+Xmb37P6YjyD+ePau2GEyFIqeGrfUiDyHQzKspIDyBs7CaZafQka9DVWYtwhNMo3MpB/DVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:41:11.326776Z","bundle_sha256":"7c2a866da33f5324f1bf4b7990c01c514679cca6ed7e6f9d88e77e8af3e1f757"}}