{"as_of":"2026-08-06T14:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77a2669e06d57dc0d98628aaf9cc0d8de9f4942fa22db79926a18b044dfdce28","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-06T06:34:29.942622+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-03T20:00:06.826442Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0712.2084","last_updated":"2008-01-15T19:08:10Z","snapshot_observed_at":"2026-07-06T01:33:42.123660Z","submitted_at":"2007-12-13T04:59:28Z","title":"Semi-Clifford operations, structure of $\\mathcal{C}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0712.2084","snapshot_observed_at":"2026-08-03T20:00:06.826442Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2511.22271","last_updated":"2026-07-21T18:26:30Z","snapshot_observed_at":"2026-08-06T09:16:30.633395Z","submitted_at":"2025-11-27T09:49:57Z","title":"Local Equivalences of Graph States","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-03T20:00:06.826442Z"},"links":{"cited_paper":"/paper/0712.2084","citing_paper":"/paper/2511.22271"},"observation_digest":"sha256:cdccaf88eba5534f643b54d275927994894f2b2f22fdf3963ac559cacf64c458","observation_id":"0ca4e051-8254-41c0-9acc-a28035d49d45","resolution":{"observed_at":"2026-08-03T20:00:06.826442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0712.2084","last_updated":"2008-01-15T19:08:10Z","snapshot_observed_at":"2026-07-06T01:33:42.123660Z","submitted_at":"2007-12-13T04:59:28Z","title":"Semi-Clifford operations, structure of $\\mathcal{C}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0712.2084","snapshot_observed_at":"2026-08-03T16:32:53.995630Z","title":"Semi-Clifford operations, structure ofC k hierarchy, and gate complexity for fault-tolerant quantum computation,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.13777","last_updated":"2026-06-03T13:47:30Z","snapshot_observed_at":"2026-08-03T16:32:52.300365Z","submitted_at":"2025-12-15T19:00:00Z","title":"Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T16:32:53.995630Z"},"links":{"cited_paper":"/paper/0712.2084","citing_paper":"/paper/2512.13777"},"observation_digest":"sha256:0a68e64340833def946ff4d9c09d395cabe5e0aa6e0aa7b9843241881483ad65","observation_id":"b6acc885-4280-4ae1-bd8f-83e3a102d1d6","resolution":{"observed_at":"2026-08-03T16:32:53.995630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0712.2084","last_updated":"2008-01-15T19:08:10Z","snapshot_observed_at":"2026-07-06T01:33:42.123660Z","submitted_at":"2007-12-13T04:59:28Z","title":"Semi-Clifford operations, structure of $\\mathcal{C}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0712.2084","snapshot_observed_at":"2026-08-01T15:40:19.208830Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.18400","last_updated":"2026-07-20T18:00:20Z","snapshot_observed_at":"2026-08-06T06:33:03.059585Z","submitted_at":"2026-07-20T18:00:20Z","title":"Magic-protected entanglement and Clifford-irreducible structure in magic state space","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T15:40:19.208830Z"},"links":{"cited_paper":"/paper/0712.2084","citing_paper":"/paper/2607.18400"},"observation_digest":"sha256:0cbb725e213e6545100f5a12369d555f4b190ec7d5f0c7d5cc9f658a63db36e9","observation_id":"29034bea-c2d2-4bc3-9d0b-7d06b0e84d6b","resolution":{"observed_at":"2026-08-01T15:40:19.208830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/0712.2084/citation-record","integrity":"/paper/0712.2084/integrity","json":"/paper/0712.2084/citation-record.json","paper":"/paper/0712.2084"},"outbound":[],"paper":{"arxiv_id":"0712.2084","last_updated":"2008-01-15T19:08:10Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T01:33:42.123660Z","submitted_at":"2007-12-13T04:59:28Z","title":"Semi-Clifford operations, structure of $\\mathcal{C}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation"},"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 3 inbound Pith citation observations for arXiv:0712.2084."}