{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6G6ETVPW3WAUYCNFOI44RB774X","short_pith_number":"pith:6G6ETVPW","canonical_record":{"source":{"id":"2106.06446","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-11T15:02:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e62ed58bd16d1ca59db0145bdce43ba01186074a2f70ea5b74d9fc56e8c33a82","abstract_canon_sha256":"73d0fdf8818437d5308bb0d21a3895b8f282e86ac1a58662793bdd75a185390e"},"schema_version":"1.0"},"canonical_sha256":"f1bc49d5f6dd814c09a57239c887ffe5cf72ba581cb283ab32f4bcd01d84e321","source":{"kind":"arxiv","id":"2106.06446","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06446","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06446v3","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06446","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"6G6ETVPW3WAU","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"6G6ETVPW3WAUYCNF","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"6G6ETVPW","created_at":"2026-07-05T03:00:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6G6ETVPW3WAUYCNFOI44RB774X","target":"record","payload":{"canonical_record":{"source":{"id":"2106.06446","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-11T15:02:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e62ed58bd16d1ca59db0145bdce43ba01186074a2f70ea5b74d9fc56e8c33a82","abstract_canon_sha256":"73d0fdf8818437d5308bb0d21a3895b8f282e86ac1a58662793bdd75a185390e"},"schema_version":"1.0"},"canonical_sha256":"f1bc49d5f6dd814c09a57239c887ffe5cf72ba581cb283ab32f4bcd01d84e321","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:34.108961Z","signature_b64":"7Lz5L5unkWNfA6JdC3IGp8jK0EJl4toYMSc50KAkfcgDGKISuZAQd1RvmM6s5vMAEoPCU01vkwDmNfK4R+TMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1bc49d5f6dd814c09a57239c887ffe5cf72ba581cb283ab32f4bcd01d84e321","last_reissued_at":"2026-07-05T03:00:34.108507Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:34.108507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.06446","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-07-05T03:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owSXF6q6eL1fmfZ/mM9DrPnr/D0rZGiRHijTdLnYqfPdUrRak+q4SaCagkGn2lfErGwJezM8Avg8z+K+HNIfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:12:08.026386Z"},"content_sha256":"4ec59847b2326fb9d19f03c89102c191ea394f170907105aa32b6ea9bf92e1b9","schema_version":"1.0","event_id":"sha256:4ec59847b2326fb9d19f03c89102c191ea394f170907105aa32b6ea9bf92e1b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6G6ETVPW3WAUYCNFOI44RB774X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal qubit assignment and routing via integer programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Giacomo Nannicini, Lev S Bishop, Oktay Gunluk, Petar Jurcevic","submitted_at":"2021-06-11T15:02:26Z","abstract_excerpt":"We consider the problem of mapping a logical quantum circuit onto a given hardware with limited two-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables that includes the initial allocation of qubits and their routing. We consider several cost functions: an approximation of the fidelity of the circuit, its total depth, and a measure of cross-talk, all of which can be incorporated in the model. Numerical experiments on synthetic data and different hardware topologies indicate that the error rate and depth can be optimized"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06446","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.06446/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"},"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-07-05T03:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXDGxyNW5NfS3mVqG2aaYGiCN6LO6inaOhnnveNdwKHcClsWM7NlYpX/v+E9AWZwLWWb+JSEddz66QDvunajBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:12:08.026929Z"},"content_sha256":"8d006221b9472b08b04b0ca911e32d396a8e16ed6876c924a4a113c0b6c3b0f4","schema_version":"1.0","event_id":"sha256:8d006221b9472b08b04b0ca911e32d396a8e16ed6876c924a4a113c0b6c3b0f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6G6ETVPW3WAUYCNFOI44RB774X/bundle.json","state_url":"https://pith.science/pith/6G6ETVPW3WAUYCNFOI44RB774X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6G6ETVPW3WAUYCNFOI44RB774X/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-08-21T17:12:08Z","links":{"resolver":"https://pith.science/pith/6G6ETVPW3WAUYCNFOI44RB774X","bundle":"https://pith.science/pith/6G6ETVPW3WAUYCNFOI44RB774X/bundle.json","state":"https://pith.science/pith/6G6ETVPW3WAUYCNFOI44RB774X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6G6ETVPW3WAUYCNFOI44RB774X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6G6ETVPW3WAUYCNFOI44RB774X","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":"73d0fdf8818437d5308bb0d21a3895b8f282e86ac1a58662793bdd75a185390e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-11T15:02:26Z","title_canon_sha256":"e62ed58bd16d1ca59db0145bdce43ba01186074a2f70ea5b74d9fc56e8c33a82"},"schema_version":"1.0","source":{"id":"2106.06446","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06446","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06446v3","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06446","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"6G6ETVPW3WAU","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"6G6ETVPW3WAUYCNF","created_at":"2026-07-05T03:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"6G6ETVPW","created_at":"2026-07-05T03:00:34Z"}],"graph_snapshots":[{"event_id":"sha256:8d006221b9472b08b04b0ca911e32d396a8e16ed6876c924a4a113c0b6c3b0f4","target":"graph","created_at":"2026-07-05T03:00:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.06446/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of mapping a logical quantum circuit onto a given hardware with limited two-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables that includes the initial allocation of qubits and their routing. We consider several cost functions: an approximation of the fidelity of the circuit, its total depth, and a measure of cross-talk, all of which can be incorporated in the model. Numerical experiments on synthetic data and different hardware topologies indicate that the error rate and depth can be optimized","authors_text":"Giacomo Nannicini, Lev S Bishop, Oktay Gunluk, Petar Jurcevic","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-11T15:02:26Z","title":"Optimal qubit assignment and routing via integer programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06446","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:4ec59847b2326fb9d19f03c89102c191ea394f170907105aa32b6ea9bf92e1b9","target":"record","created_at":"2026-07-05T03:00:34Z","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":"73d0fdf8818437d5308bb0d21a3895b8f282e86ac1a58662793bdd75a185390e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-11T15:02:26Z","title_canon_sha256":"e62ed58bd16d1ca59db0145bdce43ba01186074a2f70ea5b74d9fc56e8c33a82"},"schema_version":"1.0","source":{"id":"2106.06446","kind":"arxiv","version":3}},"canonical_sha256":"f1bc49d5f6dd814c09a57239c887ffe5cf72ba581cb283ab32f4bcd01d84e321","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1bc49d5f6dd814c09a57239c887ffe5cf72ba581cb283ab32f4bcd01d84e321","first_computed_at":"2026-07-05T03:00:34.108507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:00:34.108507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Lz5L5unkWNfA6JdC3IGp8jK0EJl4toYMSc50KAkfcgDGKISuZAQd1RvmM6s5vMAEoPCU01vkwDmNfK4R+TMAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:00:34.108961Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.06446","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ec59847b2326fb9d19f03c89102c191ea394f170907105aa32b6ea9bf92e1b9","sha256:8d006221b9472b08b04b0ca911e32d396a8e16ed6876c924a4a113c0b6c3b0f4"],"state_sha256":"c7339404e4e2bbfb30605db48a2827bd6d285bef154bf58223b73b15cf9e3e46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQvgf9E7vqknwj1RSKNRSShu1PtK4Fy+SNsGL4efCWZgsU7eoDLWHBU5cNmzH3GFTGGA/lLw16+Eo7NIEfRzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:12:08.032443Z","bundle_sha256":"56ece7e2576ab38df61f6a1ce4bcabfc41599bfca486a9c4d40f6eca5015deb0"}}