{"as_of":"2026-08-20T06:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92138d2add4d85139fe85354941eaa06a3bf80e733d5040e20ac487b952725ab","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:45:51.661766Z","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-07-02T23:17:30.041081Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","snapshot_observed_at":"2026-08-16T16:52:43.176341Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders","version":1},"cited_work":{"arxiv_id":"2206.07750","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.07750","snapshot_observed_at":"2026-07-02T23:17:30.041081Z","title":"Good quantum ldpc codes with linear time decoders","venue":null,"work_id":"6b9e0da1-6f3a-4c2f-a413-d79578523ee8","year":2023},"citing_paper":{"arxiv_id":"2406.14445","last_updated":"2026-04-20T00:18:11Z","snapshot_observed_at":"2026-07-06T18:34:19.513528Z","submitted_at":"2024-06-20T16:08:06Z","title":"High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T00:16:39.285123Z"},"links":{"cited_paper":"/paper/2206.07750","citing_paper":"/paper/2406.14445"},"observation_digest":"sha256:f0290b6fd631b54bb24909f8da76740c44f750c0d7c3e561ae751f434f789334","observation_id":"7f3774d9-9169-4e65-b9a5-fd10586908d2","resolution":{"observed_at":"2026-05-24T00:18:39.406953Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","snapshot_observed_at":"2026-08-16T16:52:43.176341Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07750","snapshot_observed_at":"2026-08-16T05:45:51.661766Z","title":"Good quantum ldpc codes with linear time decoders","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20333","last_updated":"2025-07-17T16:20:01Z","snapshot_observed_at":"2026-08-16T05:29:29.404518Z","submitted_at":"2025-04-29T00:53:34Z","title":"List Decoding Expander-Based Codes up to Capacity in Near-Linear Time","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T05:45:51.661766Z"},"links":{"cited_paper":"/paper/2206.07750","citing_paper":"/paper/2504.20333"},"observation_digest":"sha256:999b51ac1e16c0b3263b5381df2512b9749625e1f73bcdcd97d8c48d0e07089e","observation_id":"59fcd0ba-2645-4156-8410-638e25062c39","resolution":{"observed_at":"2026-08-16T05:45:51.661766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","snapshot_observed_at":"2026-08-16T16:52:43.176341Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07750","snapshot_observed_at":"2026-08-06T23:56:10.467529Z","title":"Dinur, M.-H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.15905","last_updated":"2025-06-18T22:37:21Z","snapshot_observed_at":"2026-08-13T09:40:39.092690Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.467529Z"},"links":{"cited_paper":"/paper/2206.07750","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:692366711ab3391d6826c7bb19978422a04989bb39559a225c183629806886e2","observation_id":"9b76f64b-81b3-4538-baa9-b477e985c311","resolution":{"observed_at":"2026-08-06T23:56:10.467529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","snapshot_observed_at":"2026-08-16T16:52:43.176341Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07750","snapshot_observed_at":"2026-08-15T19:00:17.357590Z","title":"Dinur, M.-H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.18061","last_updated":"2026-07-09T06:17:06Z","snapshot_observed_at":"2026-08-20T04:29:01.528187Z","submitted_at":"2025-06-22T15:07:03Z","title":"Planar fault-tolerant logical measurements with low qubit overhead","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:00:17.357590Z"},"links":{"cited_paper":"/paper/2206.07750","citing_paper":"/paper/2506.18061"},"observation_digest":"sha256:80ad2c843ffc983ef2b1576d1053117498dd3dfe0f5910ab4ab44eb49044089d","observation_id":"43f62d58-e8d4-4fc3-b2e7-841abd3705ad","resolution":{"observed_at":"2026-08-15T19:00:17.357590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","snapshot_observed_at":"2026-08-16T16:52:43.176341Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders","version":1},"cited_work":{"arxiv_id":"2206.07750","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.07750","snapshot_observed_at":"2026-07-02T23:17:30.041081Z","title":"Good quantum ldpc codes with linear time decoders","venue":null,"work_id":"6b9e0da1-6f3a-4c2f-a413-d79578523ee8","year":2023},"citing_paper":{"arxiv_id":"2510.19442","last_updated":"2026-04-11T13:17:53Z","snapshot_observed_at":"2026-08-16T18:29:37.535883Z","submitted_at":"2025-10-22T10:15:40Z","title":"Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-18T05:16:35.002960Z"},"links":{"cited_paper":"/paper/2206.07750","citing_paper":"/paper/2510.19442"},"observation_digest":"sha256:e980a92eaf7e9dfc566cc3efcef93d16a8c94d47761c8113e5961db0993162bb","observation_id":"4e3f252e-f98b-4fe0-88f0-898e43668003","resolution":{"observed_at":"2026-05-18T05:20:54.518512Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","snapshot_observed_at":"2026-08-16T16:52:43.176341Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07750","snapshot_observed_at":"2026-08-03T08:00:01.313905Z","title":"Dinur, M.-H","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-18T02:09:45.824509Z","submitted_at":"2026-01-26T19:00:03Z","title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T08:00:01.313905Z"},"links":{"cited_paper":"/paper/2206.07750","citing_paper":"/paper/2601.18879"},"observation_digest":"sha256:f7420da99083ab8e7a8fd2b9b4400c174b97b018dae46cc7b03adb497c8f3440","observation_id":"212f9b14-a8c2-4036-a33e-b26ad543850f","resolution":{"observed_at":"2026-08-03T08:00:01.313905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","snapshot_observed_at":"2026-08-16T16:52:43.176341Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders","version":1},"cited_work":{"arxiv_id":"2206.07750","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.07750","snapshot_observed_at":"2026-07-02T23:17:30.041081Z","title":"Good quantum ldpc codes with linear time decoders","venue":null,"work_id":"6b9e0da1-6f3a-4c2f-a413-d79578523ee8","year":2023},"citing_paper":{"arxiv_id":"2606.08771","last_updated":"2026-06-07T18:24:32Z","snapshot_observed_at":"2026-08-14T13:43:30.675787Z","submitted_at":"2026-06-07T18:24:32Z","title":"Algebra of Bivariate-Bicycle Surface Codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T18:17:06.305544Z"},"links":{"cited_paper":"/paper/2206.07750","citing_paper":"/paper/2606.08771"},"observation_digest":"sha256:7a68873a19af07133b4e7234bd5206a18b84d814b64c5f8156203fafc41ddfb5","observation_id":"96834077-e314-4daf-b5e4-4ac326a9b91e","resolution":{"observed_at":"2026-07-02T23:17:30.042639Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","snapshot_observed_at":"2026-08-16T16:52:43.176341Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07750","snapshot_observed_at":"2026-08-14T04:19:02.773845Z","title":"Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick.https://arxiv.org/abs/2206.07750","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-19T01:22:14.174611Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":226,"source":"pdf_text","source_observed_at":"2026-08-14T04:19:02.773845Z"},"links":{"cited_paper":"/paper/2206.07750","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:69aec1dde41efa8089fdfd8a0a3b0f083ad550ae2f3a623f2a71bedd0b34726a","observation_id":"70353e35-0326-4d47-9941-e4eb2beb38b2","resolution":{"observed_at":"2026-08-14T04:19:02.773845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.07750/citation-record","integrity":"/paper/2206.07750/integrity","json":"/paper/2206.07750/citation-record.json","paper":"/paper/2206.07750"},"outbound":[],"paper":{"arxiv_id":"2206.07750","last_updated":"2022-06-15T18:23:15Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T16:52:43.176341Z","submitted_at":"2022-06-15T18:23:15Z","title":"Good Quantum LDPC Codes with Linear Time Decoders"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2206.07750."}