{"as_of":"2026-08-17T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:624b0a8a7b098fa66de176861b6ecb5a1419c74106985788e8e9c5edda2ab06d","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-17T06:30:58.91139+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-16T00:11:52.160293Z","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-12T13:58:00.909052Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.06557","last_updated":"2022-06-14T02:17:09Z","snapshot_observed_at":"2026-08-17T03:24:23.408492Z","submitted_at":"2022-06-14T02:17:09Z","title":"An efficient decoder for a linear distance quantum LDPC code","version":1},"cited_work":{"arxiv_id":"2206.06557","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.06557","snapshot_observed_at":"2026-08-12T13:58:00.909052Z","title":"An efficient decoder for a linear distance quantum LDPC code","venue":"quant-ph","work_id":"d54e2e09-9381-48c0-84aa-68acd18b86ff","year":2022},"citing_paper":{"arxiv_id":"2411.15848","last_updated":"2025-06-27T13:01:13Z","snapshot_observed_at":"2026-08-15T23:36:39.347434Z","submitted_at":"2024-11-24T14:01:37Z","title":"Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T13:57:59.115181Z"},"links":{"cited_paper":"/paper/2206.06557","citing_paper":"/paper/2411.15848"},"observation_digest":"sha256:2c23c28e72286a24bbe6631b6dfe3a2e6e617ce8a566559892100806e72ba6e3","observation_id":"30e3e39f-a51a-4731-a2bf-9d7bf7d5bd04","resolution":{"observed_at":"2026-08-12T13:58:00.914903Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.06557","last_updated":"2022-06-14T02:17:09Z","snapshot_observed_at":"2026-08-17T03:24:23.408492Z","submitted_at":"2022-06-14T02:17:09Z","title":"An efficient decoder for a linear distance quantum LDPC code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.06557","snapshot_observed_at":"2026-08-03T08:00:01.447494Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.18879","last_updated":"2026-05-24T01:40:16Z","snapshot_observed_at":"2026-08-16T07:54:11.104788Z","submitted_at":"2026-01-26T19:00:03Z","title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T08:00:01.447494Z"},"links":{"cited_paper":"/paper/2206.06557","citing_paper":"/paper/2601.18879"},"observation_digest":"sha256:e0ba051429a3491a572d74dc09feed3002d23d7d3fe15db2726fe39f92501e4d","observation_id":"e7d81588-5faa-408d-96cb-49ea409b6405","resolution":{"observed_at":"2026-08-03T08:00:01.447494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.06557","last_updated":"2022-06-14T02:17:09Z","snapshot_observed_at":"2026-08-17T03:24:23.408492Z","submitted_at":"2022-06-14T02:17:09Z","title":"An efficient decoder for a linear distance quantum LDPC code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.06557","snapshot_observed_at":"2026-08-16T00:11:52.160293Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12509","last_updated":"2026-08-12T18:37:15Z","snapshot_observed_at":"2026-08-17T22:11:46.127676Z","submitted_at":"2026-08-12T18:37:15Z","title":"Quantum Tanner Codes at Moderate Blocklength","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:11:52.160293Z"},"links":{"cited_paper":"/paper/2206.06557","citing_paper":"/paper/2608.12509"},"observation_digest":"sha256:bdc74e23956a0dc41b9fe01c90fd123feb9c5d1c53820d523d94dd7bbf2f3073","observation_id":"ba99d7a6-e6fa-4ce0-bf38-5fcde99b940e","resolution":{"observed_at":"2026-08-16T00:11:52.160293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.06557/citation-record","integrity":"/paper/2206.06557/integrity","json":"/paper/2206.06557/citation-record.json","paper":"/paper/2206.06557"},"outbound":[],"paper":{"arxiv_id":"2206.06557","last_updated":"2022-06-14T02:17:09Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T03:24:23.408492Z","submitted_at":"2022-06-14T02:17:09Z","title":"An efficient decoder for a linear distance quantum LDPC code"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2206.06557."}