{"as_of":"2026-08-12T21:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8e6993d23a6ddc4b51b26752cc205b49d936885d3ee63cc5e06ddd4cd7dba2a","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-12T00:43:08.490036Z","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-11T14:58:08.656149Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1510.00377","last_updated":"2015-10-01T19:48:52Z","snapshot_observed_at":"2026-07-06T04:31:44.421146Z","submitted_at":"2015-10-01T19:48:52Z","title":"Reversible circuit compilation with space constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00377","snapshot_observed_at":"2026-08-12T00:43:08.490036Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-12T21:13:55.181318Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.490036Z"},"links":{"cited_paper":"/paper/1510.00377","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:442bfd450c26e77319de85996fabfd00021522385a22a53762361b6751b9c600","observation_id":"76ff6ff2-1697-4889-9ef0-42882f064ceb","resolution":{"observed_at":"2026-08-12T00:43:08.490036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00377","last_updated":"2015-10-01T19:48:52Z","snapshot_observed_at":"2026-07-06T04:31:44.421146Z","submitted_at":"2015-10-01T19:48:52Z","title":"Reversible circuit compilation with space constraints","version":1},"cited_work":{"arxiv_id":"1510.00377","doi":null,"metadata_source":"pith","pith_arxiv_id":"1510.00377","snapshot_observed_at":"2026-08-11T14:58:08.656149Z","title":"Reversible circuit compilation with space constraints","venue":"quant-ph","work_id":"0d7b5be9-2278-4e45-a74b-72b11a2d0a69","year":2015},"citing_paper":{"arxiv_id":"2608.09578","last_updated":"2026-08-10T13:13:54Z","snapshot_observed_at":"2026-08-12T21:18:08.089311Z","submitted_at":"2026-08-10T13:13:54Z","title":"Quantum Uncomputation of Clean and Dirty Ancilla Qubits","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T14:58:07.861719Z"},"links":{"cited_paper":"/paper/1510.00377","citing_paper":"/paper/2608.09578"},"observation_digest":"sha256:0543c71a19baf5c28a91d529f0de13a77865532c337a25070847fc5ce694e71e","observation_id":"a753da16-0315-422f-8b6e-7e78e80777c5","resolution":{"observed_at":"2026-08-11T14:58:08.661271Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1510.00377/citation-record","integrity":"/paper/1510.00377/integrity","json":"/paper/1510.00377/citation-record.json","paper":"/paper/1510.00377"},"outbound":[],"paper":{"arxiv_id":"1510.00377","last_updated":"2015-10-01T19:48:52Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T04:31:44.421146Z","submitted_at":"2015-10-01T19:48:52Z","title":"Reversible circuit compilation with space constraints"},"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:1510.00377."}