{"as_of":"2026-08-06T09:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:706cc13e7db000be9773980f0722db9bde3ba122c270b5d52e1ff030d17d5aba","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T04:26:26.161435Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2605.09237/citation-record","integrity":"/paper/2605.09237/integrity","json":"/paper/2605.09237/citation-record.json","paper":"/paper/2605.09237"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.16891","last_updated":"2025-05-23T16:32:39Z","snapshot_observed_at":"2026-07-06T21:28:38.694043Z","submitted_at":"2025-05-22T16:49:57Z","title":"Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems","version":2},"cited_work":{"arxiv_id":"2505.16891","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.16891","snapshot_observed_at":"2026-07-10T11:17:03.611418Z","title":"Quantum compiler design for qubit mapping and routing: A cross-architectural survey of superconducting, trapped-ion, and neutral atom systems","venue":"quant-ph","work_id":"37e63989-882b-47e0-9b94-e80938949d6d","year":2025},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"cited_paper":"/paper/2505.16891","citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:34deca80bd724db9c29e01abdc72b6724c340f4655afe0d2cb8a9b2a7b2108a5","observation_id":"16f56d9b-d694-4012-b104-c582b2fa1efa","resolution":{"observed_at":"2026-05-12T06:16:27.942497Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T07:34:35.591893Z","submitted_at":"2019-02-21T15:09:20Z","title":"On the qubit routing problem","version":2},"cited_work":{"arxiv_id":"1902.08091","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.08091","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the qubit routing problem","venue":"quant-ph","work_id":"6164b20b-fd37-43c1-8875-5d97b314d653","year":2019},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"cited_paper":"/paper/1902.08091","citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:71fb96aa80201e2e8392477b14ae38bcf0669aea4ec20189ce42f442cda34543","observation_id":"0aaf988f-fce9-4d45-a073-c4eb65fe3fe8","resolution":{"observed_at":"2026-05-12T06:16:27.910779Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Deterministic entanglement swapping in a superconducting circuit","venue":null,"work_id":"473902de-8d58-4b8e-b136-15321a16743f","year":2019},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:396fcefaed0384fa5d2076c4e60d638515a2a9f974c6816c8d9e6fe19a403378","observation_id":"3e36dbbc-5666-4dec-b1bc-48044dfc5a59","resolution":{"observed_at":"2026-05-12T15:06:38.604223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"How to wire a 1000- qubit trapped-ion quantum computer.PRX Quantum, 4(4):040313","venue":null,"work_id":"b3183ff6-29be-4ad5-9aba-67a68f0c0f59","year":2023},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:e0cc19d3f16f0d4c3f930fee27a3faa46d4b96daf6c70b90558c1cf374902698","observation_id":"aacc330d-0d72-4aa0-9c58-1b2f6ab4450d","resolution":{"observed_at":"2026-05-12T15:06:38.624037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Demonstration of the trapped-ion quantum ccd computer architecture.Nature, 592(7853):209–213","venue":null,"work_id":"65090971-9455-4886-948c-aca00392afd5","year":2021},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:84b6eefabbe92798433dd61029baa6efba9bd8f0661c2aab2e138a64563afffa","observation_id":"ca167c1c-2d41-4842-81c7-50a6903ca3fd","resolution":{"observed_at":"2026-05-12T15:06:38.663427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Towards early fault tolerance on a 2×n array of qubits equipped with shuttling.PRX Quantum, 5(4):040328","venue":null,"work_id":"1681d41e-d629-4195-8df4-78efe91cbdb6","year":2024},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:a624e7980de0c2c2ca494ac27be8824bd7b0d637055586b4567b3d6f712445d2","observation_id":"460dc1d8-1ff0-4f43-84c8-65c137b144ab","resolution":{"observed_at":"2026-05-12T15:06:38.612147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"High-fidelity single-spin shuttling in silicon.Nature Nanotechnology, 20(7):866–872","venue":null,"work_id":"4487a907-6a0c-417b-afc6-dccd49ae9a35","year":2025},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:46ef443d8aa669ead7308356e527aa73f4b947f433bc4cb88aa653b751525428","observation_id":"9b66cd7a-9fd4-4d2e-810e-69d37ec4f3ce","resolution":{"observed_at":"2026-05-12T15:06:38.649699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12470","last_updated":"2026-05-18T15:23:30Z","snapshot_observed_at":"2026-07-22T23:18:54.179265Z","submitted_at":"2025-01-21T19:39:03Z","title":"Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction","version":3},"cited_work":{"arxiv_id":"2501.12470","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.12470","snapshot_observed_at":"2026-07-03T12:48:11.067336Z","title":"Efficient compilation for shuttling trapped-ion machines via the position graph architectural abstraction","venue":"quant-ph","work_id":"c2f43046-8f10-4ba1-aa12-b658d51577a8","year":2025},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"cited_paper":"/paper/2501.12470","citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:83d68db9fa3b52ab3de0a03e21eb9c7ec476db03755ec4af3fec73cc1f8245b6","observation_id":"d0af0234-7d2f-452d-bd7d-712b97296a2a","resolution":{"observed_at":"2026-05-20T00:05:26.767071Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Tackling the qubit mapping problem for nisq-era quantum devices","venue":null,"work_id":"197e3ab3-f580-4225-9955-b12e66e0902c","year":2019},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:fdbbec67a9eff826190ba8d1f9d9b1758d28455af8055d4d594f41fa322109bf","observation_id":"ca225ea2-785d-476e-84d3-076cf8b7bc0b","resolution":{"observed_at":"2026-05-12T15:06:38.628180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Berkeley quantum synthesis toolkit (bqskit) v1","venue":null,"work_id":"038afca8-e39b-44e6-8550-702da909a1fe","year":2021},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:fed21c1b290497b16b218b882edb2b5ec3ca3dac85d439f43f2ab69f48f88ffc","observation_id":"6ba4ffb4-3b6e-4b96-93fb-c1af0a4b50b8","resolution":{"observed_at":"2026-05-12T15:06:38.656572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Charge-insensitive qubit design derived from the cooper pair box.Physical Review A—Atomic, Molecular, and Optical Physics, 76(4):042319","venue":null,"work_id":"05264de1-b2cc-41c2-8470-65dfaceadb4d","year":2007},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:3271e1fcde47432cb5307907a22d0762053868d0962cfe1c88bf194c5940bcab","observation_id":"ea7c92a4-ea10-4b92-be1d-5bf4801526b4","resolution":{"observed_at":"2026-05-12T15:06:38.640474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Architecture for a large-scale ion-trap quantum computer.Nature, 417(6890):709–711","venue":null,"work_id":"d641a84c-d58b-421c-a21b-054ff6fea189","year":2002},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:b3ed59666f3ae7c5ed1f3c57094ce36b3f181fed4bc89785406790fc030920f3","observation_id":"68b02347-e432-45e3-b938-27fec5070eb9","resolution":{"observed_at":"2026-05-12T15:06:38.694471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Quantum circuit optimization and transpi- lation via parameterized circuit instantiation","venue":null,"work_id":"7b41bc14-181d-475f-ad40-2232cff3581f","year":2022},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:36e3200f0e01abe631ac59c0836e6b43eead5d77bd799020196cdc3fa597d3cf","observation_id":"fd268c09-a652-416c-a5dc-efdf7c42a0d6","resolution":{"observed_at":"2026-05-12T15:06:38.675621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Advantages and limitations of quantum routing.PRX quantum, 4(1):010313","venue":null,"work_id":"7a3e2a38-80e6-4863-aac7-8ae51156ab60","year":2023},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:249d0b5b47fc6b211868ee5c0a5144171693bc965816d340262493543c96ed1d","observation_id":"66199392-7e24-4aff-94b1-815f57cc26a1","resolution":{"observed_at":"2026-05-12T15:06:38.667108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Muqut: Multi-constraint quantum circuit mapping on nisq computers","venue":null,"work_id":"0f362833-1fa2-4203-9dd2-ec1125eabe36","year":2019},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:3b9f5666722c4fee8b93c9425baa1ead4d91baf58f268d0f2e5153c31639f01c","observation_id":"6c3a1a9d-a060-4e52-b0fc-fc5893c6c1b4","resolution":{"observed_at":"2026-05-12T15:06:38.596733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Tackling the qubit mapping problem with permutation- aware synthesis","venue":null,"work_id":"664cfaa1-b28f-4953-b886-26b53a027ae4","year":2023},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:b3fdab3961fa771f9c7445208cc4945340d44f4371c2aa9c157195be07e85379","observation_id":"48feeb6d-edd6-4ada-b37b-6f9a06f7e2c5","resolution":{"observed_at":"2026-05-12T15:06:38.608322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.08368","last_updated":"2024-09-12T19:19:59Z","snapshot_observed_at":"2026-08-06T05:06:11.636246Z","submitted_at":"2024-09-12T19:19:59Z","title":"LightSABRE: A Lightweight and Enhanced SABRE Algorithm","version":1},"cited_work":{"arxiv_id":"2409.08368","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.08368","snapshot_observed_at":"2026-07-04T04:59:35.625323Z","title":"Lightsabre: A lightweight and enhanced sabre algorithm","venue":null,"work_id":"457270ac-d10c-4246-8a1b-65611a3a12ee","year":2024},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"cited_paper":"/paper/2409.08368","citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:b1138db30b1bc67822c29d2bd830aa5ba18080e46ede14b556ee96198c34100b","observation_id":"c133882d-7f48-4e0d-ba57-bef4d42adcfb","resolution":{"observed_at":"2026-05-12T06:16:27.968047Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2407.00736","doi":"10.48550/arxiv.2407.00736","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects","venue":"arXiv (Cornell University)","work_id":"958a73ce-d60e-493b-857d-54124cf3c628","year":2024},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:3a0b03023af6914c75d4c34681288ff23d775f67bd342253f4ed9ec59af9a869","observation_id":"a69d3021-7cf1-4090-bcc3-1c84d0a8ad33","resolution":{"observed_at":"2026-05-12T06:16:27.922075Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Architecting noisy intermediate-scale trapped ion quantum computers","venue":null,"work_id":"0719b25b-f0c0-4a88-85a7-1c214703072b","year":2020},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:e539c65313a9d3b495cfc95fd61f82e1ce6ea01998700be6aaa1ab481968bf1f","observation_id":"1c99e8c6-2f19-46eb-b4f6-46a1517fc186","resolution":{"observed_at":"2026-05-12T15:06:38.636522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Muzzle the shuttle: Efficient compilation for multi-trap trapped-ion quantum computers","venue":null,"work_id":"f22ccaee-1f78-422c-b4e5-96d7f972356f","year":2022},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:6797cd6b9c32db33fe2453d8443cd2d8d310c973d173c518e8f6e5ab35623db0","observation_id":"d111413f-f5e4-4cd3-bd4f-83cfd434e990","resolution":{"observed_at":"2026-05-12T15:06:38.600093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"S-sync: Shuttle and swap co-optimization in quantum charge-coupled devices","venue":null,"work_id":"43e8aaaf-e0e6-44b8-9c97-7720b9ab7977","year":2025},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:0ba3e4b1bff021bb96d0f1a088d8421fe776f7f5a17363ba864df6eb6ac098b8","observation_id":"60a46ebd-e68b-486a-a4dc-e86014cf1ca6","resolution":{"observed_at":"2026-05-12T15:06:38.615535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17886","last_updated":"2025-04-28T16:45:54Z","snapshot_observed_at":"2026-07-06T21:14:28.688897Z","submitted_at":"2025-04-24T18:49:51Z","title":"TrapSIMD: SIMD-Aware Compiler Optimization for 2D Trapped-Ion Quantum Machines","version":2},"cited_work":{"arxiv_id":"2504.17886","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17886","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trapsimd: Simd-aware compiler optimization for 2d trapped-ion quantum machines","venue":null,"work_id":"bab6b8e3-ab3c-48bb-bb84-d6dd4215a5ad","year":2025},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"cited_paper":"/paper/2504.17886","citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:0382cfefa92ec8759f31f58462fa250303c0990abb20d222841e925c550642ed","observation_id":"2af6ae54-0d60-4706-b953-a143de8355ad","resolution":{"observed_at":"2026-05-12T06:16:27.954474Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Qubit allocation as a combination of subgraph isomorphism and token swapping.Proceedings of the ACM on Programming Languages, 3(OOPSLA):1–29","venue":null,"work_id":"a79a693a-f7b0-488c-aaad-898c38c99c58","year":2019},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:35bff2df2490c3a8432a016a6e792af4d60928fa812c48342991f16f63e159f7","observation_id":"777ac7ed-f233-4729-aa99-e9e35515f87a","resolution":{"observed_at":"2026-05-12T15:06:38.685517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"An exact qubit alloca- tion approach for nisq architectures.Quantum Information Processing, 19(11):391","venue":null,"work_id":"38a714ca-5e13-49be-b37a-8db6065770af","year":2020},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:4d0a867421576527fa09970d690bddcb2a7a534ecf037267d550bfaf2b1b9f47","observation_id":"d229d897-882d-4618-906d-f12c7f49f01f","resolution":{"observed_at":"2026-05-12T15:06:38.678605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Optimal layout synthesis for quantum computing","venue":null,"work_id":"8e85d121-1576-44e0-b0cf-328fbf8871c2","year":2020},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:51cb756f4c64777b2294f2f5f7a7243ac737e89fa1af6df3d126c56bce314fbb","observation_id":"9250d4b9-c6c3-4798-844b-c5961b9c652f","resolution":{"observed_at":"2026-05-12T15:06:38.660290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Optimal qubit assignment and routing via integer programming.ACM Transactions on Quantum Computing, 4(1):1–31","venue":null,"work_id":"3bb98f07-687b-4c0a-a8e2-7fea46c199e4","year":2022},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:429d38f59121b24e55a177934a16afa0a97c5e8eb2539303cf4514912405c919","observation_id":"be396bb6-812d-4734-b847-56b08e977fcc","resolution":{"observed_at":"2026-05-12T15:06:38.682194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Satis- fiability modulo theories-based qubit mapping for trapped-ion quantum computing systems","venue":null,"work_id":"6715cf70-5f85-481d-9d16-ead4fa5eba59","year":2024},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:ad4ac80c186df82c8dbe882673c9c342c9c2e377b2aa7de4bf5e4a970fb022dd","observation_id":"4a52c0a3-b54c-488e-b7ca-2625cfa34425","resolution":{"observed_at":"2026-05-12T15:06:38.670174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Using boolean satisfiability for exact shuttling in trapped-ion quantum computers","venue":null,"work_id":"781f5a66-d35c-4f95-9840-2a7213dfa0a0","year":2024},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:ea87999241bb4791f7d0053a546363b73e8bee56e79355c0e8b6dea9ec77945b","observation_id":"9f10b9ed-aba4-4480-acd5-f8bcc92b4847","resolution":{"observed_at":"2026-05-12T15:06:38.688309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Time-optimal qubit mapping","venue":null,"work_id":"3be71865-7bb9-42f1-abd8-03143d0065a2","year":2021},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:69e5bbdd37c1e2d0e06ed1fbec0cea9e4346b7f91865913153d36ca85e311266","observation_id":"fd50588f-e8f0-4571-97a4-1768b697a12d","resolution":{"observed_at":"2026-05-12T15:06:38.632372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1411.4028","doi":"10.48550/arxiv.1411.4028","metadata_source":"pith","pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"5a33d9f3-407a-4c7e-a119-ff581c66b173","year":2014},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:0c458551f99516fd177a51a5e19a85784980fba79db3deb64c7848a1ca8c60dc","observation_id":"2969655a-727a-4d09-93b7-9bc9c74e484a","resolution":{"observed_at":"2026-05-12T06:16:27.929830Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Cambridge university press Cambridge","venue":null,"work_id":"9d266816-becc-4cb3-af10-5714d7a73aa6","year":2001},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:f7b1344e6d2f8e986ceef2052b8aa185b0b299099b5ce587b23e5f6b04a76803","observation_id":"82bb18fe-a400-471b-8c2e-9f436ed37423","resolution":{"observed_at":"2026-05-12T15:06:38.672865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors","venue":null,"work_id":"1402d841-7304-44a9-9059-78876d6d50da","year":1999},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:3eec638b88c74e543db121a71edc989d5293c6dffd5af9054cab30dfd4aa18d1","observation_id":"5df27efd-3a72-4146-bd89-285d6286d1f1","resolution":{"observed_at":"2026-05-12T15:06:38.645182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.SIAM review, 41(2):303– 332","venue":null,"work_id":"6884138a-efa2-468c-a09c-f61dd7fd0dea","year":1999},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:e1121b09e00d446990fda7121bd3e83cbda81b615a227f7e3c42e9168d465454","observation_id":"1b50b91b-3be5-486c-86dd-3fb1a28fbedb","resolution":{"observed_at":"2026-05-12T15:06:38.619536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Wood, Jake Lishman, Julien Gacon, Simon Martiel, Paul D","venue":null,"work_id":"9d95dd05-1467-4dcd-9ccc-6dddfe0c89cb","year":2024},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:14e9a86004188335dcaed97977922f122d33d63327eb7c55dcf0a78002dff3cd","observation_id":"77524c00-50e7-451b-a4ae-28bc7aba6bde","resolution":{"observed_at":"2026-05-12T15:06:38.653059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Algebraic compression of quantum circuits for hamiltonian evolution","venue":null,"work_id":"7b93dee1-b80c-4280-9206-31e693821589","year":2022},"citing_paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:26.161435Z"},"links":{"citing_paper":"/paper/2605.09237"},"observation_digest":"sha256:f5437ce8fa2ef8842695f68e64b58b0d7d4f734252be92c0ce305e29a5e5bde7","observation_id":"90b1f83e-a141-4ae7-a564-cd9df933d869","resolution":{"observed_at":"2026-05-12T15:06:38.691253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.09237","last_updated":"2026-05-10T00:35:23Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T23:21:21.560069Z","submitted_at":"2026-05-10T00:35:23Z","title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":7,"verified_fuzzy":28},"total_outbound_references":35},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2605.09237."}