{"as_of":"2026-08-22T05:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8fe3e49ecdb2856edb7dc9072c3699ed14079a89326cca077d73449cf50939dc","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:50:28.143745Z","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-05T21:18:51.837952Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.03646","last_updated":"2024-11-06T03:53:10Z","snapshot_observed_at":"2026-08-16T13:02:33.570405Z","submitted_at":"2024-11-06T03:53:10Z","title":"Quantum LDPC Codes of Almost Linear Distance via Homological Products","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03646","snapshot_observed_at":"2026-08-05T23:50:15.270829Z","title":"Quantum ldpc codes of almost linear distance via homological products","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.04794","last_updated":"2025-08-06T18:10:37Z","snapshot_observed_at":"2026-08-20T04:54:14.116824Z","submitted_at":"2025-08-06T18:10:37Z","title":"Automorphism gadgets in homological product codes","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T23:50:15.270829Z"},"links":{"cited_paper":"/paper/2411.03646","citing_paper":"/paper/2508.04794"},"observation_digest":"sha256:b96c28ccddb6a47bf7acb2287a1917465698a354c483e69db344158035c9d986","observation_id":"262bb3df-82f2-410e-bc2a-61ff401eb8ba","resolution":{"observed_at":"2026-08-05T23:50:15.270829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03646","last_updated":"2024-11-06T03:53:10Z","snapshot_observed_at":"2026-08-16T13:02:33.570405Z","submitted_at":"2024-11-06T03:53:10Z","title":"Quantum LDPC Codes of Almost Linear Distance via Homological Products","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03646","snapshot_observed_at":"2026-08-05T23:50:28.143745Z","title":"Quantum ldpc codes of almost linear distance via homological products","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.04796","last_updated":"2026-07-02T23:06:55Z","snapshot_observed_at":"2026-08-19T16:29:06.735528Z","submitted_at":"2025-08-06T18:14:43Z","title":"Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T23:50:28.143745Z"},"links":{"cited_paper":"/paper/2411.03646","citing_paper":"/paper/2508.04796"},"observation_digest":"sha256:175c1092ada1f3599d4bc34b10901bd6c5046f3712d992800a9ebcb46b0d67e1","observation_id":"5a5dc257-b535-4203-ada7-daee721f2cae","resolution":{"observed_at":"2026-08-05T23:50:28.143745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03646","last_updated":"2024-11-06T03:53:10Z","snapshot_observed_at":"2026-08-16T13:02:33.570405Z","submitted_at":"2024-11-06T03:53:10Z","title":"Quantum LDPC Codes of Almost Linear Distance via Homological Products","version":1},"cited_work":{"arxiv_id":"2411.03646","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.03646","snapshot_observed_at":"2026-08-05T21:18:51.837952Z","title":"Quantum LDPC Codes of Almost Linear Distance via Homological Products","venue":"quant-ph","work_id":"4edb3165-345a-4cf3-b402-b37fa98e446e","year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-20T04:30:27.545368Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:46.508520Z"},"links":{"cited_paper":"/paper/2411.03646","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:73612d06e5716a516b5f10cee101b1e2a86fef1b031c29f272249503872a2803","observation_id":"21df02ec-6fcb-4b60-aa55-48eb8efc39ab","resolution":{"observed_at":"2026-08-05T21:18:51.944935Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03646","last_updated":"2024-11-06T03:53:10Z","snapshot_observed_at":"2026-08-16T13:02:33.570405Z","submitted_at":"2024-11-06T03:53:10Z","title":"Quantum LDPC Codes of Almost Linear Distance via Homological Products","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03646","snapshot_observed_at":"2026-08-02T00:07:11.047456Z","title":"Quantum LDPC Codes of Almost Linear Distance via Homological Products,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15159","last_updated":"2026-07-20T15:43:25Z","snapshot_observed_at":"2026-08-20T06:50:02.629452Z","submitted_at":"2026-07-16T16:02:16Z","title":"LDGM-Based Quantum Codes for Fault-Tolerant Quantum Computation","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T00:07:11.047456Z"},"links":{"cited_paper":"/paper/2411.03646","citing_paper":"/paper/2607.15159"},"observation_digest":"sha256:1fa4fe57a8e5a403f72518840dce000140a32995e11f655a288d2930df054f01","observation_id":"58092715-e372-423b-9d1a-80b7b5a16726","resolution":{"observed_at":"2026-08-02T00:07:11.047456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.03646/citation-record","integrity":"/paper/2411.03646/integrity","json":"/paper/2411.03646/citation-record.json","paper":"/paper/2411.03646"},"outbound":[],"paper":{"arxiv_id":"2411.03646","last_updated":"2024-11-06T03:53:10Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T13:02:33.570405Z","submitted_at":"2024-11-06T03:53:10Z","title":"Quantum LDPC Codes of Almost Linear Distance via Homological Products"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2411.03646."}