{"as_of":"2026-08-18T23:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb347e475245778d1f18b421c2bec17ab6600104464bc5828724bccd34e4d98d","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-18T06:34:40.430872+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-12T00:43:08.540917Z","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-06T22:00:16.213165Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.10054","last_updated":"2025-06-14T05:21:49Z","snapshot_observed_at":"2026-08-17T18:10:34.455437Z","submitted_at":"2024-08-19T14:48:41Z","title":"Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs","version":3},"cited_work":{"arxiv_id":"2408.10054","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.10054","snapshot_observed_at":"2026-08-06T22:00:16.213165Z","title":"Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs","venue":"quant-ph","work_id":"41937fea-f14b-414e-97df-a0ea5b434ef4","year":2024},"citing_paper":{"arxiv_id":"2506.23320","last_updated":"2025-06-29T16:30:29Z","snapshot_observed_at":"2026-08-17T13:19:00.875323Z","submitted_at":"2025-06-29T16:30:29Z","title":"A Denotational Semantics for Quantum Loops","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:00:15.225697Z"},"links":{"cited_paper":"/paper/2408.10054","citing_paper":"/paper/2506.23320"},"observation_digest":"sha256:24a2761254bcd4e9e676ddbd33efccd8c471de15585a6e210490fa197cfd8228","observation_id":"4a56bae7-052e-4603-bd2f-39c30d2db752","resolution":{"observed_at":"2026-08-06T22:00:16.266290Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10054","last_updated":"2025-06-14T05:21:49Z","snapshot_observed_at":"2026-08-17T18:10:34.455437Z","submitted_at":"2024-08-19T14:48:41Z","title":"Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10054","snapshot_observed_at":"2026-08-12T00:43:08.540917Z","title":"per-level immediate cleanup","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-18T22:00:49.688214Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.540917Z"},"links":{"cited_paper":"/paper/2408.10054","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:79607cb5e618a8b3c685d292c9e8e06b85468fc3308db50feb060d84eb7d345a","observation_id":"8c89949f-7ce4-4cac-917d-189718531765","resolution":{"observed_at":"2026-08-12T00:43:08.540917Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.10054/citation-record","integrity":"/paper/2408.10054/integrity","json":"/paper/2408.10054/citation-record.json","paper":"/paper/2408.10054"},"outbound":[],"paper":{"arxiv_id":"2408.10054","last_updated":"2025-06-14T05:21:49Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T18:10:34.455437Z","submitted_at":"2024-08-19T14:48:41Z","title":"Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.10054."}