{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:S65E3VPCIHDXGHNND5YMXHN6LJ","short_pith_number":"pith:S65E3VPC","canonical_record":{"source":{"id":"2507.12199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-16T12:55:09Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"f2c52143f0d522c2e6f834bfb83eab8e83d4a6dc6582ed596613c71537972e23","abstract_canon_sha256":"2b70e8948f9b86465a2644062a369a4abd4f03685f04acd4135c2f1e900405af"},"schema_version":"1.0"},"canonical_sha256":"97ba4dd5e241c7731dad1f70cb9dbe5a5cb284c625d48210ee1aabffb5cb686e","source":{"kind":"arxiv","id":"2507.12199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.12199","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"arxiv_version","alias_value":"2507.12199v1","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12199","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"pith_short_12","alias_value":"S65E3VPCIHDX","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"pith_short_16","alias_value":"S65E3VPCIHDXGHNN","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"pith_short_8","alias_value":"S65E3VPC","created_at":"2026-07-05T11:38:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:S65E3VPCIHDXGHNND5YMXHN6LJ","target":"record","payload":{"canonical_record":{"source":{"id":"2507.12199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-16T12:55:09Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"f2c52143f0d522c2e6f834bfb83eab8e83d4a6dc6582ed596613c71537972e23","abstract_canon_sha256":"2b70e8948f9b86465a2644062a369a4abd4f03685f04acd4135c2f1e900405af"},"schema_version":"1.0"},"canonical_sha256":"97ba4dd5e241c7731dad1f70cb9dbe5a5cb284c625d48210ee1aabffb5cb686e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:16.379949Z","signature_b64":"VQ8LdtG+BZIY2oyS1ZEqRmqEBqHhWQbDUX7L2yWL6WTMOJ7elFZeUKz22pEumvuytb2cNzIHSfsdSS2wxMEzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97ba4dd5e241c7731dad1f70cb9dbe5a5cb284c625d48210ee1aabffb5cb686e","last_reissued_at":"2026-07-05T11:38:16.379390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:16.379390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.12199","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-07-05T11:38:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EuJLglBSfxwFpBJDTlmAXehJT3D2lZGpLEdZQ66GqEiM7E18YWit4ZxsIi4bzHyJHjKyjMl+vWMeO58VAbDkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:10:26.260678Z"},"content_sha256":"d85fc7dda67650b15a2255aeae18189b9e6187c6d8468e340d37fa53fa6fa70f","schema_version":"1.0","event_id":"sha256:d85fc7dda67650b15a2255aeae18189b9e6187c6d8468e340d37fa53fa6fa70f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:S65E3VPCIHDXGHNND5YMXHN6LJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"Friedrich Wagner, Moritz Stargalla","submitted_at":"2025-07-16T12:55:09Z","abstract_excerpt":"Quantum computers promise to outperform their classical counterparts at certain tasks. However, existing quantum devices are error-prone and restricted in size. Thus, effective compilation methods are crucial to exploit limited quantum resources. In this work, we address the problem of qubit routing for commuting gates, which arises, for example, during the compilation of the well-known Quantum Approximate Optimization Algorithm. We propose a two-step decomposition approach based on integer programming, which is guaranteed to return an optimal solution. To justify the use of integer programmin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12199","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.12199/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-05T11:38:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+ABVH9cPUh53zIsVNKG6Pak+CJJYJf9/SWG7gXCmRhlY6rK40Nifv9leYi55IbjFecX6CMDV5FKF1B9lLSZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:10:26.261199Z"},"content_sha256":"70b40b0e42e00faa1c9754c08682bcfc889696909531853f4660bd732ed1ac58","schema_version":"1.0","event_id":"sha256:70b40b0e42e00faa1c9754c08682bcfc889696909531853f4660bd732ed1ac58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S65E3VPCIHDXGHNND5YMXHN6LJ/bundle.json","state_url":"https://pith.science/pith/S65E3VPCIHDXGHNND5YMXHN6LJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S65E3VPCIHDXGHNND5YMXHN6LJ/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-08T23:10:26Z","links":{"resolver":"https://pith.science/pith/S65E3VPCIHDXGHNND5YMXHN6LJ","bundle":"https://pith.science/pith/S65E3VPCIHDXGHNND5YMXHN6LJ/bundle.json","state":"https://pith.science/pith/S65E3VPCIHDXGHNND5YMXHN6LJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S65E3VPCIHDXGHNND5YMXHN6LJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:S65E3VPCIHDXGHNND5YMXHN6LJ","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":"2b70e8948f9b86465a2644062a369a4abd4f03685f04acd4135c2f1e900405af","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-16T12:55:09Z","title_canon_sha256":"f2c52143f0d522c2e6f834bfb83eab8e83d4a6dc6582ed596613c71537972e23"},"schema_version":"1.0","source":{"id":"2507.12199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.12199","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"arxiv_version","alias_value":"2507.12199v1","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12199","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"pith_short_12","alias_value":"S65E3VPCIHDX","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"pith_short_16","alias_value":"S65E3VPCIHDXGHNN","created_at":"2026-07-05T11:38:16Z"},{"alias_kind":"pith_short_8","alias_value":"S65E3VPC","created_at":"2026-07-05T11:38:16Z"}],"graph_snapshots":[{"event_id":"sha256:70b40b0e42e00faa1c9754c08682bcfc889696909531853f4660bd732ed1ac58","target":"graph","created_at":"2026-07-05T11:38:16Z","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/2507.12199/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum computers promise to outperform their classical counterparts at certain tasks. However, existing quantum devices are error-prone and restricted in size. Thus, effective compilation methods are crucial to exploit limited quantum resources. In this work, we address the problem of qubit routing for commuting gates, which arises, for example, during the compilation of the well-known Quantum Approximate Optimization Algorithm. We propose a two-step decomposition approach based on integer programming, which is guaranteed to return an optimal solution. To justify the use of integer programmin","authors_text":"Friedrich Wagner, Moritz Stargalla","cross_cats":["quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12199","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:d85fc7dda67650b15a2255aeae18189b9e6187c6d8468e340d37fa53fa6fa70f","target":"record","created_at":"2026-07-05T11:38:16Z","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":"2b70e8948f9b86465a2644062a369a4abd4f03685f04acd4135c2f1e900405af","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-16T12:55:09Z","title_canon_sha256":"f2c52143f0d522c2e6f834bfb83eab8e83d4a6dc6582ed596613c71537972e23"},"schema_version":"1.0","source":{"id":"2507.12199","kind":"arxiv","version":1}},"canonical_sha256":"97ba4dd5e241c7731dad1f70cb9dbe5a5cb284c625d48210ee1aabffb5cb686e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97ba4dd5e241c7731dad1f70cb9dbe5a5cb284c625d48210ee1aabffb5cb686e","first_computed_at":"2026-07-05T11:38:16.379390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:16.379390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VQ8LdtG+BZIY2oyS1ZEqRmqEBqHhWQbDUX7L2yWL6WTMOJ7elFZeUKz22pEumvuytb2cNzIHSfsdSS2wxMEzCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:16.379949Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.12199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d85fc7dda67650b15a2255aeae18189b9e6187c6d8468e340d37fa53fa6fa70f","sha256:70b40b0e42e00faa1c9754c08682bcfc889696909531853f4660bd732ed1ac58"],"state_sha256":"2b8968b3af99a887995b8c240e424d402c12f2765708d6f9c78a62faa2e8d914"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMWlzC+cNNcyFy7ufppA9iAo5UbgTKR2KWnUxb2K/B0d8nrvXEp5APFIYXyI8ROetHtgIuRV9BaPNk56W/S7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:10:26.266929Z","bundle_sha256":"91c43c93c96c8ad52974414896be4b534d6049b235e4070e0ddee4dfd3c8a2da"}}