{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5HQTXLH4UAETED627BHGKWFUM5","short_pith_number":"pith:5HQTXLH4","canonical_record":{"source":{"id":"1510.03064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2015-10-11T15:37:34Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"122347c17c96023606589a5492c1e18fcfff1c8909d35c8697493d52d50f08de","abstract_canon_sha256":"434c599cea85a4f65bec2e52c6f946e69b834182ce50f985870508503815eccc"},"schema_version":"1.0"},"canonical_sha256":"e9e13bacfca009320fdaf84e6558b467666bd240821f8dd627866266dd8003e4","source":{"kind":"arxiv","id":"1510.03064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03064","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03064v1","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03064","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"5HQTXLH4UAET","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5HQTXLH4UAETED62","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5HQTXLH4","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5HQTXLH4UAETED627BHGKWFUM5","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2015-10-11T15:37:34Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"122347c17c96023606589a5492c1e18fcfff1c8909d35c8697493d52d50f08de","abstract_canon_sha256":"434c599cea85a4f65bec2e52c6f946e69b834182ce50f985870508503815eccc"},"schema_version":"1.0"},"canonical_sha256":"e9e13bacfca009320fdaf84e6558b467666bd240821f8dd627866266dd8003e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:15.878456Z","signature_b64":"/TWO7Xpxwi40FQeMEIisgZP72QPV5D7TrC+69+4KpUPHYOskBy4+nUcEblmIrqu5G0Yz6JZYLcjAgC4KOW+yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9e13bacfca009320fdaf84e6558b467666bd240821f8dd627866266dd8003e4","last_reissued_at":"2026-05-18T01:19:15.878096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:15.878096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03064","source_version":1,"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-18T01:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0y9UiRmydzxc02MfUGMVDaejHg8xAO9BNmAaexma/m+MUVQy4eYUDsm0maHSzgiP9bDvrZWQ61TjPVl1zrAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:52:55.028790Z"},"content_sha256":"eaa6b63c96f956e51880582a9c9f5ece8dfded12702e8ff69cf1faea6dd68973","schema_version":"1.0","event_id":"sha256:eaa6b63c96f956e51880582a9c9f5ece8dfded12702e8ff69cf1faea6dd68973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5HQTXLH4UAETED627BHGKWFUM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Methodology for bus layout for topological quantum error correcting codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.mes-hall","authors_text":"David P. DiVincenzo, Fabio L. Pedrocchi, Martin Wosnitzka","submitted_at":"2015-10-11T15:37:34Z","abstract_excerpt":"Most quantum computing architectures can be realized as two-dimensional lattices of qubits that interact with each other. We take transmon qubits and transmission line resonators as promising candidates for qubits and couplers; we use them as basic building elements of a quantum code. We then propose a simple framework to determine the optimal experimental layout to realize quantum codes. We show that this engineering optimization problem can be reduced to the solution of standard binary linear programs. While solving such programs is a NP-hard problem, we propose a way to find scalable optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03064","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":""},"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-18T01:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YlCDtvWjAng/4Ztd4s+4kxTPonbATsu0LPcZ9tRKEIUEinzuoUGB7aP7R6OSpiqC/5o0NydvjR6pzsvovLPQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:52:55.029135Z"},"content_sha256":"53ff4d7edf46095c708ccb974c33d7226bbab892b912eb27a9003c5746f637af","schema_version":"1.0","event_id":"sha256:53ff4d7edf46095c708ccb974c33d7226bbab892b912eb27a9003c5746f637af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HQTXLH4UAETED627BHGKWFUM5/bundle.json","state_url":"https://pith.science/pith/5HQTXLH4UAETED627BHGKWFUM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HQTXLH4UAETED627BHGKWFUM5/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-09T00:52:55Z","links":{"resolver":"https://pith.science/pith/5HQTXLH4UAETED627BHGKWFUM5","bundle":"https://pith.science/pith/5HQTXLH4UAETED627BHGKWFUM5/bundle.json","state":"https://pith.science/pith/5HQTXLH4UAETED627BHGKWFUM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HQTXLH4UAETED627BHGKWFUM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5HQTXLH4UAETED627BHGKWFUM5","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":"434c599cea85a4f65bec2e52c6f946e69b834182ce50f985870508503815eccc","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2015-10-11T15:37:34Z","title_canon_sha256":"122347c17c96023606589a5492c1e18fcfff1c8909d35c8697493d52d50f08de"},"schema_version":"1.0","source":{"id":"1510.03064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03064","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03064v1","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03064","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"5HQTXLH4UAET","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5HQTXLH4UAETED62","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5HQTXLH4","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:53ff4d7edf46095c708ccb974c33d7226bbab892b912eb27a9003c5746f637af","target":"graph","created_at":"2026-05-18T01:19:15Z","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":"Most quantum computing architectures can be realized as two-dimensional lattices of qubits that interact with each other. We take transmon qubits and transmission line resonators as promising candidates for qubits and couplers; we use them as basic building elements of a quantum code. We then propose a simple framework to determine the optimal experimental layout to realize quantum codes. We show that this engineering optimization problem can be reduced to the solution of standard binary linear programs. While solving such programs is a NP-hard problem, we propose a way to find scalable optima","authors_text":"David P. DiVincenzo, Fabio L. Pedrocchi, Martin Wosnitzka","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2015-10-11T15:37:34Z","title":"Methodology for bus layout for topological quantum error correcting codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03064","kind":"arxiv","version":1},"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:eaa6b63c96f956e51880582a9c9f5ece8dfded12702e8ff69cf1faea6dd68973","target":"record","created_at":"2026-05-18T01:19:15Z","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":"434c599cea85a4f65bec2e52c6f946e69b834182ce50f985870508503815eccc","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2015-10-11T15:37:34Z","title_canon_sha256":"122347c17c96023606589a5492c1e18fcfff1c8909d35c8697493d52d50f08de"},"schema_version":"1.0","source":{"id":"1510.03064","kind":"arxiv","version":1}},"canonical_sha256":"e9e13bacfca009320fdaf84e6558b467666bd240821f8dd627866266dd8003e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9e13bacfca009320fdaf84e6558b467666bd240821f8dd627866266dd8003e4","first_computed_at":"2026-05-18T01:19:15.878096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:15.878096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/TWO7Xpxwi40FQeMEIisgZP72QPV5D7TrC+69+4KpUPHYOskBy4+nUcEblmIrqu5G0Yz6JZYLcjAgC4KOW+yDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:15.878456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eaa6b63c96f956e51880582a9c9f5ece8dfded12702e8ff69cf1faea6dd68973","sha256:53ff4d7edf46095c708ccb974c33d7226bbab892b912eb27a9003c5746f637af"],"state_sha256":"171c8cc6813983e5fcb96d8975d12ccd7c863f56a4f39f85f835f9d04a684059"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e89Tw0KpkhHnVrcNq7BQZr9JlzwqKERK/OXUjMRtAy6rw+/QeVOlwEb0s9kvIB0m5zRLDHoJCF5pJ/84rmdvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:52:55.031106Z","bundle_sha256":"f8982306cd4a2a89bf99c87e089135c560452c7f034e134d94c88ae13acdc961"}}