{"as_of":"2026-08-10T18:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88b495a95c54c931db6eca71b0fc6b40460c879f70ce1076db7e731040b9922b","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T09:39:51.856595Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2601.13322/citation-record","integrity":"/paper/2601.13322/integrity","json":"/paper/2601.13322/citation-record.json","paper":"/paper/2601.13322"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:39:48.401281Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:48.401281Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:8795f80dd56a866a64a132a5b60393322fb1015b0f5126ad1199de0820ba8b50","observation_id":"07baf6b3-2484-431f-803d-c09995dc4478","resolution":{"observed_at":"2026-08-03T09:39:48.401281Z","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-03T09:39:48.545798Z","title":"Quantum algorithms: an overview,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:48.545798Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:a255b9b2fc443419ebc002b175617337a296002db95669b587ec2318da17e712","observation_id":"2c2bfa39-5a28-4ae4-976b-3f8d9263c04d","resolution":{"observed_at":"2026-08-03T09:39:48.545798Z","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-03T09:39:48.692975Z","title":"Quantum Computing in the NISQ era and beyond,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:48.692975Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:8e75534297342eafd788f258a6b0491b3201d456b001627a0d29ac4d9c5e6781","observation_id":"81483911-e3e4-4539-8c4c-954bf70ac630","resolution":{"observed_at":"2026-08-03T09:39:48.692975Z","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-03T09:39:48.839923Z","title":"Software mitigation of crosstalk on noisy intermediate-scale quantum computers,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:48.839923Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:9a78f74e8a7066abbcf14cd65fc79ee88f1ddaa4cacc297f929394a039f267b0","observation_id":"888c2409-03c5-475c-a793-a572055e31c0","resolution":{"observed_at":"2026-08-03T09:39:48.839923Z","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-03T09:39:48.981941Z","title":"Not all qubits are created equal: A case for variability-aware policies for nisq-era quantum computers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:48.981941Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:d82fc2c8541a303f9b2716c5c7091eba7820496b735573fc1b866b7d37649930","observation_id":"e604812a-aa7d-4493-8fe6-f7ba16e019dd","resolution":{"observed_at":"2026-08-03T09:39:48.981941Z","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-03T09:39:49.139131Z","title":"Tackling the qubit mapping problem for nisq-era quantum devices,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:49.139131Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:8efdbd23a521cca7658de71d2f05517e1ad4ece8fa10a9aa5a364247c690e62c","observation_id":"bb085c78-9000-44b4-9c5e-9191013622e4","resolution":{"observed_at":"2026-08-03T09:39:49.139131Z","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-03T09:39:49.308600Z","title":"Quantum supremacy using a programmable superconducting processor,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:49.308600Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:4017852f5e40b5472e28fb5898589805c0ac49941790901f544590bcbb582d8b","observation_id":"d3032290-b3c6-410e-9aee-212aaac6d90e","resolution":{"observed_at":"2026-08-03T09:39:49.308600Z","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-03T09:39:49.488827Z","title":"Qubit allocation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:49.488827Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:cd471eb7e6ccce2fd899c34c35f0ae54ad51d1be0b413eb98330ef718d7fe2f2","observation_id":"b4bbc7c6-e9bb-4be5-ad6a-1f0af0af2c04","resolution":{"observed_at":"2026-08-03T09:39:49.488827Z","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-03T09:39:49.632045Z","title":"Noise-adaptive compiler mappings for noisy intermediate-scale quan- tum computers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:49.632045Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:1a3feed595b1140f5412bdd6d2e36f413d133168119bd4ff0add922681aaeefb","observation_id":"25772a93-10ae-4144-8433-a12e105d506a","resolution":{"observed_at":"2026-08-03T09:39:49.632045Z","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-03T09:39:49.751159Z","title":"Approximate quantum fourier transform and decoherence,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:49.751159Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:bfe730af0deb7990c64051d054f714f3f35d3a084463ffdfb957a414e1fd6440","observation_id":"bf7fc137-3056-41f1-b808-275e2d2c0a44","resolution":{"observed_at":"2026-08-03T09:39:49.751159Z","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-03T09:39:49.895152Z","title":"Offline quantum circuit pruning for quantum chemical calculations,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:49.895152Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:542fd1f0404e0f67d838b6a81c0a86e5ddef76f49161592c37b44cb1ed2b6d07","observation_id":"9b29f171-50c2-4fa4-b38c-f65e96109707","resolution":{"observed_at":"2026-08-03T09:39:49.895152Z","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-03T09:39:50.068361Z","title":"Qadaprune: Adaptive parameter pruning for training variational quan- tum circuits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:50.068361Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:d132305d45b2483548ddd95d2f4317eaf2939509c27a6fa8577f5549092b30dd","observation_id":"542051c3-0a73-4997-888d-9e029aaf3f76","resolution":{"observed_at":"2026-08-03T09:39:50.068361Z","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-03T09:39:50.181776Z","title":"An accurate and efficient analytic model of fidelity under depolarizing noise oriented to large scale quantum system design,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:50.181776Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:b58ecad8852f9cf106462004658b2333388e3fb93473141c47b5de839b525995","observation_id":"499d2064-9c2e-4610-8824-abb3d1003c32","resolution":{"observed_at":"2026-08-03T09:39:50.181776Z","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-03T09:39:50.267540Z","title":"Variational quantum algorithms,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:50.267540Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:7bb5720a1959e8909b9ff0e69364fe5f2d85b1d00ff550f333aea7ad2297a76f","observation_id":"c48eaa48-4c6d-47c8-8d98-811b20f19a47","resolution":{"observed_at":"2026-08-03T09:39:50.267540Z","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-03T09:39:50.303980Z","title":"Quantum machine learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:50.303980Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:8ea2a496e2c69286328d521c636c17a7c63412e9fb3e61e84a34d98dcc731236","observation_id":"c37734d0-0fab-475e-bfc0-630d78c8fda9","resolution":{"observed_at":"2026-08-03T09:39:50.303980Z","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-03T09:39:50.310883Z","title":"Improved bounds for the approximate qft,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:50.310883Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:8616a520c50baa858af349fbdb058c9e0ffb21021defc0024eab1482b6f02fc7","observation_id":"1b51bf82-a5b9-4c50-9d7a-a84fa2e87573","resolution":{"observed_at":"2026-08-03T09:39:50.310883Z","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-03T09:39:50.449493Z","title":"MQT Bench: Benchmark- ing Software and Design Automation Tools for Quantum Computing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:50.449493Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:b8603872bb87c43bada745ec86357ddc7028135166c0daecadb2cfe4cad5fb9b","observation_id":"823ea0e0-abfa-46e8-9280-23c6fe25cf1d","resolution":{"observed_at":"2026-08-03T09:39:50.449493Z","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-03T09:39:50.624751Z","title":"Route-forcing: Scalable quantum circuit mapping for scalable quantum computing architectures,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:50.624751Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:f149d25237f3db56bc3372cf5e4dfdb64f8a511041c3c317f6d6bb5cc0002bd4","observation_id":"c3fdba58-780d-4bb0-9521-47edc09bdc87","resolution":{"observed_at":"2026-08-03T09:39:50.624751Z","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-03T09:39:50.741618Z","title":"Timing and resource-aware mapping of quantum circuits to superconducting processors,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:50.741618Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:cc727957a4ece97df0c537c9c448f4a0646fe600333441a23ea0ce43e43f4d64","observation_id":"e8b1ebeb-ca09-40d2-a4da-23c88912d8e0","resolution":{"observed_at":"2026-08-03T09:39:50.741618Z","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-03T09:39:50.868078Z","title":"Efficient mapping of quantum circuits to the ibm qx architectures,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:50.868078Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:ed3b734c321d8499b26feaf73a3414c8c2036ce36e280bd9bcaea80557963911","observation_id":"b621953d-43f8-4383-b68d-501cabacb0fc","resolution":{"observed_at":"2026-08-03T09:39:50.868078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.08368","last_updated":"2024-09-12T19:19:59Z","snapshot_observed_at":"2026-08-07T05:50:31.378266Z","submitted_at":"2024-09-12T19:19:59Z","title":"LightSABRE: A Lightweight and Enhanced SABRE Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.08368","snapshot_observed_at":"2026-08-03T09:39:51.015152Z","title":"Lightsabre: A lightweight and enhanced sabre algorithm,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:51.015152Z"},"links":{"cited_paper":"/paper/2409.08368","citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:5f456045551de681077288688adf3b0ef134b87fac53b0e66f2d7ec985c6ebfd","observation_id":"38018f66-9bff-4032-8fec-0aacbe9fdea1","resolution":{"observed_at":"2026-08-03T09:39:51.015152Z","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-03T09:39:51.204741Z","title":"Quantum error correction below the surface code threshold,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:51.204741Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:5dacfe3c6b32ee0f21410d9c4f76e8c80d9cf6753f784beed86fb0b61633e6b4","observation_id":"fb2ad75c-d72b-49b5-8916-22b52508627e","resolution":{"observed_at":"2026-08-03T09:39:51.204741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08810","last_updated":"2024-06-19T01:39:44Z","snapshot_observed_at":"2026-07-06T18:14:20.889736Z","submitted_at":"2024-05-14T17:55:32Z","title":"Quantum computing with Qiskit","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08810","snapshot_observed_at":"2026-08-03T09:39:51.342129Z","title":"Quantum computing with qiskit,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:51.342129Z"},"links":{"cited_paper":"/paper/2405.08810","citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:38b5f17efc9a3c3f90a000fdf2a7be9593efdc064eceeb1041723680d29ee07f","observation_id":"285d5f91-45dd-40d3-bd96-45aa9e46355b","resolution":{"observed_at":"2026-08-03T09:39:51.342129Z","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-03T09:39:51.489462Z","title":"Quantum computing simulator on a heterogenous hpc system,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:51.489462Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:cf16cdcaca4b743f6eded2195642d41671e20fe4db3f3d4113ba9d5c350a9b44","observation_id":"f7e3a15e-742d-483a-b6a6-128b9628bb6e","resolution":{"observed_at":"2026-08-03T09:39:51.489462Z","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-03T09:39:51.649933Z","title":"Complexity-theoretic foundations of quan- tum supremacy experiments,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:51.649933Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:22287dbc218c7c53ac3d7440f82f35700e6d88b8812dece8c8013d510a2fd6f6","observation_id":"957ec827-1006-4953-9e9c-9d3727ff27d8","resolution":{"observed_at":"2026-08-03T09:39:51.649933Z","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-03T09:39:51.856595Z","title":"Characterizing quantum supremacy in near-term devices,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T09:39:51.856595Z"},"links":{"citing_paper":"/paper/2601.13322"},"observation_digest":"sha256:78b1383fb0b355ad3db0b6d34f1d0690b0ebc85d09754547a56f108d94e2fa42","observation_id":"cfd97054-1752-4ffb-831e-077dbd813f34","resolution":{"observed_at":"2026-08-03T09:39:51.856595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.13322","last_updated":"2026-01-19T19:02:56Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T22:47:31.579605Z","submitted_at":"2026-01-19T19:02:56Z","title":"Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":26},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2601.13322."}