{"as_of":"2026-08-10T06:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c4fc825b4bc810d6f692a63965179ce7031561afe3a2324589f5526e12d3e265","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:06:36.624457Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.12199/citation-record","integrity":"/paper/2507.12199/integrity","json":"/paper/2507.12199/citation-record.json","paper":"/paper/2507.12199"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:32.055648Z","title":"Quantum algorithms for quantum chemistry and quantum materials science.Chemical Reviews, 120(22):12685–12717, Octo- ber 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.055648Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:e085c8e927754026376e208a04fcd68aeceb62d77b05d2852e0931ba5ad70baf","observation_id":"14812dc6-f921-4055-b944-fddb8ea99b85","resolution":{"observed_at":"2026-08-06T17:06:32.055648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:44.744762Z","title":"Quantum algorithm for alchemical optimization in material design.Chemical science, 12(12):4345–4352, 2021","venue":null,"work_id":"65cb9def-7367-46dc-87fa-af5fcf470830","year":2021},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.125175Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:e12c2d5bdd988ea51605788f7444b83309442779c5f11d50376cabf908f9f8e3","observation_id":"a8537c82-7a01-4712-9b9c-b571c44a694b","resolution":{"observed_at":"2026-08-06T17:06:44.832019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:44.547951Z","title":"Cerezo, Guillaume Verdon, Hsin-Yuan Huang, Lukasz Cincio, and Patrick J","venue":null,"work_id":"8f68b48d-d325-4ecb-a122-e30b4f53db8f","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.200948Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:c270b1666090b41724d0dbb5a43e7890f8836ef49ef76d47f0eea4ca6757aba7","observation_id":"24e1b4e6-86d8-4b6b-b064-716016a36126","resolution":{"observed_at":"2026-08-06T17:06:44.639839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:32.353696Z","title":"Egger, Bruce G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.353696Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:7e24eaa81d8d9ea8ad0ee16a04721b65bd525c4d66c0d6f7b8b3bed96954eb84","observation_id":"20036c14-ce6a-434b-93c9-e2b562d536eb","resolution":{"observed_at":"2026-08-06T17:06:32.353696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:32.430465Z","title":"Quantum computing in the nisq era and beyond.Quantum, 2:79, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.430465Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:2a301ffc54fc95124d3e06b25c9177a2723f9840523b7201c8691cdf7969e003","observation_id":"7fa1b263-2164-4fde-9a35-af455d40cdd5","resolution":{"observed_at":"2026-08-06T17:06:32.430465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:44.332499Z","title":"Bishop, Oktay Günlük, and Petar Jurcevic","venue":null,"work_id":"4771c614-8633-43db-b3f5-b41fe2b601ea","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.495072Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:d227a2b121d70488fbdbd748a7df9aadffb636fe9e64a626fcfc1364da913215","observation_id":"4b795bd9-a31a-43cb-a2df-55c202acbf14","resolution":{"observed_at":"2026-08-06T17:06:44.418757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:32.530177Z","title":"Improving quantum computation by optimized qubit routing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.530177Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:5d7084425b0ab7e96944a25f8d36005e33a040579df688232e9f454ed8f73ae9","observation_id":"70624166-117e-4999-af11-6aa12a57d204","resolution":{"observed_at":"2026-08-06T17:06:32.530177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:32.645481Z","title":"Baker, Ali Javadi-Abhari, Frederic T","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.645481Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:cd926f6a2827efe2c79c7b076d927aea7548d7a0f2fbcd27e89a870314f42ff6","observation_id":"461dee9d-44dd-4364-8ac0-ad815cf3739c","resolution":{"observed_at":"2026-08-06T17:06:32.645481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:44.160558Z","title":"Optimized noise suppression for quantum circuits","venue":null,"work_id":"8a5e33cf-5b85-43b6-8c08-71b56ae65216","year":2025},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.717216Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:1c8aadecec856bd6a9190a35b00f25518e80f58aa059eef323dabfcf67de1d57","observation_id":"9036c324-9db3-4e0e-928c-5bad45bff988","resolution":{"observed_at":"2026-08-06T17:06:44.220769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:32.768244Z","title":"Nielsen and Isaac L","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.768244Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:9d28071e56ae080e01cb0677c5b9b42fb30668eb355613a6ebef0f104f7384dd","observation_id":"73aac7f8-d0b0-48d2-99f4-8229859a4338","resolution":{"observed_at":"2026-08-06T17:06:32.768244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:32.852828Z","title":"The solovay-kitaev algorithm.arXiv preprint quant- ph/0505030, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.852828Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:df4537e0652696706fb2125157ab95db8a1e6d03f28e3f4a72e874188cf360ea","observation_id":"a3d2b813-1c8e-4fa7-a50b-ef7657d01a1a","resolution":{"observed_at":"2026-08-06T17:06:32.852828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-06T17:06:32.918741Z","title":"A quantum approximate optimization al- gorithm","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.918741Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:ee0fe2ce66d203a3b2fd5f1ab8b7586408be0780c4b74cd0f703832b38bd0587","observation_id":"9bb5b2fa-f2b7-48d6-b6d6-c3465646dde6","resolution":{"observed_at":"2026-08-06T17:06:32.918741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.22331/q-2023-07-25-1067","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Egger, David Ochsner, and Stefan Woerner","venue":"Quantum","work_id":"869a3b61-29a3-49a9-919f-be32101332ed","year":2023},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.971210Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:c6a64d50aaf2e0bfea499fe14d60bcd2621bf0d4bacc70bf8324f83a601ccd1e","observation_id":"e892f642-9fea-4afd-b6b6-32ef61fcbdfe","resolution":{"observed_at":"2026-08-06T17:06:37.189469Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:33.054287Z","title":"Quantum circuit synthesis and compilation optimization: Overview and prospects","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.054287Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:8ca5fad924c0ecd0769406e03b6b76cce5fe1f789a66668f3171e4061e185df1","observation_id":"c4d80f8f-1e16-4c4b-b62d-e7073c911afb","resolution":{"observed_at":"2026-08-06T17:06:33.054287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:43.936748Z","title":null,"venue":null,"work_id":"093c3401-12a0-450d-ad12-014c2f6afe25","year":2018},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.123268Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:3e78714c0f417f636b853f89b99f093c6ca1e361259f35b619a2ae793dc38721","observation_id":"b2cbcbc7-8a38-4072-b4c2-daac13f2073e","resolution":{"observed_at":"2026-08-06T17:06:44.007536Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.08091","last_updated":"2019-02-28T19:06:27Z","snapshot_observed_at":"2026-08-09T12:17:42.783952Z","submitted_at":"2019-02-21T15:09:20Z","title":"On the qubit routing problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.08091","snapshot_observed_at":"2026-08-06T17:06:33.211890Z","title":"On the qubit routing problem.arXiv preprint arXiv:1902.08091, 2019","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.211890Z"},"links":{"cited_paper":"/paper/1902.08091","citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:83522239d2b4793634ad035e7e1869789ab1ba13c8aa34d7298ab99c1fedef32","observation_id":"91a8bf32-0881-4731-857d-317b9ff6a0c6","resolution":{"observed_at":"2026-08-06T17:06:33.211890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:43.617573Z","title":"Tackling the qubit mapping problem for nisq-era quantum devices","venue":null,"work_id":"733e0f2b-6f15-4ee5-9754-7cd13afeac0a","year":2019},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.294526Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:1f5713975ddfd3331c91e394c540deb2abb331c2fa715f89ccab52afdde08361","observation_id":"74f6226c-ac49-419a-80a4-ac979c5f007e","resolution":{"observed_at":"2026-08-06T17:06:43.777275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:43.373290Z","title":"t| ket>: a retargetable compiler for nisq devices.Quantum Science and Technology, 6(1):014003, 2020","venue":null,"work_id":"12fe6819-9b27-43e6-81ec-2291dd1f67e3","year":2020},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.360230Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:d1424b0c37d4ec5cc8e54889778b6cefb82ae2218381199394042786c811a2c1","observation_id":"aa90bbf6-1359-4e0c-b41b-eec36a8ab6f2","resolution":{"observed_at":"2026-08-06T17:06:43.485204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:43.052065Z","title":"Compilation for dynamically field- programmable qubit arrays with efficient and provably near-optimal scheduling","venue":null,"work_id":"0b13f0fc-f847-4416-92f3-4112f8f7b5be","year":2025},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.429506Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:6499ef4c975c997b9eac1ebe51aa9254475f1380bbe574d514436eb3bf81029d","observation_id":"c7b88c9b-349d-4189-923b-4bef3b75dc9e","resolution":{"observed_at":"2026-08-06T17:06:43.200734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16468","last_updated":"2025-04-23T07:27:27Z","snapshot_observed_at":"2026-08-07T15:59:59.270184Z","submitted_at":"2025-04-23T07:27:27Z","title":"HAQA: A Hardware-Guided and Fidelity-Aware Strategy for Efficient Qubit Mapping Optimization","version":1},"cited_work":{"arxiv_id":"2504.16468","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.16468","snapshot_observed_at":"2026-08-06T17:06:37.939891Z","title":"HAQA: A Hardware-Guided and Fidelity-Aware Strategy for Efficient Qubit Mapping Optimization","venue":"quant-ph","work_id":"f57cf53f-7209-4c51-8791-509878191ec1","year":2025},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.526372Z"},"links":{"cited_paper":"/paper/2504.16468","citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:5040431e1a63e89cb55b9493fa0be8e81a825163f995fca506d6a6c9d79af107","observation_id":"990e50fc-92c8-4ae7-b0af-d45da295a6cf","resolution":{"observed_at":"2026-08-06T17:06:37.993064Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:42.927974Z","title":"Optimality study of existing quantum computing layout synthesis tools","venue":null,"work_id":"12d2631c-7541-4467-b985-42be2827c6a2","year":2020},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.637469Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:deb884aa45e94593649b8b71b0c206fbea074973f9ec2b4cb15322d9b8bb331b","observation_id":"e1edbaf3-e291-42bc-ab30-e31fe0d2e9dd","resolution":{"observed_at":"2026-08-06T17:06:43.003338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:42.799857Z","title":"Mapping quantum circuits to ibm qx archi- tectures using the minimal number of swap and h operations","venue":null,"work_id":"9aed1fb5-7f8b-4b30-bb67-f2787b859c0d","year":2019},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.714595Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:7011c7680328a551671f052ab294065aee405e6ff79f0c0e51e5dbe90dbaef50","observation_id":"dfaca747-860e-4169-a365-62ac26b83049","resolution":{"observed_at":"2026-08-06T17:06:42.861124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:42.672618Z","title":"Qubit mapping and routing via maxsat","venue":null,"work_id":"08062c58-065d-4b7d-9d28-0b4be8d9687e","year":2022},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.787299Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:73879145c8998d8c85d2e8e47064e86c2a741792d49e5fd262554e7e76270363","observation_id":"f0b8b40a-5c3c-4f1a-ae26-4c9c3cb13d14","resolution":{"observed_at":"2026-08-06T17:06:42.725022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:42.503385Z","title":"Quantum circuit mapping based on incremental and parallel sat solving","venue":null,"work_id":"e5ddefdd-b9e2-498f-bea8-eb41d954fdd5","year":2024},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.848926Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:740583f5bb46624fae817fef25346c5e4472fb62e4d00b74bb7fecd2de486238","observation_id":"963218e8-d08a-4bbd-b03a-d77e35d54502","resolution":{"observed_at":"2026-08-06T17:06:42.584408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.11598","last_updated":"2024-07-22T12:00:02Z","snapshot_observed_at":"2026-07-06T17:46:11.859512Z","submitted_at":"2024-03-18T09:19:01Z","title":"Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits","version":2},"cited_work":{"arxiv_id":"2403.11598","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.11598","snapshot_observed_at":"2026-08-06T17:06:37.777270Z","title":"Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits","venue":"quant-ph","work_id":"263fb540-0d8e-43bd-a49d-8989bb8360e8","year":2024},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:33.930782Z"},"links":{"cited_paper":"/paper/2403.11598","citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:c58d583bd449a8036ae35569ba29873f9d5f775d8871ad767e31dd8fccc9ea4d","observation_id":"bba96c2d-ec1a-4744-8e05-c3002696ad49","resolution":{"observed_at":"2026-08-06T17:06:37.850884Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:42.369557Z","title":"Optimal layout-aware cnot circuit synthesis with qubit per- mutation","venue":null,"work_id":"8a5a90a2-fea3-469a-aeb3-5427b0d63783","year":2024},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.007583Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:876465ede7b10a6de0679520476fa2704b15927f9b0fbcf00c50c9a08a3a5109","observation_id":"9bba3a93-5ea2-4dfd-a508-fd16dfdf0634","resolution":{"observed_at":"2026-08-06T17:06:42.412084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:34.114756Z","title":"Optimal layout synthesis for quantum computing","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.114756Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:4f488586b9c90ffc0bc13308e1fc31cea48e8ea4d187ea3ee6dfdbab8892515e","observation_id":"f34db376-85aa-4696-aca6-8c38efebb4c1","resolution":{"observed_at":"2026-08-06T17:06:34.114756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:42.194682Z","title":"Scalable optimal lay- out synthesis for nisq quantum processors","venue":null,"work_id":"b8b15445-346e-4e4e-8494-c9f26ffbd217","year":2023},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.208493Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:fe746ba2b0bb089ee699e59f57123288ef39705fbc2eba9ad74d482e7da36163","observation_id":"49ad81f4-2129-44da-9bdb-a052fb805714","resolution":{"observed_at":"2026-08-06T17:06:42.267368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:34.271106Z","title":"Valor, Julien Gacon, Caroline Tornow, Luciano Bello, Stefan Wo- erner, and Daniel J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.271106Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:4e6f8f8cbb32ee577ee09f9f2b5fa3ad97e9198ad41330ce2d2b1bac5908b925","observation_id":"2a13a14d-516a-4a55-86d9-b45e833d4dcf","resolution":{"observed_at":"2026-08-06T17:06:34.271106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:42.045802Z","title":"2qan: Aquantumcompilerfor2-localqubithamiltoniansimulation algorithms","venue":null,"work_id":"51350978-8662-4745-8b32-b54201009607","year":2022},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.345589Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:06db95ef6156ee0697a01023a881979569e6a4b3cc3055437de9aeeca4609156","observation_id":"608413ed-87c5-4d8c-a0bd-485269e33e7e","resolution":{"observed_at":"2026-08-06T17:06:42.121646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:41.913791Z","title":"A sat approach to the initial mapping problem in swap gate insertion for commuting gates","venue":null,"work_id":"e40eeb70-183f-4ba4-803c-2a64d7cb5ec1","year":2023},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.451226Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:9b0b22dc291908e1cc47f544a9aafde1ca86efe1203d3cc31df3e188a0fa7ebc","observation_id":"f0623bec-0d3f-4ed1-a426-cce3b9a22e85","resolution":{"observed_at":"2026-08-06T17:06:41.974695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:41.791500Z","title":"Exploiting the regular structure of modern quantum architectures for compiling and optimizing programs with permutable operators","venue":null,"work_id":"ce085694-7891-46b8-9a80-be361655e39a","year":2023},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.576478Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:f17a29bd465d6dbbaa1eb78cf986fa03d1d108941413e18fd49005aebbf616d5","observation_id":"0a85bc1d-1fe1-4289-9339-d7920c6852d2","resolution":{"observed_at":"2026-08-06T17:06:41.845932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15982","last_updated":"2023-12-26T10:26:10Z","snapshot_observed_at":"2026-07-06T17:08:04.891015Z","submitted_at":"2023-12-26T10:26:10Z","title":"Improved Qubit Routing for QAOA Circuits","version":1},"cited_work":{"arxiv_id":"2312.15982","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.15982","snapshot_observed_at":"2026-08-06T17:06:37.631935Z","title":"Improved Qubit Routing for QAOA Circuits","venue":"quant-ph","work_id":"0a81f1d9-889b-4b1a-a43b-1095f44908eb","year":2023},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.628814Z"},"links":{"cited_paper":"/paper/2312.15982","citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:0dff0391143d869dc5ba84236870d8f149f245336d26f6f079998de08dd7e549","observation_id":"58da8713-e038-4b55-a018-7f455a0a463d","resolution":{"observed_at":"2026-08-06T17:06:37.692921Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08839","last_updated":"2025-03-04T19:34:57Z","snapshot_observed_at":"2026-08-09T04:46:02.344409Z","submitted_at":"2025-02-12T23:13:01Z","title":"Assessing Quantum Layout Synthesis Tools via Known Optimal-SWAP Cost Benchmarks","version":2},"cited_work":{"arxiv_id":"2502.08839","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.08839","snapshot_observed_at":"2026-08-06T17:06:37.437709Z","title":"Assessing Quantum Layout Synthesis Tools via Known Optimal-SWAP Cost Benchmarks","venue":"quant-ph","work_id":"36731aa3-5319-4d3d-b12c-79c7c45ce2bc","year":2025},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.719973Z"},"links":{"cited_paper":"/paper/2502.08839","citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:dd8a8cfbb2680da92575caef1adee44f4427dcc000905a2edb8d9501bb66361e","observation_id":"aaa14d3d-71ae-4658-a7d8-c21823d5ab30","resolution":{"observed_at":"2026-08-06T17:06:37.513908Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:41.639578Z","title":"Springer Publishing Company, Incorporated, 2008","venue":null,"work_id":"d5bed303-7843-492e-92d7-37213a362e76","year":2008},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.806689Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:62278605adb0dd7956bae8217ccdd740e49ded63975d8d35afd4ec76fac7f5e9","observation_id":"5a05cab2-9666-403b-8ed4-9b2e622f45d2","resolution":{"observed_at":"2026-08-06T17:06:41.718779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:34.888506Z","title":"Algorithmic theory of qubit routing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.888506Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:a74eec09472016170b2a889f887cb6e33a9d824731463ed3b8c1604ac2a740bb","observation_id":"d50e6b13-760e-4422-8579-b503abba5818","resolution":{"observed_at":"2026-08-06T17:06:34.888506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:34.936562Z","title":"Progress in mathematical programming solvers from 2001 to 2020.EURO Journal on Computational Optimization, 10:100031,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:34.936562Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:81d6d91c6ecabf40aa7bb330821fc5bb0a959cbad938e1bb6ed67e30ba0705fa","observation_id":"ca6947ac-00ff-4f00-bb7c-0ce95313b963","resolution":{"observed_at":"2026-08-06T17:06:34.936562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-016-1031-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Dey, Thomas Kalinowski, Marco Molinaro, and Fabian Rigterink","venue":"Mathematical Programming","work_id":"0571ae60-3da1-40d6-a312-d443fcce3bda","year":2016},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.085901Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:3df04f8ff15fdcc989c4c53b1c1fb9ff7433c3cba9c877d5385d94374e42f587","observation_id":"68ec9ff2-00f4-416b-9348-3bca2b32cc67","resolution":{"observed_at":"2026-08-06T17:06:36.988526Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:35.008814Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.008814Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:95ef093bfad24bf1519be7ec17541443fdef72386b1b42ee138ba43185fb58ac","observation_id":"65d2dbaf-feb7-4a28-966a-8f9e5853e204","resolution":{"observed_at":"2026-08-06T17:06:35.008814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:41.280622Z","title":"Quantum approximate optimization of non-planar graph problems on a planar superconducting processor.Nature Physics, 17(3):332–336, 2021","venue":null,"work_id":"a701f77a-e552-4ed6-80eb-bd8b51c38d8c","year":2021},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.333996Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:d0afc3ab02acc969b9e0f0938dd69c7deb27170f8391d27fb2baa008e3c797f9","observation_id":"15dca737-b32c-4be2-ab05-8165c27c5188","resolution":{"observed_at":"2026-08-06T17:06:41.356579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:41.451484Z","title":"A new reformulation-linearization technique for bilinear programming problems","venue":null,"work_id":"1b22cc14-0b80-4d0e-9087-b0521b247ae7","year":1992},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.181422Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:b80f10f93725615c4f349b258fe1ad712995a3460eee9f600b0c82b0bccd73b3","observation_id":"2dd094fa-3342-4351-a57d-753361941a4b","resolution":{"observed_at":"2026-08-06T17:06:41.526493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08810","last_updated":"2024-06-19T01:39:44Z","snapshot_observed_at":"2026-07-06T18:14:20.889736Z","submitted_at":"2024-05-14T17:55:32Z","title":"Quantum computing with Qiskit","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08810","snapshot_observed_at":"2026-08-06T17:06:35.514574Z","title":"Wood, Jake Lishman, Julien Gacon, Simon Martiel, Paul D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.514574Z"},"links":{"cited_paper":"/paper/2405.08810","citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:25d17bedbe6865edfdafda31eea034649a70c98049ca92a008ef549b43514eac","observation_id":"bb6f720c-d58f-4a2d-ada8-a5137b8ee6a9","resolution":{"observed_at":"2026-08-06T17:06:35.514574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:41.124537Z","title":"Topological and subsystem codes on low-degree graphs with flag qubits.Physical Review X, 10(1):011022, 2020","venue":null,"work_id":"fc06f1d5-e89c-4035-bd23-b033d9339c56","year":2020},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.431376Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:c722fa0ffd8f73528a3a6e5a67fed88dcdd5067e2c555eb2c391b9d16bf82a37","observation_id":"e03ada30-671f-4a6e-889e-5a728544a7e5","resolution":{"observed_at":"2026-08-06T17:06:41.189788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-27477-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Springer Berlin Heidelberg, 2005","venue":null,"work_id":"b66196c9-7769-4561-8899-7a7cdfcd53b9","year":2005},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.694529Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:f2028d6ce3f9f0592082b6497c19703bf6485e2d5a119c1deda227423c5565ec","observation_id":"303ab02a-60bd-4825-96f6-02056f7f59a6","resolution":{"observed_at":"2026-08-06T17:06:36.810724Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:35.604308Z","title":"Z3: An efficient smt solver","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.604308Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:96e9265b8ba9ed729f615765a44a0350eade3ef6954ed2b0564bf986e1d3f2c5","observation_id":"8fc3f44c-4178-4be8-9774-2e2539a752fa","resolution":{"observed_at":"2026-08-06T17:06:35.604308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:40.675681Z","title":"Integer programming models","venue":null,"work_id":"8d37e3b8-40f7-43bd-8175-196c76ff7c36","year":2014},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.865852Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:a11f2620676079c918d27472ef6795acca793622dd66af7194b9cb2f7f9598d0","observation_id":"c082aa6b-57a3-42f4-9b7f-00f7f8e16249","resolution":{"observed_at":"2026-08-06T17:06:40.792722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:40.952196Z","title":"John Wiley & Sons, 1998","venue":null,"work_id":"77ab37f4-25dc-48a3-9227-01aafd7379ce","year":1998},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.790034Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:8c1368fe80b67d4372f34a074687a0c496a6058d4d0c2344f3132334ab790b8a","observation_id":"b8927c3b-da66-4da1-abe6-4f31f7aab8dc","resolution":{"observed_at":"2026-08-06T17:06:41.034314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:40.455747Z","title":"The bipartite implication polytope: Con- ditional relations over multiple sets of binary variables","venue":null,"work_id":"de496607-bed1-482b-a6f6-815ca5fbd739","year":2025},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:35.944424Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:f74b12d2df5843fc57d592a281203652bac02448e28759ee4479db434f2e5e86","observation_id":"4b449ddf-0991-4529-b507-968b6439ca5a","resolution":{"observed_at":"2026-08-06T17:06:40.557946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:40.207138Z","title":"if” direction holds by definition. For the “only if","venue":null,"work_id":"62784b1c-153e-41b3-8eae-528f176674ad","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:36.011235Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:86e42cc17cdd08941cc6c8eb2fe571157038a6692736aef33aaeb456d31c0347","observation_id":"3d90b0a6-5a28-42d2-9e0b-71fbe46c0702","resolution":{"observed_at":"2026-08-06T17:06:40.351944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:39.903381Z","title":null,"venue":null,"work_id":"ae472433-0c45-4244-9891-4299a506263d","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:36.082512Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:57a34146aaf80542ea7f8caf2afe3b9a600113ab4b62d269e7ceb67517ff0882","observation_id":"66737553-19b0-403d-9ee0-9bca4cf1caa7","resolution":{"observed_at":"2026-08-06T17:06:40.021340Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:39.583875Z","title":null,"venue":null,"work_id":"85dea9df-d02c-4add-b1b2-4efa64733419","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:36.150611Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:a6bf9c8a6ab14b4c1cc0c3d655fbc3e56ebdeb594afe534e418c8865d42fcdf2","observation_id":"a526a37d-6fa7-48ff-b7ae-649be38f49c2","resolution":{"observed_at":"2026-08-06T17:06:39.728113Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:39.188557Z","title":"We know thatσ maps v∗ 2 to a node in V (G′","venue":null,"work_id":"be2c4021-9871-4685-9e04-7ab6bbdb2329","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:36.248950Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:b7e84d1e25957bb879f9d37a735155d1b3a2fd34d90b739f37d15f6b7cf8089f","observation_id":"4c648394-1f0c-4fe0-8c6c-d59999e4bb88","resolution":{"observed_at":"2026-08-06T17:06:39.325835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:39.050144Z","title":"exchange","venue":null,"work_id":"8b355a0f-dffc-4a02-a444-62804f7ddb75","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:36.329141Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:7684904e01e8a6e9471a72787457295de612ab9384f283b9814237b279f16843","observation_id":"6758add2-f699-4317-86e6-2fee72ef3841","resolution":{"observed_at":"2026-08-06T17:06:39.125882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:38.867118Z","title":null,"venue":null,"work_id":"619a696f-2d15-4c53-9cc1-fae863551acb","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:36.381759Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:fc245f200d9f835eace27e00791bf13f78f8fbda43b3f2188ade6f29717ff0d6","observation_id":"22905979-52d3-401e-afdc-5f6d575efea7","resolution":{"observed_at":"2026-08-06T17:06:38.943708Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:38.720811Z","title":"Thus, (i,j )∈E(G′","venue":null,"work_id":"b2cb539e-242e-43aa-8303-472d0f920f61","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:36.476125Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:8c9ee4355be13f04503fcb584af0289d8a65600b7b0c1dca03324e86ca935f46","observation_id":"065b2b08-e59e-4257-90fc-26871763561f","resolution":{"observed_at":"2026-08-06T17:06:38.787425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:38.578628Z","title":"Restrictingσ′ to the nodes ofˆG1, we obtain thatˆG2 is isomorphic to a subgraph ofˆG1 and thus alsoG2 is isomorphic to a subgraph ofG1","venue":null,"work_id":"e917de22-0c6a-4929-b051-ea8b08e5b4a5","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:36.551293Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:b636a836e931c78f64eeebac1ac2d0f08465d59f2beaf5bb3d07960164b25268","observation_id":"2dce029f-468c-490a-b661-21ef7d2525b5","resolution":{"observed_at":"2026-08-06T17:06:38.640092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:38.406189Z","title":"B.1 Linearization 1 The goal of this subsection is to derive a linear description ofP≤ pq","venue":null,"work_id":"a3d1613f-3a68-45ae-ba33-710d450d096b","year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:36.624457Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:9c48c741d85015653b4d749c83ac4acdf365360ad77ee42c68b962b42d13ec53","observation_id":"05d55ce3-58d7-4ef0-a1f7-431aca42c7ab","resolution":{"observed_at":"2026-08-06T17:06:38.491479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:06:32.300319Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T17:06:32.300319Z"},"links":{"citing_paper":"/paper/2507.12199"},"observation_digest":"sha256:2f07becf818756b8afe66f63dc51aabe617d7e12511ba8787fddd51a7d219f7e","observation_id":"269e1d3a-b822-4bc5-9299-52fc563eaf36","resolution":{"observed_at":"2026-08-06T17:06:32.300319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.12199","last_updated":"2025-07-16T12:55:09Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T16:09:06.389130Z","submitted_at":"2025-07-16T12:55:09Z","title":"Optimized Qubit Routing for Commuting Gates via Integer Programming"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":21,"verified_exact":7,"verified_fuzzy":29},"total_outbound_references":58},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2507.12199."}