{"as_of":"2026-08-17T12:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c668bdd5e96cd515f69ea43e29860a71bb7341e548df156b7c6c246ae823408e","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:45:51.602748Z","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-08T13:16:48.859820Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.09445","last_updated":"2025-08-28T22:48:10Z","snapshot_observed_at":"2026-08-16T15:39:22.855421Z","submitted_at":"2023-04-19T06:28:54Z","title":"Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets","version":6},"cited_work":{"arxiv_id":"2304.09445","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.09445","snapshot_observed_at":"2026-08-08T13:16:48.859820Z","title":"Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets","venue":"cs.IT","work_id":"72016d8f-f32c-48c9-83b9-a69a8c13cd08","year":2023},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.688849Z"},"links":{"cited_paper":"/paper/2304.09445","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:592a6171d1575349ebd6e029912636e9fcba43bae31d09804af6f2a8f507edec","observation_id":"3d7ac8ac-f271-455b-9579-b8e6cc4b82ce","resolution":{"observed_at":"2026-08-08T13:16:48.864342Z","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":"2304.09445","last_updated":"2025-08-28T22:48:10Z","snapshot_observed_at":"2026-08-16T15:39:22.855421Z","submitted_at":"2023-04-19T06:28:54Z","title":"Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.09445","snapshot_observed_at":"2026-08-16T05:45:51.602748Z","title":"Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields","venue":null,"work_id":null,"year":2024},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-16T05:45:51.602748Z"},"links":{"cited_paper":"/paper/2304.09445","citing_paper":"/paper/2504.20333"},"observation_digest":"sha256:7efaea168da10382a41984ade9b26ccc5bcca1cd0f0b2070362e7fb3c319f766","observation_id":"ed7bd292-3108-4bc0-9e60-5e19973e392f","resolution":{"observed_at":"2026-08-16T05:45:51.602748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2304.09445/citation-record","integrity":"/paper/2304.09445/integrity","json":"/paper/2304.09445/citation-record.json","paper":"/paper/2304.09445"},"outbound":[],"paper":{"arxiv_id":"2304.09445","last_updated":"2025-08-28T22:48:10Z","latest_version":6,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T15:39:22.855421Z","submitted_at":"2023-04-19T06:28:54Z","title":"Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets"},"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 2 inbound Pith citation observations for arXiv:2304.09445."}