{"as_of":"2026-08-14T06:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f032f1cfb88e3f6dcb0c71eac307f2472459f8c7d93e39e3af8c928ce7ee294d","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:26:19.507833Z","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-10T10:49:56.379956Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.11923","last_updated":"2021-10-27T16:30:04Z","snapshot_observed_at":"2026-08-10T06:41:58.561707Z","submitted_at":"2021-10-22T17:08:18Z","title":"Climbing the Diagonal Clifford Hierarchy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.11923","snapshot_observed_at":"2026-08-09T14:26:19.507833Z","title":"Climbing the diagonal clifford hierarchy","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.01864","last_updated":"2025-07-07T18:47:26Z","snapshot_observed_at":"2026-08-13T22:14:26.821192Z","submitted_at":"2025-02-03T22:24:34Z","title":"Quantum Codes with Addressable and Transversal Non-Clifford Gates","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-09T14:26:19.507833Z"},"links":{"cited_paper":"/paper/2110.11923","citing_paper":"/paper/2502.01864"},"observation_digest":"sha256:876ab707d60170a9d26929d4d2e47c002ecf1bd1e487805d01de916787257d33","observation_id":"bbd8f26d-219d-460e-b113-3338d138677d","resolution":{"observed_at":"2026-08-09T14:26:19.507833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.11923","last_updated":"2021-10-27T16:30:04Z","snapshot_observed_at":"2026-08-10T06:41:58.561707Z","submitted_at":"2021-10-22T17:08:18Z","title":"Climbing the Diagonal Clifford Hierarchy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.11923","snapshot_observed_at":"2026-08-03T13:41:13.303436Z","title":"Climbing the diagonal Clifford hierarchy,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.23799","last_updated":"2026-05-25T05:55:56Z","snapshot_observed_at":"2026-08-14T03:16:16.688726Z","submitted_at":"2025-12-29T19:00:05Z","title":"Efficient simulation of logical magic state preparation protocols","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-03T13:41:13.303436Z"},"links":{"cited_paper":"/paper/2110.11923","citing_paper":"/paper/2512.23799"},"observation_digest":"sha256:9fafce0b8ef43290b8f2ee18a6344703176fcd69622d8bd4a1a5c619a85a5f71","observation_id":"ae0afdd1-b553-4b82-ae9d-0815db926ef7","resolution":{"observed_at":"2026-08-03T13:41:13.303436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.11923","last_updated":"2021-10-27T16:30:04Z","snapshot_observed_at":"2026-08-10T06:41:58.561707Z","submitted_at":"2021-10-22T17:08:18Z","title":"Climbing the Diagonal Clifford Hierarchy","version":2},"cited_work":{"arxiv_id":"2110.11923","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.11923","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Climbing the diagonal clifford hierarchy","venue":null,"work_id":"19b092b2-76f3-474a-9240-d9e4031615d0","year":2021},"citing_paper":{"arxiv_id":"2604.15436","last_updated":"2026-04-16T18:00:32Z","snapshot_observed_at":"2026-08-02T07:46:20.132879Z","submitted_at":"2026-04-16T18:00:32Z","title":"Parity-unfolded distillation architecture for noise-biased platforms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T10:46:17.303825Z"},"links":{"cited_paper":"/paper/2110.11923","citing_paper":"/paper/2604.15436"},"observation_digest":"sha256:a083aa228978dead1cb88e7c123bea56b634df7e0251dcfeacde5ed9fc096cae","observation_id":"4e5eaeed-c69e-4f01-98d4-356725a7b80e","resolution":{"observed_at":"2026-05-10T10:49:56.382823Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.11923/citation-record","integrity":"/paper/2110.11923/integrity","json":"/paper/2110.11923/citation-record.json","paper":"/paper/2110.11923"},"outbound":[],"paper":{"arxiv_id":"2110.11923","last_updated":"2021-10-27T16:30:04Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T06:41:58.561707Z","submitted_at":"2021-10-22T17:08:18Z","title":"Climbing the Diagonal Clifford Hierarchy"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2110.11923."}