{"as_of":"2026-08-19T20:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:732f8cba0f43e5add4d4fec261816a9f0d1eff43d1bdb31b957bff99f63618f5","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-19T06:32:44.657259+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-11T20:10:58.106923Z","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-07T04:20:43.345738Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.06814","last_updated":"2024-02-09T22:38:47Z","snapshot_observed_at":"2026-08-16T14:19:44.832125Z","submitted_at":"2024-02-09T22:38:47Z","title":"High-Rate Fair-Density Parity-Check Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06814","snapshot_observed_at":"2026-08-11T20:10:58.106923Z","title":"High-rate fair-density parity-check codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06072","last_updated":"2025-08-14T16:52:55Z","snapshot_observed_at":"2026-08-19T08:31:50.365803Z","submitted_at":"2024-12-08T21:34:04Z","title":"PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:58.106923Z"},"links":{"cited_paper":"/paper/2402.06814","citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:d38668b907d49399be10b5e8957dd0f7d85b962825229fc8c389dc8ee9e759ae","observation_id":"446b2124-a24b-4dee-b15b-0f55abefffb5","resolution":{"observed_at":"2026-08-11T20:10:58.106923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06814","last_updated":"2024-02-09T22:38:47Z","snapshot_observed_at":"2026-08-16T14:19:44.832125Z","submitted_at":"2024-02-09T22:38:47Z","title":"High-Rate Fair-Density Parity-Check Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06814","snapshot_observed_at":"2026-08-07T04:22:43.842536Z","title":"High-rate fair-density parity-check codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-07T04:09:31.469871Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.842536Z"},"links":{"cited_paper":"/paper/2402.06814","citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:d69213a4d4586d41f744b0b758f0d89ab412dcddac681eb3de33dedf2cc7f589","observation_id":"fcb12ffc-efda-4c0e-881c-9842e5e86aed","resolution":{"observed_at":"2026-08-07T04:22:43.842536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06814","last_updated":"2024-02-09T22:38:47Z","snapshot_observed_at":"2026-08-16T14:19:44.832125Z","submitted_at":"2024-02-09T22:38:47Z","title":"High-Rate Fair-Density Parity-Check Codes","version":1},"cited_work":{"arxiv_id":"2402.06814","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.06814","snapshot_observed_at":"2026-08-07T04:20:43.345738Z","title":"High-Rate Fair-Density Parity-Check Codes","venue":"cs.IT","work_id":"71425f3c-b28b-41ae-bde4-3db6ca8d20e1","year":2024},"citing_paper":{"arxiv_id":"2506.11345","last_updated":"2025-06-12T22:34:22Z","snapshot_observed_at":"2026-08-14T04:35:06.355414Z","submitted_at":"2025-06-12T22:34:22Z","title":"On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:43.002570Z"},"links":{"cited_paper":"/paper/2402.06814","citing_paper":"/paper/2506.11345"},"observation_digest":"sha256:d4a344fa34d7ec44e263921a88a1723a0f26a9f350b27658baeca14948985d69","observation_id":"edda983b-1487-4e80-bbe3-5dbe69e7dda8","resolution":{"observed_at":"2026-08-07T04:20:43.434899Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2402.06814/citation-record","integrity":"/paper/2402.06814/integrity","json":"/paper/2402.06814/citation-record.json","paper":"/paper/2402.06814"},"outbound":[],"paper":{"arxiv_id":"2402.06814","last_updated":"2024-02-09T22:38:47Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T14:19:44.832125Z","submitted_at":"2024-02-09T22:38:47Z","title":"High-Rate Fair-Density Parity-Check Codes"},"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 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.06814."}