{"as_of":"2026-08-12T09:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2b66ac9247a0f0ca12eb25245f738594a04b7265e8ad0f3a426448be6c1dc10","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:46:24.724909Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T04:46:24.827546Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.05581","last_updated":"2025-03-05T18:20:55Z","snapshot_observed_at":"2026-07-06T18:27:36.903877Z","submitted_at":"2024-06-08T21:36:08Z","title":"Optimizing Gate Decomposition for High-Level Quantum Programming","version":2},"cited_work":{"arxiv_id":"2406.05581","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.05581","snapshot_observed_at":"2026-08-11T04:46:24.827546Z","title":"Optimizing Gate Decomposition for High-Level Quantum Programming","venue":"quant-ph","work_id":"4e2b88b1-1a5e-425f-a802-1f3e601d091c","year":2024},"citing_paper":{"arxiv_id":"2412.18533","last_updated":"2024-12-24T16:26:05Z","snapshot_observed_at":"2026-08-11T11:31:29.327212Z","submitted_at":"2024-12-24T16:26:05Z","title":"A Time Optimization Framework for the Implementation of Robust and Low-latency Quantum Circuits","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T04:46:24.724909Z"},"links":{"cited_paper":"/paper/2406.05581","citing_paper":"/paper/2412.18533"},"observation_digest":"sha256:1f43741f40630b24f6b01f5e095d5865c37568c8d1cf544141af8e6cc4bb5611","observation_id":"353567bd-c9b5-42d5-9b6c-cb9ae503d728","resolution":{"observed_at":"2026-08-11T04:46:24.834396Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05581","last_updated":"2025-03-05T18:20:55Z","snapshot_observed_at":"2026-07-06T18:27:36.903877Z","submitted_at":"2024-06-08T21:36:08Z","title":"Optimizing Gate Decomposition for High-Level Quantum Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05581","snapshot_observed_at":"2026-08-10T23:24:49.350749Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.20543","last_updated":"2024-12-29T18:19:06Z","snapshot_observed_at":"2026-08-10T23:16:04.659198Z","submitted_at":"2024-12-29T18:19:06Z","title":"Automated Auxiliary Qubit Allocation in High-Level Quantum Programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:49.350749Z"},"links":{"cited_paper":"/paper/2406.05581","citing_paper":"/paper/2412.20543"},"observation_digest":"sha256:660b9a941728718299343aba953c619e26d7788e6ee992552cd0309db2c09c1a","observation_id":"7085be67-5385-41dc-8817-b307efe2e060","resolution":{"observed_at":"2026-08-10T23:24:49.350749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.05581/citation-record","integrity":"/paper/2406.05581/integrity","json":"/paper/2406.05581/citation-record.json","paper":"/paper/2406.05581"},"outbound":[],"paper":{"arxiv_id":"2406.05581","last_updated":"2025-03-05T18:20:55Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T18:27:36.903877Z","submitted_at":"2024-06-08T21:36:08Z","title":"Optimizing Gate Decomposition for High-Level Quantum Programming"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.05581."}