{"as_of":"2026-08-08T21:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3128728e3e6208e0c2db35c7f73c211d38a97e02bb937a4943e0353f8b1f27a1","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:12:48.552099Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2508.21718/citation-record","integrity":"/paper/2508.21718/integrity","json":"/paper/2508.21718/citation-record.json","paper":"/paper/2508.21718"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:12:54.373556Z","title":"Complexity-theoretic foundations of quantum supremacy experiments","venue":null,"work_id":"48a56378-14f9-422b-b565-9eabd9b41d09","year":2017},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:46.203717Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:aa933f9c87f2fc42f0a96286ae0422f05b773c152cf847e0ad389485cbd606cb","observation_id":"6f1dd9c9-87a1-445f-9480-b79304f6849f","resolution":{"observed_at":"2026-08-05T14:12:54.507626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.08540","last_updated":"2017-03-24T02:19:45Z","snapshot_observed_at":"2026-07-06T05:35:07.974673Z","submitted_at":"2017-03-24T02:19:45Z","title":"Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies","version":1},"cited_work":{"arxiv_id":"1703.08540","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.08540","snapshot_observed_at":"2026-08-05T14:12:48.792288Z","title":"Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies","venue":"cs.ET","work_id":"723a422c-aa5f-4cb9-bdea-ee150b0fa245","year":2017},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:46.281279Z"},"links":{"cited_paper":"/paper/1703.08540","citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:7c06a5b975bf928be7af42de84d98851b8cfc625638f0d02c1320087f6a61b60","observation_id":"94a13fe6-db05-48af-b51e-92a02eae5b70","resolution":{"observed_at":"2026-08-05T14:12:48.867538Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:54.154955Z","title":"On the complexity of quantum cir- cuit compilation","venue":null,"work_id":"c2c3cf75-ad0b-46f8-ad12-b799c9622665","year":2018},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:46.348681Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:1e94acdc953330f21a6e4abd64440632241637bb57840e3f881277c8dd846bc1","observation_id":"9b0fc827-d940-4eb6-b4b8-9dc1c1e4887e","resolution":{"observed_at":"2026-08-05T14:12:54.230528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:53.884731Z","title":"Quantum compilation process: A survey","venue":null,"work_id":"82c6230e-b9b8-4ed2-b46d-2603905dae66","year":2024},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:46.448222Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:0a86457634f254b76db9f6296274fb7177365809f16ff1d8ece7e9f060ef02d3","observation_id":"13d73fab-68fb-44ad-96f6-8adfdad6837b","resolution":{"observed_at":"2026-08-05T14:12:54.035614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:53.674629Z","title":"Bench- marking a trapped-ion quantum computer with 30 qubits","venue":null,"work_id":"3613072d-e489-41ab-97c3-fa23d933fc51","year":2024},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:46.532281Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:b27f5f19cb5c8eb72287c7745767fb6ecd3e3d895a16d13960ea217f76e96461","observation_id":"4b8c5a08-e32c-4249-b75d-572458faabfd","resolution":{"observed_at":"2026-08-05T14:12:53.787315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:53.463408Z","title":"Characterizing randomness in parameterized quantum circuits through express- ibility and average entanglement","venue":null,"work_id":"63c19b09-6513-490f-a20e-ef499b974986","year":2024},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:46.612042Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:490b7d9b3f4632aa51f8c184a7569e6c32e50e8c8294133b79ac875c846c0030","observation_id":"f8245dcc-dd78-428d-b727-bfd3a0748170","resolution":{"observed_at":"2026-08-05T14:12:53.575956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:53.216489Z","title":"Cross, Lev S","venue":null,"work_id":"24d92994-3412-48a7-997d-b6cd0dafd13d","year":2019},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:46.720782Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:12cb366388491e0e555c1d465a1d5edf1c9cb821a286dc8258cbbf9c0d9ea9b3","observation_id":"e8846aac-1f0d-4a46-83c4-b1ca92a5894a","resolution":{"observed_at":"2026-08-05T14:12:53.331811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:52.892281Z","title":"Generalized best-first search strategies and the optimality of A*","venue":null,"work_id":"3a42a36d-94fb-4328-9b4a-b08e51478b8c","year":1985},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:46.893455Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:3f73cecad68027e5e6575277bb78efbda18af117b27a4bd42801c36126a497f3","observation_id":"bf6596d3-be7f-43b4-9a3e-052c6676ff71","resolution":{"observed_at":"2026-08-05T14:12:53.064964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:47.024799Z","title":"Quantum circuit synthesis and compilation optimization: Overview and prospects","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:47.024799Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:2bea48831c0e1b91afdbc09f17a7b78b04f041dda9e73661193b3ade64824ec9","observation_id":"8bb007a5-1a46-4e66-a9a3-d04ae682d694","resolution":{"observed_at":"2026-08-05T14:12:47.024799Z","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-05T14:12:52.558465Z","title":"Creating entangled logical qubits in the heavy-hex lattice with topological codes","venue":null,"work_id":"fbef63da-c813-4f9c-add6-1333219f3702","year":2024},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:47.177295Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:842bbe9412a6d7798297d624a96a36b35a218192e96e516a2a1c1b35b78915a7","observation_id":"73aa28fa-a244-4f90-a1b8-622062b0df45","resolution":{"observed_at":"2026-08-05T14:12:52.721021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:52.268717Z","title":"Tackling the qubit mapping problem for nisq-era quantum devices","venue":null,"work_id":"2f1aa359-6a38-4ebc-95a8-31c5d3165cdf","year":2019},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:47.328424Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:34cfb6a7e6359fb0794b1955757156e04e06d8d6f69c606f64414e8e585d5417","observation_id":"bef8ca9b-a3d4-4760-91ce-edb883afaca3","resolution":{"observed_at":"2026-08-05T14:12:52.396670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:51.919561Z","title":"Quantum compiling","venue":null,"work_id":"eab625eb-336d-49c6-8d30-52b5634a44f7","year":2022},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:47.466503Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:3a5252f9a96b73f6866f8460a7fc5f9b4b16138ad8f908ac5b0b5ed64ccda172","observation_id":"92e6c1ce-b745-4684-adcc-68b73331a973","resolution":{"observed_at":"2026-08-05T14:12:52.063086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:51.611271Z","title":"A polynomial size model with implicit swap gate counting for exact qubit reordering","venue":null,"work_id":"4a49052a-b5b3-4a5f-92a2-22481977c3c2","year":2023},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:47.603177Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:f49c3b31df7b729c56296e50b3714c898dc8075d9beffe065491002ac7029e10","observation_id":"89d6bad3-3f0f-4f8a-8431-44cb61e4b3a7","resolution":{"observed_at":"2026-08-05T14:12:51.723102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:50.717362Z","title":"Optimal qubit as- signment and routing via integer programming","venue":null,"work_id":"8ae22254-53d3-4a77-8fd1-dce41b7ece9c","year":2022},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:47.680615Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:09338e503f53497286efac4141fecf7fd5ea81b017928912019a5d0a1ce6e990","observation_id":"cf120d46-3508-414b-a453-306e4a5a7407","resolution":{"observed_at":"2026-08-05T14:12:51.229253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:50.417727Z","title":"Nielsen and Isaac L","venue":null,"work_id":"a3f93689-e910-42ed-ba01-535b7903b5a7","year":2010},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:47.790479Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:72d4632a8730e6dbf5d6625bdb284cca67e09f1c1adf215b8d6de20257f5f2ac","observation_id":"707646a4-4663-4fab-b7fe-17c110d5c598","resolution":{"observed_at":"2026-08-05T14:12:50.566369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:50.150876Z","title":"Qubit allocation","venue":null,"work_id":"c8297bd0-81c3-45d1-9ae2-944ccedceb1f","year":2018},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:47.908981Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:e58eb98e7f6d7d84c4f83ad39b88847a641d6a9b9437b3ddc12fc91f849b4d18","observation_id":"c4722d56-2f0e-463f-ad1a-3325a7036284","resolution":{"observed_at":"2026-08-05T14:12:50.275274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:49.880229Z","title":"Improving quantum computation by optimized qubit routing","venue":null,"work_id":"d1364b38-65a5-488c-8453-8fb5bec0fa70","year":2023},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:48.031955Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:694f3d33955453e11e09d5f8fd02f38de60ce9780e64b9f68c2aa24554c7bf17","observation_id":"7fb49871-3d69-455a-95cc-10ab2055cb71","resolution":{"observed_at":"2026-08-05T14:12:49.977301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:49.650635Z","title":"Mapping quantum circuits to ibm qx architectures using the minimal number of swap and h operations","venue":null,"work_id":"9ddbf3f4-c243-4cf7-86a8-fc7c73d3ee3a","year":2019},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:48.142548Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:6b48a4ae2184a457157bef83c9abb2dc5f4443596d116f596602659da815c461","observation_id":"baafebd1-73ce-42a3-b3cc-5e0cd63c19a3","resolution":{"observed_at":"2026-08-05T14:12:49.772468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:49.382144Z","title":"Time- optimal qubit mapping","venue":null,"work_id":"3ad1e237-e42f-4694-8ebf-0b4328317b41","year":2021},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:48.246171Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:8bf965bcf651845f8702c74622470284cb5b064dbf4592708461af9901149cf1","observation_id":"4c5293b5-b811-4a4c-819e-eeca81fd8690","resolution":{"observed_at":"2026-08-05T14:12:49.481328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:49.209899Z","title":"An exact qubit allocation approach for nisq architectures","venue":null,"work_id":"9f88dd42-143e-4991-aad7-2c5c53a6c3d4","year":2020},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:48.397231Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:f91fa4cd39889d7ef4836f25768f44d939da5ff785fc6d241003c93f4b1595c5","observation_id":"9f8a5ece-8057-4e0d-9349-2d81d446f13d","resolution":{"observed_at":"2026-08-05T14:12:49.281104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:12:48.948971Z","title":"Compiling su (4) quantum circuits to ibm qx architectures","venue":null,"work_id":"93a90b94-3c52-4679-9da0-2927241fb909","year":2019},"citing_paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T14:12:48.552099Z"},"links":{"citing_paper":"/paper/2508.21718"},"observation_digest":"sha256:cd6d875f7fde12ec3b9673bc5716dab85d90c6014c3c108939c15df51a314bcd","observation_id":"eaf2597f-3023-43d7-9701-27c319324fa9","resolution":{"observed_at":"2026-08-05T14:12:49.071416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.21718","last_updated":"2025-08-29T15:35:16Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-05T14:12:42.732240Z","submitted_at":"2025-08-29T15:35:16Z","title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":19},"total_outbound_references":21},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2508.21718."}