{"as_of":"2026-08-14T23:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9575bab73b7beac640eb334809ad15af8600ae2b3a46449255105cc731fe0eb8","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T17:54:42.174754Z","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-08T17:54:42.233218Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.11533","last_updated":"2024-05-15T14:32:09Z","snapshot_observed_at":"2026-08-14T19:15:22.385719Z","submitted_at":"2024-02-18T10:11:46Z","title":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","version":2},"cited_work":{"arxiv_id":"2402.11533","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.11533","snapshot_observed_at":"2026-08-08T17:54:42.233218Z","title":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes","venue":"cs.IT","work_id":"0ff4287f-8bc0-4f51-8d74-14592ce41364","year":2024},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.174754Z"},"links":{"cited_paper":"/paper/2402.11533","citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:e5486370bf44c23500913e3f07a258ec90f040b8f71255d959c8468d5ec95729","observation_id":"93339f28-b46e-4ceb-9bd5-7230c664c436","resolution":{"observed_at":"2026-08-08T17:54:42.237222Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.11533/citation-record","integrity":"/paper/2402.11533/integrity","json":"/paper/2402.11533/citation-record.json","paper":"/paper/2402.11533"},"outbound":[],"paper":{"arxiv_id":"2402.11533","last_updated":"2024-05-15T14:32:09Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T19:15:22.385719Z","submitted_at":"2024-02-18T10:11:46Z","title":"Randomness-Efficient Constructions of Capacity-Achieving List-Decodable 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2402.11533."}