{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QAGTEVSK7X44RJM27NMGOFQ254","short_pith_number":"pith:QAGTEVSK","canonical_record":{"source":{"id":"2012.09663","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-17T15:20:02Z","cross_cats_sorted":[],"title_canon_sha256":"8a3080500570d51ac64a3b304ab4b8630e57322ac4a862c93a9679fff1beb031","abstract_canon_sha256":"28ad0b77ae8d0f4c2679ebcbea4162cd2ed12f7f9c1dd0f5b0237dc2d2db0af7"},"schema_version":"1.0"},"canonical_sha256":"800d32564afdf9c8a59afb5867161aef2cb4db3dee9cc3f04b666fb5dd4d8fa8","source":{"kind":"arxiv","id":"2012.09663","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09663","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09663v4","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09663","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"QAGTEVSK7X44","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"pith_short_16","alias_value":"QAGTEVSK7X44RJM2","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"pith_short_8","alias_value":"QAGTEVSK","created_at":"2026-07-05T04:29:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QAGTEVSK7X44RJM27NMGOFQ254","target":"record","payload":{"canonical_record":{"source":{"id":"2012.09663","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-17T15:20:02Z","cross_cats_sorted":[],"title_canon_sha256":"8a3080500570d51ac64a3b304ab4b8630e57322ac4a862c93a9679fff1beb031","abstract_canon_sha256":"28ad0b77ae8d0f4c2679ebcbea4162cd2ed12f7f9c1dd0f5b0237dc2d2db0af7"},"schema_version":"1.0"},"canonical_sha256":"800d32564afdf9c8a59afb5867161aef2cb4db3dee9cc3f04b666fb5dd4d8fa8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:29:49.769063Z","signature_b64":"B9CW6dK82JEzT2tHtJE3TH37kKY6QGgMhF/SjEURIRkLCmV2HXPaUwQxh8Fy0ACfHU30O7Q+4yw5vG7j1KL6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"800d32564afdf9c8a59afb5867161aef2cb4db3dee9cc3f04b666fb5dd4d8fa8","last_reissued_at":"2026-07-05T04:29:49.768641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:29:49.768641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.09663","source_version":4,"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-05T04:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bd6W3CvCJCtOHtKfSB8GhTFFa/GHXfYJHGXLln6Ku/0dlUdSSBl/eKd25QVT4efuJoAkKmS6JwL6QTst1bLKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:38:37.786822Z"},"content_sha256":"97030c8f0945c5598617f62157507bff47c7e6236f562000912e93f6f1a80790","schema_version":"1.0","event_id":"sha256:97030c8f0945c5598617f62157507bff47c7e6236f562000912e93f6f1a80790"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QAGTEVSK7X44RJM27NMGOFQ254","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Architecture aware compilation of quantum circuits via lazy synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Simon Martiel, Timoth\\'ee Goubault de Brugi\\`ere","submitted_at":"2020-12-17T15:20:02Z","abstract_excerpt":"Qubit routing is a key problematic related to quantum circuit compilation. It consists in rewriting a quantum circuit by adding the least possible number of instructions to make the circuit compliant with some architecture's connectivity constraints. Usually, this problem is tackled via either SWAP insertion techniques or re-synthesis of portions of the circuit using architecture aware synthesis algorithms. In this work, we propose a meta-heuristic that couples the iterative approach of SWAP insertion techniques with greedy architecture aware synthesis routines. We propose two new compilation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09663","kind":"arxiv","version":4},"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/2012.09663/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-05T04:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDR0K4xbGeVA1mChuDrILdanuaUvyf4JZYoqCEzkM6n4EVxwSb0z/qoQJx5Tv7WUqXgK4iawIm2F6nvo4Tf4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:38:37.787397Z"},"content_sha256":"1d0a5cc0b93bc391ef347b000e65d515dabe063afedcb17022bb14fa07659bb7","schema_version":"1.0","event_id":"sha256:1d0a5cc0b93bc391ef347b000e65d515dabe063afedcb17022bb14fa07659bb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAGTEVSK7X44RJM27NMGOFQ254/bundle.json","state_url":"https://pith.science/pith/QAGTEVSK7X44RJM27NMGOFQ254/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAGTEVSK7X44RJM27NMGOFQ254/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-18T19:38:37Z","links":{"resolver":"https://pith.science/pith/QAGTEVSK7X44RJM27NMGOFQ254","bundle":"https://pith.science/pith/QAGTEVSK7X44RJM27NMGOFQ254/bundle.json","state":"https://pith.science/pith/QAGTEVSK7X44RJM27NMGOFQ254/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAGTEVSK7X44RJM27NMGOFQ254/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QAGTEVSK7X44RJM27NMGOFQ254","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":"28ad0b77ae8d0f4c2679ebcbea4162cd2ed12f7f9c1dd0f5b0237dc2d2db0af7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-17T15:20:02Z","title_canon_sha256":"8a3080500570d51ac64a3b304ab4b8630e57322ac4a862c93a9679fff1beb031"},"schema_version":"1.0","source":{"id":"2012.09663","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09663","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09663v4","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09663","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"QAGTEVSK7X44","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"pith_short_16","alias_value":"QAGTEVSK7X44RJM2","created_at":"2026-07-05T04:29:49Z"},{"alias_kind":"pith_short_8","alias_value":"QAGTEVSK","created_at":"2026-07-05T04:29:49Z"}],"graph_snapshots":[{"event_id":"sha256:1d0a5cc0b93bc391ef347b000e65d515dabe063afedcb17022bb14fa07659bb7","target":"graph","created_at":"2026-07-05T04:29:49Z","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/2012.09663/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Qubit routing is a key problematic related to quantum circuit compilation. It consists in rewriting a quantum circuit by adding the least possible number of instructions to make the circuit compliant with some architecture's connectivity constraints. Usually, this problem is tackled via either SWAP insertion techniques or re-synthesis of portions of the circuit using architecture aware synthesis algorithms. In this work, we propose a meta-heuristic that couples the iterative approach of SWAP insertion techniques with greedy architecture aware synthesis routines. We propose two new compilation ","authors_text":"Simon Martiel, Timoth\\'ee Goubault de Brugi\\`ere","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-17T15:20:02Z","title":"Architecture aware compilation of quantum circuits via lazy synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09663","kind":"arxiv","version":4},"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:97030c8f0945c5598617f62157507bff47c7e6236f562000912e93f6f1a80790","target":"record","created_at":"2026-07-05T04:29:49Z","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":"28ad0b77ae8d0f4c2679ebcbea4162cd2ed12f7f9c1dd0f5b0237dc2d2db0af7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-17T15:20:02Z","title_canon_sha256":"8a3080500570d51ac64a3b304ab4b8630e57322ac4a862c93a9679fff1beb031"},"schema_version":"1.0","source":{"id":"2012.09663","kind":"arxiv","version":4}},"canonical_sha256":"800d32564afdf9c8a59afb5867161aef2cb4db3dee9cc3f04b666fb5dd4d8fa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"800d32564afdf9c8a59afb5867161aef2cb4db3dee9cc3f04b666fb5dd4d8fa8","first_computed_at":"2026-07-05T04:29:49.768641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:29:49.768641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B9CW6dK82JEzT2tHtJE3TH37kKY6QGgMhF/SjEURIRkLCmV2HXPaUwQxh8Fy0ACfHU30O7Q+4yw5vG7j1KL6CA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:29:49.769063Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.09663","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97030c8f0945c5598617f62157507bff47c7e6236f562000912e93f6f1a80790","sha256:1d0a5cc0b93bc391ef347b000e65d515dabe063afedcb17022bb14fa07659bb7"],"state_sha256":"be4f84fc1102e310d3eea293051abd06e3173e1bfd95dd6d62c4084f86aae3fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BZkkIlVK5OQAaH2UzNnQ3LJGLSb4E4R+vXA0ybTChTT3owgy6Fl/2MInF0Tspu2MQepiKJVk9CMiwGPQByWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T19:38:37.792692Z","bundle_sha256":"5b6a1b07bff4aad415b4945e5c1169691be119537dd23c13516e6a0d24018a11"}}