{"as_of":"2026-08-07T06:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74ef0e944f8ba7da1d6f08d28d802f3f02d390f2fd449e2a88a4755a3c6744fb","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-07T06:34:17.273281+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-07-31T02:25:48.913178Z","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":"2206.09973","last_updated":"2023-08-10T17:12:09Z","snapshot_observed_at":"2026-08-05T02:53:38.962539Z","submitted_at":"2022-06-20T19:28:57Z","title":"Two-sided Robustly Testable Codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.09973","snapshot_observed_at":"2026-07-13T14:10:32.422124Z","title":"Kalachev and P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.01874","last_updated":"2026-07-02T17:00:07Z","snapshot_observed_at":"2026-08-07T05:23:44.285370Z","submitted_at":"2026-04-02T10:30:00Z","title":"Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-13T14:10:32.422124Z"},"links":{"cited_paper":"/paper/2206.09973","citing_paper":"/paper/2604.01874"},"observation_digest":"sha256:a2a1f87e2de13cd4b82566faa993baf6b688701d89155555ce6aa7e78898a15f","observation_id":"5503c365-1ddd-4796-9590-83314e3fd21c","resolution":{"observed_at":"2026-07-13T14:10:32.422124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.09973","last_updated":"2023-08-10T17:12:09Z","snapshot_observed_at":"2026-08-05T02:53:38.962539Z","submitted_at":"2022-06-20T19:28:57Z","title":"Two-sided Robustly Testable Codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.09973","snapshot_observed_at":"2026-07-31T02:25:48.913178Z","title":"Kalachev and P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28605","last_updated":"2026-07-30T17:55:34Z","snapshot_observed_at":"2026-08-07T03:20:21.577604Z","submitted_at":"2026-07-30T17:55:34Z","title":"Logical computation with canonical lifted product codes","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-07-31T02:25:48.913178Z"},"links":{"cited_paper":"/paper/2206.09973","citing_paper":"/paper/2607.28605"},"observation_digest":"sha256:40222b6c78fa4db4dd91d848981f1b2b405284eac27d35b3c109410bdf39d9f8","observation_id":"f52af6d6-adf2-44af-bef8-2668eb9cfd69","resolution":{"observed_at":"2026-07-31T02:25:48.913178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.09973/citation-record","integrity":"/paper/2206.09973/integrity","json":"/paper/2206.09973/citation-record.json","paper":"/paper/2206.09973"},"outbound":[],"paper":{"arxiv_id":"2206.09973","last_updated":"2023-08-10T17:12:09Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-05T02:53:38.962539Z","submitted_at":"2022-06-20T19:28:57Z","title":"Two-sided Robustly Testable Codes"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2206.09973."}