{"as_of":"2026-08-06T18:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e75197ec054957af47c27672dd67508da0a1adaa4b613be73afdf6cdf6c82f38","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T17:22:18.625482Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.04748/citation-record","integrity":"/paper/2605.04748/integrity","json":"/paper/2605.04748/citation-record.json","paper":"/paper/2605.04748"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Going beyond bell’s theorem","venue":null,"work_id":"5f4b5188-0acf-447f-90a8-c2ef49e36147","year":1989},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:b0735c6ecfea5b019b234af41ad7fafc76627b9c7698e90f0c34a39b4a86d46d","observation_id":"166b0a36-a7ae-42fe-8271-c6ce4b45d2e0","resolution":{"observed_at":"2026-05-26T08:01:55.285601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.98.022322","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"K.et al.Quantum algorithms for electronic structure calculations: Particle-hole hamiltonian and optimized wave-function expansions.Phys","venue":"Physical review. A/Physical review, A","work_id":"ccae4d82-813e-4a73-abe3-a48e1aa5ddc2","year":2018},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:13772a22f25ef38c99578f3b183e299084457a868f695e28fb54b94608229c02","observation_id":"e4774504-0f3b-4fdb-8d5c-5129a88d6aab","resolution":{"observed_at":"2026-05-08T17:23:40.389889Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms","venue":null,"work_id":"0a013383-d85d-48c6-b335-6661625ab0ce","year":2019},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:32b8225fcb06fa4e9f49b809e344027de55a3a241e3efc119a4fe8a0902c1e7d","observation_id":"082f6dde-f64c-4f1f-a408-a84d34204d6d","resolution":{"observed_at":"2026-05-26T08:01:55.277816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed quantum com- puting: A distributed shor algorithm","venue":null,"work_id":"d2568a90-e4d2-4310-9713-f32a5e37d1cb","year":2004},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:4c0ae2f6244f8e1317c542baea3d55be1c45169c45bb0daac23f9e2aa3108b71","observation_id":"285c1357-6785-4ee0-8514-497cb2775e5d","resolution":{"observed_at":"2026-05-26T08:01:55.257349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum neural networks force fields generation","venue":null,"work_id":"2e08e3c6-a0db-4144-8ec9-30fd8ed83e16","year":null},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:1e7e41c979097a0f30bf1d86297b1dd69a3ad71802bacf060c438db78d85119b","observation_id":"504f95d9-8d8d-445e-b85d-68fa2ace7c14","resolution":{"observed_at":"2026-05-26T08:01:55.297331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1088/2632-2153/ac7d3c","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Available: https://dx.doi.org/10.1088/2632-2153/ac7d3c","venue":"Machine Learning Science and Technology","work_id":"8424e6c8-4a24-40e4-8247-366bf33a6df0","year":null},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:2c44b5008c2afd95841e8c10833479ec6f96f38c428b9c4499d642fd3054229a","observation_id":"7c1d71e3-e008-4ae8-af08-f486e06b610d","resolution":{"observed_at":"2026-05-08T17:23:40.393986Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automated error correction in ibm quantum computer and explicit generalization","venue":null,"work_id":"5932c860-2b10-4bfe-a9be-cca3783d5267","year":2018},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:3ccdc2671294e74b55265cd266805099a8b12090e94c2d76d7eb0a32e08bd7c2","observation_id":"662dbbfe-3a8c-4d7a-8f12-76259066c4e6","resolution":{"observed_at":"2026-05-26T08:01:55.266556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Solving graph problems using permutation- invariant quantum machine learning","venue":null,"work_id":"5fbd5433-304e-44ca-aa43-06c55bc0194c","year":2025},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:3220deb383e8fc0280f0a539395337094ed7459a2de501c90762725d3b898d1c","observation_id":"56a19d3f-e9f3-48f9-9e40-5554a6fb19e5","resolution":{"observed_at":"2026-05-26T08:01:55.270261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits","venue":null,"work_id":"c9415456-d0b9-4aea-b8f7-8635837b6c4e","year":2013},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:a03fec36f4afa11963bf03e2a88f422a59c7c25917320cd9211ab24c2725c4dc","observation_id":"279b353a-cff5-4929-bb0b-b1ccd8d03a81","resolution":{"observed_at":"2026-05-26T08:01:55.293584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04349","last_updated":"2024-08-08T10:20:13Z","snapshot_observed_at":"2026-07-06T18:58:18.051281Z","submitted_at":"2024-08-08T10:20:13Z","title":"Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation","version":1},"cited_work":{"arxiv_id":"2408.04349","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.04349","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal layout-aware cnot circuit synthesis with qubit permutation","venue":null,"work_id":"15ab03b0-af8a-450b-a571-350b4aa5634e","year":2024},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"cited_paper":"/paper/2408.04349","citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:7859613e9a15cc6067d29305b56488d6170fe601218c2f399072a968cbad9aab","observation_id":"6f2d3a31-aef8-42c2-a661-a712045cf8f6","resolution":{"observed_at":"2026-05-11T17:41:05.789701Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00592","last_updated":"2025-05-31T06:14:43Z","snapshot_observed_at":"2026-07-06T16:26:06.398260Z","submitted_at":"2023-10-01T06:30:58Z","title":"Nearest neighbor synthesis of CNOT circuits on general quantum architectures","version":2},"cited_work":{"arxiv_id":"2310.00592","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00592","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nearest neighbor synthesis of cnot circuits on general quantum architectures","venue":null,"work_id":"1a408a8a-2b05-442c-924e-521b31851968","year":2023},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"cited_paper":"/paper/2310.00592","citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:74c04fbaa35025b3069f6c3f224de1d7da62c5d9211cd4103447cdbb748e9455","observation_id":"2cc6f2fa-1d69-45e3-bbe5-6e14337e4710","resolution":{"observed_at":"2026-05-11T17:41:05.776228Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum circuits of cnot gates: optimization and entangle- ment","venue":null,"work_id":"7ba42a72-643c-4431-ba9c-33acbb88204a","year":2022},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:ca049827131f4dc9c9dd3eb60334e79c5c6204ed6fc6cb289f40299df09d212d","observation_id":"73718f55-bd19-4ddf-b46e-5754d12aeea2","resolution":{"observed_at":"2026-05-26T08:01:55.313974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient quantum circuit compilation for near- term quantum advantage","venue":null,"work_id":"610056f6-8422-404e-890c-8f9273a1196b","year":2025},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:ba981ff452e63e455e67a398d5d1e3fe8fabb50299bf59f74294eddad2e89a7d","observation_id":"4f0d6712-888c-43b9-961a-0cae159d65d8","resolution":{"observed_at":"2026-05-26T08:01:55.329704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e1648bb3-2cfd-476c-94d5-5a4aefd54782","year":2010},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:7d392671ee6ffc63851a5179eaaeb81c2134ce676d04f3bf00e7c42dc6840a62","observation_id":"e6ce5fba-33ff-4e6e-990e-f1a377f278fa","resolution":{"observed_at":"2026-05-26T08:01:55.253244Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient quantum algorithms for ghz and w states, and implementation on the ibm quantum computer","venue":null,"work_id":"f4cae33b-fb44-4121-86fe-3cfaa3305256","year":2019},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:3a01005cb5fb576bdeb89b3987ea5a3258485bb9fefbd89264953435907a1ac3","observation_id":"cfca2d44-5474-432d-8d69-d1d18a57a86c","resolution":{"observed_at":"2026-05-26T08:01:55.305544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generation and verification of 27-qubit greenberger-horne-zeilinger states in a superconducting quantum com- puter","venue":null,"work_id":"e3e80414-999c-47ee-938a-ba4646347d75","year":2021},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:065c068d271d1de96f126332329f97f351b68a1a24b3f445ec518a63b79ff62c","observation_id":"ba90852f-93a6-41b5-913e-bc514a7eb7c1","resolution":{"observed_at":"2026-05-26T08:01:55.261889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multivariate trace estimation in constant quantum depth","venue":null,"work_id":"383fea24-90fc-4fd3-90ed-ec76b7be5398","year":2024},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:98cf631f1dd09b664fc3612d553f955fd830309339c1b1ac42bcfa6b5e1dc048","observation_id":"679e77bb-3d5e-49e6-a1de-2f785f89ffcf","resolution":{"observed_at":"2026-05-26T08:01:55.281795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum computing with Qiskit","venue":null,"work_id":"6679454e-89ce-4691-b394-2476c0fbe224","year":2024},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:e373c3259fe2ad57f48e6e6be410696bb838219410267822091f919afeb5e9d7","observation_id":"38c6375a-3584-4103-bf39-39e9fe72353c","resolution":{"observed_at":"2026-05-26T08:01:55.273690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"t—ket〉: a retargetable compiler for nisq devices","venue":null,"work_id":"82973c78-d6dd-4edc-95fa-ca9958767515","year":2020},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:b063f59433a46392bc25a4ff746cc39cb89daf56edb7dd92aa16cc693d44d893","observation_id":"ce092179-32cb-434f-a1ec-75530d49ff79","resolution":{"observed_at":"2026-05-26T08:01:55.325513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Practical resource estimation for quantum many- body simulations","venue":null,"work_id":"0235836d-f452-42b2-8ba9-5b394fc82e49","year":2016},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:c0c289b9c2f89ba8089f854b477e4135ee4427f7ad8ae4328d992b863da551d7","observation_id":"b1cfce45-ddee-4898-a871-2f0db3dce33d","resolution":{"observed_at":"2026-05-26T08:01:55.309391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An efficient methodology for mapping quantum circuits to the ibm qx architectures","venue":null,"work_id":"5f787656-c422-4a3b-92e7-183241b3df7d","year":2019},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:81244be9c146bc591ca5345d56a426a03bfc696ff40ef7bfd372135324f45408","observation_id":"fda259a0-bfe5-472e-948a-efa45aefb3f8","resolution":{"observed_at":"2026-05-26T08:01:55.301273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Polynomial-time t-depth optimization of clifford+t circuits via matroid partitioning","venue":null,"work_id":"6ee90dd7-21b5-4808-99cf-2f46b1974bbb","year":2014},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:06999736ab6debcfd83f5a0ba9ac3c0498eb7ed24641da3c632a38fea2690943","observation_id":"c863b01d-1074-4b95-9607-4a1664dd076d","resolution":{"observed_at":"2026-05-26T08:01:55.318341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automated optimization of large quantum circuits with continuous parameters","venue":null,"work_id":"5fbd45d5-49a8-4116-bc48-6809e8fe4fde","year":2018},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:c1a44387d9ba89343f261eca3ed89b8de0daf3f016f6704c48e4f9f21c987767","observation_id":"d01cca97-4e4a-44bc-8835-ec402ff6269f","resolution":{"observed_at":"2026-05-26T08:01:55.322176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ancilla-free quantum adder with sub- linear depth","venue":null,"work_id":"9137b1b8-47a2-4e9f-bb0c-b5149e456747","year":2025},"citing_paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:18.625482Z"},"links":{"citing_paper":"/paper/2605.04748"},"observation_digest":"sha256:aefb7c1d84c34222679bdaaa34bf229fbddc7336e3bb01759c82d290e3c39ba6","observation_id":"cdac524f-e7b5-43b2-8e3c-11c9e7d415b0","resolution":{"observed_at":"2026-05-26T08:01:55.289458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.04748","last_updated":"2026-05-06T10:55:18Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T23:17:28.583202Z","submitted_at":"2026-05-06T10:55:18Z","title":"Automated Circuit Depth Reduction of Quantum Subroutines via Compilation"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":19},"total_outbound_references":24},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2605.04748."}