{"as_of":"2026-08-17T18:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:23ca67391ad919c83ed548b82c1ac37102163daed2d5ec32ff71d7e416a2d51c","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:37:34.778419Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.20291/citation-record","integrity":"/paper/2504.20291/integrity","json":"/paper/2504.20291/citation-record.json","paper":"/paper/2504.20291"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:34.581949Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.581949Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:817bb7347b82760892a5ae7276516d6443895a0ec60570d8c34735542cae20b2","observation_id":"355621d6-2cfe-4d84-bd09-02bc25cf1b89","resolution":{"observed_at":"2026-08-16T05:37:34.581949Z","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-16T05:37:34.588790Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.588790Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:6ab7f6dd0938180e206f17984dd31336d26771c6e5a99642ca05f6ada157e5ab","observation_id":"5524001f-9968-4484-81c8-af977b42dc8d","resolution":{"observed_at":"2026-08-16T05:37:34.588790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:35.893532Z","title":"Bennett, Richard Cleve, David P","venue":null,"work_id":"7965f91d-c931-4e72-ad35-50c7236c34c7","year":null},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.595686Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:9e4d54834044a587c3e6fe1d04526ceb454fa92fd3593380c0c850d4e589116f","observation_id":"9c9d94a3-5e72-4580-895f-26e6e0a66cf3","resolution":{"observed_at":"2026-08-16T05:37:35.900314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:34.607314Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.607314Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:05cbf6bc1c880a5ab668a328dd034398e326f96b02f331ed4dfc672e576625e3","observation_id":"8dbf8439-5418-4ab4-9f8d-d74aa2018c52","resolution":{"observed_at":"2026-08-16T05:37:34.607314Z","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-16T05:37:34.613425Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.613425Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:8939654aa914c4b1c03aecd106a4afbc1f5ca821622cbadd95882fd82e9210e9","observation_id":"2959f806-02df-4093-bb7d-1aaaa8463cfa","resolution":{"observed_at":"2026-08-16T05:37:34.613425Z","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-16T05:37:34.619700Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.619700Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:5877ca776c17caae6c41a01a5cbdb3f95eafe291e025b8d2c8cdbd2123582bc9","observation_id":"7873e0d0-625e-4689-b54a-e9ea95bc7d39","resolution":{"observed_at":"2026-08-16T05:37:34.619700Z","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-16T05:37:34.625941Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.625941Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:b23f50bd2fea8e9f6b12f6f040c4c15c13b6429ec48cf1c64f3c17bac57c6361","observation_id":"400b4fce-c605-4115-bd02-a4469f4e6978","resolution":{"observed_at":"2026-08-16T05:37:34.625941Z","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-16T05:37:34.631179Z","title":"Da Silva and Daniel K","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.631179Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:fd959ee457d0633734c6429330f295944e034aaa4aeb69464bce28692003cdd5","observation_id":"e0bd35b2-693b-4969-bc19-ea08fe845f8c","resolution":{"observed_at":"2026-08-16T05:37:34.631179Z","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-16T05:37:34.636800Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.636800Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:e2b164719abf12033cc978459b9ca0e6332eb77ee4288729f61146cbd411302e","observation_id":"a02564fd-8cf5-4ff9-a1f1-85c62a1c74d7","resolution":{"observed_at":"2026-08-16T05:37:34.636800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:35.875454Z","title":null,"venue":null,"work_id":"99d1abee-fb5c-46e9-bc5e-1a347b574117","year":2021},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.642477Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:9d4e5af2055e11319c0cab670c2819f748367beef93665c311861f5bc28b48a0","observation_id":"6d207dd0-2fb6-4ab7-867e-cdd7aab46c0f","resolution":{"observed_at":"2026-08-16T05:37:35.880738Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:34.647588Z","title":"Abanin, Laleh Aghababaie-Beni, Igor Aleiner, Trond I","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.647588Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:99aab070731c0003b8d44c07184df33a4836ee66d3d97118d105c6bab469346a","observation_id":"bd62d855-feea-483d-b613-a3967dda79fc","resolution":{"observed_at":"2026-08-16T05:37:34.647588Z","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-16T05:37:34.652962Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.652962Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:60fa51ab6eb2948a149283a6ceb8057f9370cbbb254e481e97dfd8c65aabc2fb","observation_id":"a643a196-da03-4b9e-ac43-a8a8b3697a8c","resolution":{"observed_at":"2026-08-16T05:37:34.652962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:35.844197Z","title":null,"venue":null,"work_id":"c4b6ee52-ce4b-4878-a24d-3786bad82a9f","year":2023},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.657866Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:964e4b3fa56da91bfaaf100327d8679986dac3fb32298683926ecaf77322a67e","observation_id":"8a3963c3-fa35-4078-be1d-95255267c572","resolution":{"observed_at":"2026-08-16T05:37:35.849998Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:34.663314Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.663314Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:004e1d372ed539287fec75eb793825e8e48cea41536dfa34f9ec9266600b0c36","observation_id":"a99668d1-37ba-457c-95d3-5bebe24d858a","resolution":{"observed_at":"2026-08-16T05:37:34.663314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01072","last_updated":"2021-03-29T21:44:49Z","snapshot_observed_at":"2026-08-14T16:53:24.664749Z","submitted_at":"2019-04-01T19:19:06Z","title":"Introduction to UniversalQCompiler","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01072","snapshot_observed_at":"2026-08-16T05:37:34.668981Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.668981Z"},"links":{"cited_paper":"/paper/1904.01072","citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:5db4c72d055c361a3e75a3067315e06cf6e89405d101da39415582d366a69d23","observation_id":"09e23b5e-7a18-4e30-b071-18131832bdae","resolution":{"observed_at":"2026-08-16T05:37:34.668981Z","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-16T05:37:34.674957Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.674957Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:c74a98ba44eb50ac1e951b7ca850984137b7767e1d17f4eebc1d61045b354d97","observation_id":"1371c333-5481-4500-8a28-5b77dfe694d5","resolution":{"observed_at":"2026-08-16T05:37:34.674957Z","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-16T05:37:34.680243Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.680243Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:8e45bd3d265fc8cdf092e636a025982ca378a71ab1876b491d6df55b871cb53a","observation_id":"6c84f256-d453-4771-aa4b-70267794a7ed","resolution":{"observed_at":"2026-08-16T05:37:34.680243Z","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-16T05:37:34.685594Z","title":"McKay, Christopher J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.685594Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:b656cc1f13a68612d41b826de7c8a0e21f761786c570f7e224ca4d679b93f416","observation_id":"18a3cbfb-0270-4931-a781-56a41977004b","resolution":{"observed_at":"2026-08-16T05:37:34.685594Z","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-16T05:37:34.691245Z","title":"Nielsen and Isaac L","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.691245Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:afb132993ca98880d976ad46f8fa0523f2121daa1fda471f08ef4acdbe012ac7","observation_id":"1f56a79e-eee2-42f6-9f03-e348c93616cf","resolution":{"observed_at":"2026-08-16T05:37:34.691245Z","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-16T05:37:34.696731Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.696731Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:b6425164771044a0551880e0498154057cd0c3e5304363e9669f6f0a038cedca","observation_id":"657c39eb-ab45-4384-bee9-30cc0a9a76be","resolution":{"observed_at":"2026-08-16T05:37:34.696731Z","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-16T05:37:34.701873Z","title":"Gambetta, and Kristan Temme","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.701873Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:958488a62430994849b97ef343bf89449332d685332eef96cce3d91dc89e70b9","observation_id":"c005de38-fb79-48e2-94b3-4931f6bd36f4","resolution":{"observed_at":"2026-08-16T05:37:34.701873Z","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-16T05:37:34.707309Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.707309Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:2cea4bc84a70c8f6143cd44e8a859cdadc42e6996652bb7599d73ce491d1a9bb","observation_id":"a5b584ed-cf3e-4f6d-b318-5f4da1a2c0d0","resolution":{"observed_at":"2026-08-16T05:37:34.707309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:35.816938Z","title":null,"venue":null,"work_id":"31d5466e-8c5d-44e2-9164-a15f27b0055f","year":null},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.713067Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:bc1331e8f13b887f39c8e78d2abd33597fee51ff3b454cf8f4ca74b7455f421e","observation_id":"328d142c-01d6-4e40-a323-18d33ffdbb4f","resolution":{"observed_at":"2026-08-16T05:37:35.823492Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:34.725294Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.725294Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:42fd2a4d961f2de56ce2515d8a323b042dc8ae19dcd05c220ed4d04055be9d3d","observation_id":"edc96ec0-3ba9-4843-9cb5-aafce973b983","resolution":{"observed_at":"2026-08-16T05:37:34.725294Z","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-16T05:37:34.731997Z","title":"Schuster","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.731997Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:bd8514c0cad9e7661a1fa1ce0a8770102520d830a5fbd049f25b09ffa261882e","observation_id":"57650f43-4bf4-4621-a814-74fb05cb697a","resolution":{"observed_at":"2026-08-16T05:37:34.731997Z","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-16T05:37:34.737662Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.737662Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:6da65080896e8b11b6cc300e17db7d151674a9b72641d64b07fdd07adec6cb38","observation_id":"296680a6-3119-4dd1-90ba-a39d10a7fff0","resolution":{"observed_at":"2026-08-16T05:37:34.737662Z","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-16T05:37:34.742973Z","title":"Azevedo, Ismael C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.742973Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:85983249b25dd3aeeaf40549ff8d12b37bce9052e4685cb4cebfa8783638b2fc","observation_id":"6e9d59d7-7b38-454f-a09c-bba45a90b4c1","resolution":{"observed_at":"2026-08-16T05:37:34.742973Z","resolver_source":null,"status":"malformed_identifier"},"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-16T05:37:34.748337Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.748337Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:4201cb7c5b57ba1cecd7fa8674b793886bd45539a261ba010d71d7f5024e3664","observation_id":"5329c753-0a46-4882-a926-f1533e7b44a4","resolution":{"observed_at":"2026-08-16T05:37:34.748337Z","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-16T05:37:34.753494Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.753494Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:7870825ce1053d85dfa2b9eee4f3f6fef44d4e3d96379a630c5578671da61c68","observation_id":"57f947f3-b369-4768-9314-a46f9a1b6fe3","resolution":{"observed_at":"2026-08-16T05:37:34.753494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:35.791593Z","title":null,"venue":null,"work_id":"e9ada6dc-54d5-412e-840e-5bb9b7e66284","year":2023},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.759577Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:814ce0f74f6014692cb415a7a289e71c7403cd9c2f89671a3254ac6974a3b2c2","observation_id":"d2579955-3014-45e2-8e00-e08a17ee4a8d","resolution":{"observed_at":"2026-08-16T05:37:35.801285Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:34.771739Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.771739Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:f9b64d51fddad81a746954483f52815edec32c9dabbb0c74484df5d53f8fe6f4","observation_id":"9c4d10c8-dc04-435f-8a72-538505d8af51","resolution":{"observed_at":"2026-08-16T05:37:34.771739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02279","last_updated":"2025-03-18T15:35:11Z","snapshot_observed_at":"2026-08-16T14:04:10.639905Z","submitted_at":"2024-04-02T20:13:18Z","title":"Efficient Implementation of Multi-Controlled Quantum Gates","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02279","snapshot_observed_at":"2026-08-16T05:37:34.778419Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.778419Z"},"links":{"cited_paper":"/paper/2404.02279","citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:520e25ce392713e911b8e3d22274af4614615affbb014a8a0cb681de7695f21d","observation_id":"c074dd54-d980-4da7-8e95-5b75fd948538","resolution":{"observed_at":"2026-08-16T05:37:34.778419Z","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-16T05:37:34.601388Z","title":"1995), 3457–3467","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.601388Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:116154b150fbadffcc0dd27f45977d48876c3847938d3e8b3ecf867f9628e4ee","observation_id":"d4c50fde-5a04-4b97-a678-98ed8b9fb161","resolution":{"observed_at":"2026-08-16T05:37:34.601388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20543","last_updated":"2024-12-29T18:19:06Z","snapshot_observed_at":"2026-08-16T12:59:46.874638Z","submitted_at":"2024-12-29T18:19:06Z","title":"Automated Auxiliary Qubit Allocation in High-Level Quantum Programming","version":1},"cited_work":{"arxiv_id":"2412.20543","doi":"10.48550/arxiv.2412.20543","metadata_source":"pith","pith_arxiv_id":"2412.20543","snapshot_observed_at":"2026-08-16T12:16:17.039197Z","title":"Automated Auxiliary Qubit Allocation in High-Level Quantum Programming","venue":"quant-ph","work_id":"0879345f-f5c6-42ed-9715-b78205aac711","year":2024},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.719068Z"},"links":{"cited_paper":"/paper/2412.20543","citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:2a7cd7181774a0cba724dfebd99be1230505ce18172882f71deb8494819468f4","observation_id":"2d12bbab-d481-47b5-b0c6-32b2bafaad0f","resolution":{"observed_at":"2026-08-16T05:37:34.883410Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:37:34.765283Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs","version":2},"reference_index":2249,"source":"pdf_text","source_observed_at":"2026-08-16T05:37:34.765283Z"},"links":{"citing_paper":"/paper/2504.20291"},"observation_digest":"sha256:009c36d64410164a02cc08e6d7f4ad45282577b82a127da1323385d1c9c3cf1d","observation_id":"332d7e45-5ab3-48e1-9d79-82d3cf7a3a66","resolution":{"observed_at":"2026-08-16T05:37:34.765283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.20291","last_updated":"2025-09-11T23:31:43Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T05:30:43.726838Z","submitted_at":"2025-04-28T22:24:55Z","title":"Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2504.20291."}