{"as_of":"2026-08-06T17:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e3cd154796126a5c1f6c547b8657ff20c500fb567c92c4949f54a21bfcbc29c","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-06T06:34:29.942622+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-05-21T17:07:35.207910Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T17:10:25.086687Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.10363","last_updated":"2021-02-04T10:08:43Z","snapshot_observed_at":"2026-08-05T19:26:22.582997Z","submitted_at":"2020-07-20T18:00:09Z","title":"Optimal universal programming of unitary gates","version":3},"cited_work":{"arxiv_id":"2007.10363","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.10363","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2d0bbb30-2c49-49f5-8cc9-e91634ea14d3","year":2020},"citing_paper":{"arxiv_id":"2507.10784","last_updated":"2026-04-17T07:38:57Z","snapshot_observed_at":"2026-08-01T16:33:33.147819Z","submitted_at":"2025-07-14T20:18:12Z","title":"Quantum Advantage in Storage and Retrieval of Isometry Channels","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-19T04:21:16.169640Z"},"links":{"cited_paper":"/paper/2007.10363","citing_paper":"/paper/2507.10784"},"observation_digest":"sha256:1ecf7c99faa8adac11c23f41eca0fbafe329e433c4a05b0957a575a86d96d9ce","observation_id":"a683f59d-c1c0-4f7f-8f30-6f77870113c5","resolution":{"observed_at":"2026-05-19T04:22:03.507020Z","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":"2007.10363","last_updated":"2021-02-04T10:08:43Z","snapshot_observed_at":"2026-08-05T19:26:22.582997Z","submitted_at":"2020-07-20T18:00:09Z","title":"Optimal universal programming of unitary gates","version":3},"cited_work":{"arxiv_id":"2007.10363","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.10363","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2d0bbb30-2c49-49f5-8cc9-e91634ea14d3","year":2020},"citing_paper":{"arxiv_id":"2512.21260","last_updated":"2026-05-16T02:13:25Z","snapshot_observed_at":"2026-07-06T22:40:02.746573Z","submitted_at":"2025-12-24T16:09:38Z","title":"Random dilation superchannel","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-21T17:07:35.207910Z"},"links":{"cited_paper":"/paper/2007.10363","citing_paper":"/paper/2512.21260"},"observation_digest":"sha256:d79e5d548d94367cbf494b1d3bdbe59429b3c971e400c0578ade3590ee6abd92","observation_id":"bdfdd669-f74a-4cfb-a6b9-8c0e5695209b","resolution":{"observed_at":"2026-05-21T17:10:25.088650Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2007.10363/citation-record","integrity":"/paper/2007.10363/integrity","json":"/paper/2007.10363/citation-record.json","paper":"/paper/2007.10363"},"outbound":[],"paper":{"arxiv_id":"2007.10363","last_updated":"2021-02-04T10:08:43Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-05T19:26:22.582997Z","submitted_at":"2020-07-20T18:00:09Z","title":"Optimal universal programming of unitary gates"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2007.10363."}