{"as_of":"2026-08-17T21:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b15215987b13fc9363300928046e31617419f86caa76dd46e3965b24fb8a1bfa","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:33:49.591121Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/1908.08853/citation-record","integrity":"/paper/1908.08853/integrity","json":"/paper/1908.08853/citation-record.json","paper":"/paper/1908.08853"},"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-14T11:33:50.087617Z","title":"Qiskit: An open-source framework for quantum computing","venue":null,"work_id":"bfed8a90-2e0e-4f2d-af8f-9cb6d93b0faa","year":2019},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.479980Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:0375f8e5d25ace6330d03cb2ae3b90ff06f2bdb806d927c87f446bc88b6f33ba","observation_id":"3c01047a-1fb4-4c3b-b74d-89b9e6617f52","resolution":{"observed_at":"2026-08-14T11:33:50.091798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:50.073922Z","title":"Routing permutations on graphs via matchings.SIAM journal on discrete mathematics, 7(3):513–530, 1994","venue":null,"work_id":"855822bd-ec8e-4142-8c35-797de7fd4999","year":1994},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.488655Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:d1870850b2e5f4321c32b6249e8ba5d17bea7650342573952e180db3064b9127","observation_id":"5ac3b4eb-3d84-45da-b33d-ac6c6c47cdc8","resolution":{"observed_at":"2026-08-14T11:33:50.078604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:50.060387Z","title":"Elementary gates for quantum computation","venue":null,"work_id":"6abc296e-9ea7-4f2c-9a32-b62f9828012a","year":1995},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.493276Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:9908e248c3ccc93b35221bddb2c969bcf7712abc8028410e1e7c1d0bad3d30ef","observation_id":"71a48cfa-9cc1-4b8c-a50d-9cf8edbcb2f4","resolution":{"observed_at":"2026-08-14T11:33:50.064404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:50.046602Z","title":"Com- paring and integrating constraint programming and temporal planning for quantum circuit compilation","venue":null,"work_id":"dd019705-ab59-4087-999a-a70debe2af50","year":2018},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.498137Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:84499465e336681302fb7439c571a872d902f5936967bd3f551172a1d93dd061","observation_id":"f203ab8c-8809-4b88-be17-fb8f2d650e78","resolution":{"observed_at":"2026-08-14T11:33:50.051096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:50.032715Z","title":"On the complexity of quantum circuit compilation","venue":null,"work_id":"caacc872-b0a9-4374-aaa4-b7da93b9f37d","year":2018},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.504559Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:13ce08746e306f4dc6b222e97434f422198144f3ddee04e720ee515b31931bc3","observation_id":"416f3786-9c9e-4ba6-b5d4-0f021af1d746","resolution":{"observed_at":"2026-08-14T11:33:50.037165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09102","last_updated":"2019-09-06T21:54:51Z","snapshot_observed_at":"2026-08-14T17:11:58.363854Z","submitted_at":"2019-02-25T06:15:31Z","title":"Circuit Transformations for Quantum Architectures","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09102","snapshot_observed_at":"2026-08-14T11:33:49.509239Z","title":"Circuit transformations for quantum architectures","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.509239Z"},"links":{"cited_paper":"/paper/1902.09102","citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:fa1149c2d8c697b203406850e6dbf03453575e1eb07eb48b00a5833c466bda1f","observation_id":"0a1bf154-1550-441b-85ca-bb1c03720166","resolution":{"observed_at":"2026-08-14T11:33:49.509239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.08091","last_updated":"2019-02-28T19:06:27Z","snapshot_observed_at":"2026-08-14T17:13:09.235772Z","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-14T11:33:49.514515Z","title":"On the qubit routing problem.arXiv preprint arXiv:1902.08091, 2019","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.514515Z"},"links":{"cited_paper":"/paper/1902.08091","citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:369764e324b06aea69bca1d9348bce4120f22c626fb943dec76316a1ebca9f76","observation_id":"435c7da3-ace7-4447-a549-49200023a6a7","resolution":{"observed_at":"2026-08-14T11:33:49.514515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.08291","last_updated":"2018-10-18T22:21:01Z","snapshot_observed_at":"2026-08-14T18:12:25.053581Z","submitted_at":"2018-10-18T22:21:01Z","title":"Qubit Allocation for Noisy Intermediate-Scale Quantum Computers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.08291","snapshot_observed_at":"2026-08-14T11:33:49.519128Z","title":"Qubit allocation for noisy intermediate-scale quantum computers.arXiv preprint arXiv:1810.08291, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.519128Z"},"links":{"cited_paper":"/paper/1810.08291","citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:fff1ee4fda56c7cd5efe68e6fd2d511708a3c973728e4883ab9abd328919b6d0","observation_id":"eb911f70-b2a3-4132-b2ab-bc687e3bbc98","resolution":{"observed_at":"2026-08-14T11:33:49.519128Z","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-14T11:33:49.895082Z","title":"A software methodology for compiling quantum programs.Quantum Science and Technology, 3(2):020501, 2018","venue":null,"work_id":"76d70629-6c25-4cc6-9fa6-b7062f68af2b","year":2018},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.523620Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:0492b6bf5772f65948b93d09a3d1c4e22935da229681bb137c86f65288d65a9b","observation_id":"4416ec12-6599-444c-8fb6-eb6fc1dad79e","resolution":{"observed_at":"2026-08-14T11:33:50.016949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:49.880015Z","title":"Quantum circuit compilers using gate commutation rules","venue":null,"work_id":"34f0d72f-a6d0-4140-8878-6f2dca0617b3","year":2019},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.527933Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:bc28051f67a04a28664c3ccfd8fc9da4bcb9cce4aa24b81fac3e4b7b13dfeb87","observation_id":"019c383a-5864-40e6-970d-86d60861641a","resolution":{"observed_at":"2026-08-14T11:33:49.885192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:49.864321Z","title":"Optimization by simulated annealing.science, 220(4598):671–680, 1983","venue":null,"work_id":"a1adb2c6-4aeb-4517-b383-1a9642312799","year":1983},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.532154Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:ef564d1d8288f37d6e7026b967076127712d429d687958f7c0cd4943ea0dd2ec","observation_id":"153aa9c0-796b-408c-a346-90e726188e27","resolution":{"observed_at":"2026-08-14T11:33:49.869193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.00633","last_updated":"2019-05-26T20:00:01Z","snapshot_observed_at":"2026-08-14T16:53:50.765911Z","submitted_at":"2019-04-01T08:26:00Z","title":"CNOT circuit extraction for topologically-constrained quantum memories","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.00633","snapshot_observed_at":"2026-08-14T11:33:49.536246Z","title":"Cnot circuit extraction for topologically-constrained quantum memories","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.536246Z"},"links":{"cited_paper":"/paper/1904.00633","citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:a647e488b9c8c54ff40b1425c10fa3cbe3f405656068677b31885601d0b4e8a1","observation_id":"e896aad8-cbd4-42bd-bab4-7736c03bc5b5","resolution":{"observed_at":"2026-08-14T11:33:49.536246Z","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-14T11:33:49.848909Z","title":"Tackling the qubit mapping problem for nisq-era quantum devices","venue":null,"work_id":"3970606b-641d-49db-b54a-3943a4b6a795","year":2019},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.541144Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:0bde074f787aa0e0cea6ff27a1750109b3a97a6d9f32ad4fddc1b23ae3babacd","observation_id":"46dcbf47-88b1-4bb2-bef6-18cfba5d8b74","resolution":{"observed_at":"2026-08-14T11:33:49.854281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.05150","last_updated":"2016-08-02T16:53:30Z","snapshot_observed_at":"2026-08-14T22:10:05.498251Z","submitted_at":"2016-02-16T19:44:30Z","title":"Approximation and Hardness for Token Swapping","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.05150","snapshot_observed_at":"2026-08-14T11:33:49.545070Z","title":"Approximation and hardness for token swapping.arXiv preprint arXiv:1602.05150, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.545070Z"},"links":{"cited_paper":"/paper/1602.05150","citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:9115827bce75765ff014c3260acd00486c718c2c0d357558e9cbedd42ddf66f8","observation_id":"35ef233d-b566-47e2-806f-007349edf1ba","resolution":{"observed_at":"2026-08-14T11:33:49.545070Z","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-14T11:33:49.832905Z","title":"Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers","venue":null,"work_id":"1ca2b9d2-cbe7-455b-a7d8-b52740deb861","year":2019},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.549287Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:d3a4e0407caa0407858a94ba37cd05503685860d39917d6d09edadbbfd715b9b","observation_id":"748a4f70-0d2a-42cb-b77e-a802a0797c03","resolution":{"observed_at":"2026-08-14T11:33:49.838692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01972","last_updated":"2020-04-24T18:01:32Z","snapshot_observed_at":"2026-08-14T16:52:23.248546Z","submitted_at":"2019-04-03T12:35:09Z","title":"Quantum circuit optimizations for NISQ architectures","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01972","snapshot_observed_at":"2026-08-14T11:33:49.553273Z","title":"Quantum circuit optimizations for nisq architectures","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.553273Z"},"links":{"cited_paper":"/paper/1904.01972","citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:37a0a9141547c582f8ae2e3380a98d28545920e941351e7248adce133e43cdfa","observation_id":"6a648737-3f4a-40de-a1d6-797260a0fc6d","resolution":{"observed_at":"2026-08-14T11:33:49.553273Z","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-14T11:33:49.818104Z","title":"Quantum information and quantum computation.Cambridge: Cambridge University Press, 2(8):23, 2000","venue":null,"work_id":"2fdd437d-e44c-4997-af2d-297bea36d868","year":2000},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.557574Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:24c071d85d916099fa84cb285f782d51ad47ce1938c865fcd111eb15da587320","observation_id":"107a081a-f389-44a9-865d-10c86325368f","resolution":{"observed_at":"2026-08-14T11:33:49.823278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.10963","last_updated":"2019-03-26T15:43:36Z","snapshot_observed_at":"2026-08-14T16:56:32.222535Z","submitted_at":"2019-03-26T15:43:36Z","title":"Extracting Success from IBM's 20-Qubit Machines Using Error-Aware Compilation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.10963","snapshot_observed_at":"2026-08-14T11:33:49.561727Z","title":"Extracting success from ibm’s 20-qubit machines using error-aware compilation.arXiv preprint arXiv:1903.10963, 2019","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.561727Z"},"links":{"cited_paper":"/paper/1903.10963","citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:15fd6405be020339c35411786c040165afc5738e8f3029599716fd89d36221ed","observation_id":"4217a122-6db8-4b27-b28e-4d296d694c49","resolution":{"observed_at":"2026-08-14T11:33:49.561727Z","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-14T11:33:49.802959Z","title":"On the influence of initial qubit placement during nisq circuit compilation","venue":null,"work_id":"dc754123-0ea7-4440-9c5d-2d31a0ff45b2","year":2019},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.565681Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:28c62b54eca2dc4127212bbcd1556b6a79b91ed1bc25e54962a0374eac1f137a","observation_id":"130e2b7e-82c9-4a2b-ae19-641e6356c965","resolution":{"observed_at":"2026-08-14T11:33:49.808250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:49.570221Z","title":"Quantum computing in the nisq era and beyond.Quantum, 2:79, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.570221Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:2c503dafe2eb3da6001a39aea1507229590495161e062d33aa8af30fc2cdbd38","observation_id":"5ceaf99f-314e-478c-8a1d-dc37409c453a","resolution":{"observed_at":"2026-08-14T11:33:49.570221Z","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-14T11:33:49.777662Z","title":"Qubit allocation","venue":null,"work_id":"d1383c99-8a97-40ce-91f4-76f9a6c98e3e","year":2018},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.574071Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:bac8da16fcf532f68612834fef9b9f5cce1c82164cf340645541d7382dedc63d","observation_id":"03851002-e47d-474c-aeee-b756ffdb53fa","resolution":{"observed_at":"2026-08-14T11:33:49.782562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:49.763539Z","title":"John Wiley & Sons, 2014","venue":null,"work_id":"a0bd6715-b0c1-4296-82ec-4b37bcb3d93f","year":2014},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.578117Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:cb82e9c65a3e25c4ce043dccb6d7ce83a3ce6a6b626ce3134aaea9b2176432d5","observation_id":"84f7086d-b99f-4638-ac21-1e01237824de","resolution":{"observed_at":"2026-08-14T11:33:49.768223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:49.748715Z","title":"Temporal planning for compilation of quantum approximate optimization circuits","venue":null,"work_id":"85539193-c559-4332-a7e6-eb58cbee811e","year":2017},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.582100Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:9dcda7a6bb5ef5fc20ddf820a96603b2c398b1e306b1b9dcb85d79cad0281bd3","observation_id":"f412d54f-0807-4c74-96e5-cd33b5b7c189","resolution":{"observed_at":"2026-08-14T11:33:49.753781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:49.734611Z","title":"Computer-aided design for quantum computation","venue":null,"work_id":"911a1d7f-445e-425c-89e1-52df16d88836","year":2018},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.586428Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:4e39a00a3f8b2db99b16aef1f073c34e528952c3da41b683d238162ca8b1351d","observation_id":"7672a4ba-b13a-48fa-a331-00304a43cd2a","resolution":{"observed_at":"2026-08-14T11:33:49.738891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T11:33:49.715895Z","title":"An efficient methodology for mapping quantum circuits to the ibm qx architectures.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018","venue":null,"work_id":"149ccfbc-df4b-4dd6-8cb6-b57be19e2a95","year":2018},"citing_paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:49.591121Z"},"links":{"citing_paper":"/paper/1908.08853"},"observation_digest":"sha256:6a89e607597d1902b08ee5dcf6bc98dbfd2b39836e2ca858b8e2fdcd8776abb6","observation_id":"4d0a380a-2b96-4e54-995c-77961b5945ae","resolution":{"observed_at":"2026-08-14T11:33:49.724256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08853","last_updated":"2019-08-23T14:54:26Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T08:48:15.736792Z","submitted_at":"2019-08-23T14:54:26Z","title":"Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":25},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:1908.08853."}