{"as_of":"2026-08-10T16:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d36e2570af1f47f083c99594ca430ddde8d9842a2b9c7e38c992aa656c001aaf","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:56:10.462888Z","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-23T20:33:26.067200Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.04068","last_updated":"2021-10-03T18:58:06Z","snapshot_observed_at":"2026-08-08T21:27:32.590144Z","submitted_at":"2020-12-07T21:20:53Z","title":"Quantum LDPC Codes with Almost Linear Minimum Distance","version":2},"cited_work":{"arxiv_id":"2012.04068","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.04068","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Panteleev and G","venue":null,"work_id":"542802a3-edea-4817-9bf2-4c6860dc0a36","year":2012},"citing_paper":{"arxiv_id":"2410.02213","last_updated":"2026-07-07T06:51:25Z","snapshot_observed_at":"2026-07-10T23:17:13.211419Z","submitted_at":"2024-10-03T05:04:12Z","title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T20:28:25.490103Z"},"links":{"cited_paper":"/paper/2012.04068","citing_paper":"/paper/2410.02213"},"observation_digest":"sha256:becab696676fb14cb3b110126a0ff1f3d3005760666243226cff64724041b923","observation_id":"ff965012-bf51-47d8-99b7-6c0a0a129c70","resolution":{"observed_at":"2026-05-23T20:33:26.072582Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.04068","last_updated":"2021-10-03T18:58:06Z","snapshot_observed_at":"2026-08-08T21:27:32.590144Z","submitted_at":"2020-12-07T21:20:53Z","title":"Quantum LDPC Codes with Almost Linear Minimum Distance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.04068","snapshot_observed_at":"2026-08-06T23:56:10.462888Z","title":"Panteleev and G","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-09T17:54:45.592104Z","submitted_at":"2025-06-18T22:37:21Z","title":"Transversal Gates for Highly Asymmetric qLDPC Codes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T23:56:10.462888Z"},"links":{"cited_paper":"/paper/2012.04068","citing_paper":"/paper/2506.15905"},"observation_digest":"sha256:a5280527f2b532d090b9dc1975b97d2107bf6f4f897be2c473e78d9796085a20","observation_id":"7e82fd74-f91a-4838-bbed-ef36f4b3c92a","resolution":{"observed_at":"2026-08-06T23:56:10.462888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.04068","last_updated":"2021-10-03T18:58:06Z","snapshot_observed_at":"2026-08-08T21:27:32.590144Z","submitted_at":"2020-12-07T21:20:53Z","title":"Quantum LDPC Codes with Almost Linear Minimum Distance","version":2},"cited_work":{"arxiv_id":"2012.04068","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.04068","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Panteleev and G","venue":null,"work_id":"542802a3-edea-4817-9bf2-4c6860dc0a36","year":2012},"citing_paper":{"arxiv_id":"2604.18714","last_updated":"2026-04-20T18:14:28Z","snapshot_observed_at":"2026-08-03T04:33:55.994506Z","submitted_at":"2026-04-20T18:14:28Z","title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T04:46:26.589764Z"},"links":{"cited_paper":"/paper/2012.04068","citing_paper":"/paper/2604.18714"},"observation_digest":"sha256:40c52e2d468d3a1f92b88a7dcb3e5a15976e46593ec4a8010e34a722be397e95","observation_id":"d350f388-8841-4ff5-90ea-ffcabcc2c51b","resolution":{"observed_at":"2026-05-10T11:40:19.606740Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.04068","last_updated":"2021-10-03T18:58:06Z","snapshot_observed_at":"2026-08-08T21:27:32.590144Z","submitted_at":"2020-12-07T21:20:53Z","title":"Quantum LDPC Codes with Almost Linear Minimum Distance","version":2},"cited_work":{"arxiv_id":"2012.04068","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.04068","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Panteleev and G","venue":null,"work_id":"542802a3-edea-4817-9bf2-4c6860dc0a36","year":2012},"citing_paper":{"arxiv_id":"2604.20013","last_updated":"2026-04-21T21:43:03Z","snapshot_observed_at":"2026-07-06T23:06:31.110859Z","submitted_at":"2026-04-21T21:43:03Z","title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T01:59:36.998867Z"},"links":{"cited_paper":"/paper/2012.04068","citing_paper":"/paper/2604.20013"},"observation_digest":"sha256:ac87bb3113a80b54290cf14e30718bf9886e2fbba2580ba2d85a4764d4104a59","observation_id":"348ddd72-40be-4186-b6d5-76f1c9f03183","resolution":{"observed_at":"2026-05-11T13:21:02.772917Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.04068","last_updated":"2021-10-03T18:58:06Z","snapshot_observed_at":"2026-08-08T21:27:32.590144Z","submitted_at":"2020-12-07T21:20:53Z","title":"Quantum LDPC Codes with Almost Linear Minimum Distance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.04068","snapshot_observed_at":"2026-07-11T07:07:39.359688Z","title":"Panteleev and G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.05386","last_updated":"2026-07-09T17:58:26Z","snapshot_observed_at":"2026-08-08T13:08:36.166528Z","submitted_at":"2026-07-06T17:56:55Z","title":"Logical Spectroscopy: Lifted-Product Codes with Addressable Bases","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-11T07:07:39.359688Z"},"links":{"cited_paper":"/paper/2012.04068","citing_paper":"/paper/2607.05386"},"observation_digest":"sha256:0a8b6657aa2c00e174164eac1ceaa7c6bd1c2053554d9727bc3c65071999044e","observation_id":"3390f25e-45af-4d5c-be88-1998bf5cc35e","resolution":{"observed_at":"2026-07-11T07:07:39.359688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2012.04068/citation-record","integrity":"/paper/2012.04068/integrity","json":"/paper/2012.04068/citation-record.json","paper":"/paper/2012.04068"},"outbound":[],"paper":{"arxiv_id":"2012.04068","last_updated":"2021-10-03T18:58:06Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-08T21:27:32.590144Z","submitted_at":"2020-12-07T21:20:53Z","title":"Quantum LDPC Codes with Almost Linear Minimum Distance"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2012.04068."}