{"as_of":"2026-08-08T08:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f332c86227616e27d49c2a1891467bd4c869e14ffdd79c791279abba4a207b0","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:13:33.335424Z","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-07T12:13:43.147200Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1103.0215","last_updated":"2011-07-29T17:28:08Z","snapshot_observed_at":"2026-07-06T02:24:14.491142Z","submitted_at":"2011-03-01T16:54:56Z","title":"Reversible Circuit Optimization via Leaving the Boolean Domain","version":2},"cited_work":{"arxiv_id":"1103.0215","doi":null,"metadata_source":"pith","pith_arxiv_id":"1103.0215","snapshot_observed_at":"2026-08-07T12:13:43.147200Z","title":"Reversible Circuit Optimization via Leaving the Boolean Domain","venue":"quant-ph","work_id":"a23cc7d4-8465-41ae-a0f0-fdb6cae1997a","year":2011},"citing_paper":{"arxiv_id":"2506.00695","last_updated":"2025-06-29T20:21:44Z","snapshot_observed_at":"2026-08-07T11:57:41.440935Z","submitted_at":"2025-05-31T20:01:21Z","title":"Multi-Controlled Quantum Gates in Linear Nearest Neighbor","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T12:13:33.335424Z"},"links":{"cited_paper":"/paper/1103.0215","citing_paper":"/paper/2506.00695"},"observation_digest":"sha256:9fe976bb68d52d4cb52d3f8e55851ddc167b668b46ef4e83f50421f678113275","observation_id":"6eb8569c-fe98-42d8-ad64-5a43accf283f","resolution":{"observed_at":"2026-08-07T12:13:43.252534Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1103.0215/citation-record","integrity":"/paper/1103.0215/integrity","json":"/paper/1103.0215/citation-record.json","paper":"/paper/1103.0215"},"outbound":[],"paper":{"arxiv_id":"1103.0215","last_updated":"2011-07-29T17:28:08Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T02:24:14.491142Z","submitted_at":"2011-03-01T16:54:56Z","title":"Reversible Circuit Optimization via Leaving the Boolean Domain"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1103.0215."}