{"as_of":"2026-08-17T16:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ce52947d7871bd01cc2764c5d6a0d785145aa40d0d4f3adc2bcf2e21dad98d3","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.634233Z","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.736938Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.05256","last_updated":"2024-08-28T18:13:22Z","snapshot_observed_at":"2026-08-16T16:53:50.312991Z","submitted_at":"2022-06-10T17:54:02Z","title":"Generic Reed-Solomon Codes Achieve List-decoding Capacity","version":4},"cited_work":{"arxiv_id":"2206.05256","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.05256","snapshot_observed_at":"2026-08-08T13:16:48.736938Z","title":"Generic Reed-Solomon Codes Achieve List-decoding Capacity","venue":"cs.IT","work_id":"a024f5bc-df4a-4806-9274-d00977c00bcc","year":2022},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.707473Z"},"links":{"cited_paper":"/paper/2206.05256","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:c8671478f0841bfe39b62573d2cc1e422dcf983c05ee506ef58ce9ded6205143","observation_id":"6b8dbf86-7134-44ad-a12a-c67f8610b8fe","resolution":{"observed_at":"2026-08-08T13:16:48.741546Z","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":"2206.05256","last_updated":"2024-08-28T18:13:22Z","snapshot_observed_at":"2026-08-16T16:53:50.312991Z","submitted_at":"2022-06-10T17:54:02Z","title":"Generic Reed-Solomon Codes Achieve List-decoding Capacity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.05256","snapshot_observed_at":"2026-08-16T05:45:51.634233Z","title":"Generic Reed-Solomon Codes Achieve List-Decoding Capacity","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":10,"source":"arxiv_source","source_observed_at":"2026-08-16T05:45:51.634233Z"},"links":{"cited_paper":"/paper/2206.05256","citing_paper":"/paper/2504.20333"},"observation_digest":"sha256:fe03949d1efd955e5318db39e9a4376023e395a306ad3baebddcf893878da055","observation_id":"a4bb01fe-348e-4271-bbcc-7712bef56586","resolution":{"observed_at":"2026-08-16T05:45:51.634233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.05256/citation-record","integrity":"/paper/2206.05256/integrity","json":"/paper/2206.05256/citation-record.json","paper":"/paper/2206.05256"},"outbound":[],"paper":{"arxiv_id":"2206.05256","last_updated":"2024-08-28T18:13:22Z","latest_version":4,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T16:53:50.312991Z","submitted_at":"2022-06-10T17:54:02Z","title":"Generic Reed-Solomon Codes Achieve List-decoding Capacity"},"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:2206.05256."}