{"as_of":"2026-08-08T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0579e85af3300142974a39842cc43cade4ee16d2e9f82598d42c14e90c7abbe","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-08T06:32:00.761636+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-07T14:15:01.472610Z","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-15T20:16:34.965338Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.08826","last_updated":"2025-01-28T07:12:09Z","snapshot_observed_at":"2026-07-06T13:32:38.285820Z","submitted_at":"2022-07-18T18:00:00Z","title":"Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.08826","snapshot_observed_at":"2026-08-07T14:15:01.472610Z","title":"Time-efficient constant-space-overhead fault-tolerant quantum computation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20265","last_updated":"2025-05-26T17:42:56Z","snapshot_observed_at":"2026-08-08T12:35:37.922713Z","submitted_at":"2025-05-26T17:42:56Z","title":"A distillation-teleportation protocol for fault-tolerant QRAM","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T14:15:01.472610Z"},"links":{"cited_paper":"/paper/2207.08826","citing_paper":"/paper/2505.20265"},"observation_digest":"sha256:ebc4f33ed17cc22fb65666845e1ab8a0162d98859a7161dbbf83f7c579f742cd","observation_id":"054ff86b-ec38-4503-85fe-4f888ab163f6","resolution":{"observed_at":"2026-08-07T14:15:01.472610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.08826","last_updated":"2025-01-28T07:12:09Z","snapshot_observed_at":"2026-07-06T13:32:38.285820Z","submitted_at":"2022-07-18T18:00:00Z","title":"Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation","version":3},"cited_work":{"arxiv_id":"2207.08826","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.08826","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Yamasaki and M","venue":null,"work_id":"5bef14c4-933f-4e19-a399-fbf69bb52204","year":2024},"citing_paper":{"arxiv_id":"2602.20238","last_updated":"2026-05-06T08:48:40Z","snapshot_observed_at":"2026-08-04T02:28:24.830535Z","submitted_at":"2026-02-23T19:00:00Z","title":"Proof of a finite threshold for the union-find decoder","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-15T20:12:10.149451Z"},"links":{"cited_paper":"/paper/2207.08826","citing_paper":"/paper/2602.20238"},"observation_digest":"sha256:1b16d8e7f775287500374fd92005570074919d711174b753a5d2eb6c2035e07a","observation_id":"81d754d2-3cb3-4670-8745-e0b5cae1bcd3","resolution":{"observed_at":"2026-05-15T20:16:34.967152Z","resolver_source":"arxiv_id","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/2207.08826/citation-record","integrity":"/paper/2207.08826/integrity","json":"/paper/2207.08826/citation-record.json","paper":"/paper/2207.08826"},"outbound":[],"paper":{"arxiv_id":"2207.08826","last_updated":"2025-01-28T07:12:09Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T13:32:38.285820Z","submitted_at":"2022-07-18T18:00:00Z","title":"Time-Efficient Constant-Space-Overhead 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-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 2 inbound Pith citation observations for arXiv:2207.08826."}