{"as_of":"2026-08-08T09:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:56609fa2d7e61e9bb3953fc56a09317206522e16ff07e2f6cc7d8740902de2e5","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-07T06:01:45.704937Z","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-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/2506.06752/citation-record","integrity":"/paper/2506.06752/integrity","json":"/paper/2506.06752/citation-record.json","paper":"/paper/2506.06752"},"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-07T06:01:46.303510Z","title":"URL: https://docs.quantum.ibm.com/api/qiskit/qiskit.circuit.library.IGate","venue":null,"work_id":"d40cf07f-602d-4a4c-9f84-c2464f8b28a2","year":null},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.618761Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:5a27b4821eb4e9a15dfbc38c41819fd71a5cab601dbb3e4969c0e656f635fa3a","observation_id":"45da9ec7-4ab7-4112-9512-d52072e2118f","resolution":{"observed_at":"2026-08-07T06:01:46.307118Z","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-07T06:01:46.292969Z","title":"CaDiCaL , Kissat , Paracooba , Plingeling and Treengeling entering the SAT Competition 2020","venue":null,"work_id":"2c8fcfcf-2586-48d3-9482-666b0de9449c","year":2020},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.622861Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:a697206feb64376d0fd39681763b04008a94feb3bb5b2417ba9188462e5ab343","observation_id":"d63f1fb3-2e06-463b-abfd-0d21cefefa37","resolution":{"observed_at":"2026-08-07T06:01:46.296959Z","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-07T06:01:46.282859Z","title":"Handbook of Satisfiability - Second Edition , volume 336 of Frontiers in Artificial Intelligence and Applications","venue":null,"work_id":"840fd30d-e2e8-4170-a13f-a363d9459b90","year":2021},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.626209Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:f0bd3eedb8abaf52aecbe2e7dc0e307c6637bcc5b30ef9c5197966c1450b131f","observation_id":"1b0bf3ba-e5ed-4ef0-b956-a8e42178885a","resolution":{"observed_at":"2026-08-07T06:01:46.286453Z","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-07T06:01:45.629489Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.629489Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:56f431282633ab1c5254ca8ee2f6be71ba7ff522550f0d8674bcdce4d86ae6cd","observation_id":"f8e5c6a7-3bcd-45a6-b889-195ee6f0ff81","resolution":{"observed_at":"2026-08-07T06:01:45.629489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.633119Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.633119Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:329944e662cd8ebccb50cc8cf5c7c8921a49b6d7a33789e104e2f84c6dbe9646","observation_id":"9738d616-0637-413e-b8c3-984c5e24923b","resolution":{"observed_at":"2026-08-07T06:01:45.633119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.636417Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.636417Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:270f3a84e1fc6fde2a404fbf8ad29e7c542d6b5f09a17275cd6669502b8d1a1a","observation_id":"02d1c0cb-32ff-4e6c-b302-3ee4cf07fbe9","resolution":{"observed_at":"2026-08-07T06:01:45.636417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.639846Z","title":"Modeling and simulating the noisy behavior of near-term quantum computers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.639846Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:0d9c4f1f06aacae7903e4425652e0c754865a1fd3ee9ee138bff0556a65a8b9b","observation_id":"526f6b12-3f29-469f-a7b9-2c132ce00d6e","resolution":{"observed_at":"2026-08-07T06:01:45.639846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.26421/qic11.1-2-10","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.782796Z","title":"An efficient conversion of quantum circuits to a linear nearest neighbor architecture","venue":null,"work_id":"5f87402a-1845-4b24-a68d-90f189e34091","year":2011},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.643302Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:681131d7f443a439ae6b40855921f260746b7757d9cdada2475d9b1b0d4cac91","observation_id":"4c8da332-e231-488f-bc38-ecf158e100ba","resolution":{"observed_at":"2026-08-07T06:01:45.786742Z","resolver_source":"doi","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":"10.5281/zenodo.15606051","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.771962Z","title":"depth-optimal quantum layout synthesis as sat","venue":null,"work_id":"52ea166d-50f2-43b1-aa7a-b949ebff91a7","year":2025},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.646578Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:5ce320b40bea6f78fafa4ce6c3d5f56dcd77548c89ae479d3d1c0f046f21ec66","observation_id":"31bf0ab0-cb7c-4216-94a2-e07bd24e0880","resolution":{"observed_at":"2026-08-07T06:01:45.776148Z","resolver_source":"doi","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-07T06:01:46.272849Z","title":"Kautz, David A","venue":null,"work_id":"c4cbe72c-e523-4bf0-a2a3-212af3eaf6d3","year":1996},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.649767Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:24e924553e9ece2d220b7cd1d9777931f8fc4be5b521063c9101009fe56441e1","observation_id":"b9e54bdd-3688-482e-b14e-5edb40d1b138","resolution":{"observed_at":"2026-08-07T06:01:46.276423Z","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-07T06:01:45.652853Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.652853Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:220e932c9f57177494a8ef53d4e19a1c6a1d39695e4418e146c2bb1ab1d79f3c","observation_id":"11bfe3a0-18a3-4e51-8537-df49f752bab2","resolution":{"observed_at":"2026-08-07T06:01:45.652853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.657231Z","title":"QASMBench : A low-level quantum benchmark suite for NISQ evaluation and simulation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.657231Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:8b126c49769abfdf97a4bfb656dfe9e9aa9aa4dfa32855d8ba43703efa261cc1","observation_id":"f2092389-8589-4a69-96f2-4c8f3fe175e1","resolution":{"observed_at":"2026-08-07T06:01:45.657231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.661063Z","title":"Tackling the qubit mapping problem for nisq-era quantum devices","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.661063Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:4b9e0822c902457ce444f7e256f3ed1f8c494f3e1a7da8fd14e61a40c9b6cfbe","observation_id":"f6b44cc6-f9bb-448b-9dc9-8bfc55cdf8ca","resolution":{"observed_at":"2026-08-07T06:01:45.661063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.667480Z","title":"Scalable optimal layout synthesis for NISQ quantum processors","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.667480Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:596dde5037b6fb6b647b6fce17349749aa4847f516827d92404ab9f9dba777c8","observation_id":"de83548f-575a-4d02-8ba5-d30106ed4604","resolution":{"observed_at":"2026-08-07T06:01:45.667480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.670594Z","title":"Conflict-driven clause learning sat solvers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.670594Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:fa83c29ec50d18f81b774d663c950a90485c2f2ef06a7c11016e9ea00098b017","observation_id":"b6c525e2-f68d-436e-a846-ae44d33bb4ba","resolution":{"observed_at":"2026-08-07T06:01:45.670594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.673841Z","title":"Nielsen and Isaac L","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.673841Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:92b6cd447a2049a3dd499080abf37aa06fb087c8b3b419b2dc7fdafdd0efc8ab","observation_id":"ddec6e8a-9f9b-442a-8d77-dfd835ad0e9a","resolution":{"observed_at":"2026-08-07T06:01:45.673841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.677016Z","title":"Karpuzcu","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.677016Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:7cd5afc012d8fff051df36a4a179f6e50b2df88e1f51acd790745fcfc44e55d4","observation_id":"a495f933-09b5-4994-afe2-9403382d61ec","resolution":{"observed_at":"2026-08-07T06:01:45.677016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.680057Z","title":"Optimal layout synthesis for quantum circuits as classical planning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.680057Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:a194850367941cce62144420004b387ed4a2884085b3093177083cf1cbf71a3a","observation_id":"1ae8e553-f8b4-4309-bc89-8afbb8bf1e50","resolution":{"observed_at":"2026-08-07T06:01:45.680057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.683211Z","title":"Optimal layout synthesis for deep quantum circuits on NISQ processors with 100+ qubits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.683211Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:3a8b9de80889a125ae058957b50817dc6b38a05fc6e57b42ccac6b91e9c348df","observation_id":"31aedcef-1b5e-4278-a907-0833871a71af","resolution":{"observed_at":"2026-08-07T06:01:45.683211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.686305Z","title":"t|ket⟩: a retargetable compiler for nisq devices","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.686305Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:a15bef176c01195391450231741013d176462307a715beea664df6eda562d71c","observation_id":"42a96d39-adf6-4951-8b90-beaf1fba2cf5","resolution":{"observed_at":"2026-08-07T06:01:45.686305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.692359Z","title":"Optimality study of existing quantum computing layout synthesis tools","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.692359Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:1c972d0b24e1ddea6fca218f6ab69976646bbfadc3d6e1af70d82e139e68f51d","observation_id":"b3c805c4-f850-45f3-b219-238a0608cced","resolution":{"observed_at":"2026-08-07T06:01:45.692359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.695160Z","title":"Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.695160Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:fcfea7cf8bd478399ac885777f4e0e5ed0be3cd01cffdc72faba724ec28b1961","observation_id":"506947c6-9830-4231-a9f5-a9d6ae03731a","resolution":{"observed_at":"2026-08-07T06:01:45.695160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09835","last_updated":"2022-03-23T17:58:00Z","snapshot_observed_at":"2026-08-04T23:49:53.035356Z","submitted_at":"2020-12-17T18:54:38Z","title":"QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09835","snapshot_observed_at":"2026-08-07T06:01:45.698372Z","title":"Chong, and Costin Iancu","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.698372Z"},"links":{"cited_paper":"/paper/2012.09835","citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:bd506b2a852041b446f915c7c90dc0c290444dab29e4691917ceab6106d19984","observation_id":"e9b3070a-c768-47e1-926d-e4c08660bf62","resolution":{"observed_at":"2026-08-07T06:01:45.698372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.sat.2024.29","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.730003Z","title":"Kharkov, Yunong Shi, Marijn J","venue":null,"work_id":"0b914531-e3b8-48a5-804f-9b01cc344327","year":2024},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.701938Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:da16c6e5462de2414b3262a61f8b7a6c70063da5869bda2eb15b195ee687419d","observation_id":"24f27789-745d-4910-ad82-882bc1d6447f","resolution":{"observed_at":"2026-08-07T06:01:45.734736Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:01:45.704937Z","title":"An efficient methodology for mapping quantum circuits to the IBM QX architectures","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T06:01:45.704937Z"},"links":{"citing_paper":"/paper/2506.06752"},"observation_digest":"sha256:49ead683343881e1849ccd6f779d46b9f4dbb1cf881548e128ae50d61ee905c2","observation_id":"7ab708f3-eafb-4fc7-a739-288c572d8727","resolution":{"observed_at":"2026-08-07T06:01:45.704937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.06752","last_updated":"2025-06-07T10:47:58Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T05:47:54.543024Z","submitted_at":"2025-06-07T10:47:58Z","title":"Depth-Optimal Quantum Layout Synthesis as SAT"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":3,"verified_fuzzy":4},"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-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 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2506.06752."}