{"as_of":"2026-08-14T17:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:754be26d08755baf21fd96d261f917aadeae05468f370635555e96846c235b0c","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-14T06:32:32.682623+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-12T13:11:50.844098Z","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.614825Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.15034","last_updated":"2024-01-26T17:53:34Z","snapshot_observed_at":"2026-08-14T01:42:19.916021Z","submitted_at":"2024-01-26T17:53:34Z","title":"Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15034","snapshot_observed_at":"2026-08-12T13:11:50.844098Z","title":"Explicit subcodes of reed-solomon codes that efficiently achieve list decoding capacity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16596","last_updated":"2025-05-28T16:26:39Z","snapshot_observed_at":"2026-08-14T06:48:47.892558Z","submitted_at":"2024-11-25T17:29:17Z","title":"Bivariate Linear Operator Codes","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T13:11:50.844098Z"},"links":{"cited_paper":"/paper/2401.15034","citing_paper":"/paper/2411.16596"},"observation_digest":"sha256:b272907f967447136bc1b764615e3fac98df57fa58e31711301ac46fbb231be7","observation_id":"39e08599-32a1-4794-9f20-ae64ab25ab6f","resolution":{"observed_at":"2026-08-12T13:11:50.844098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15034","last_updated":"2024-01-26T17:53:34Z","snapshot_observed_at":"2026-08-14T01:42:19.916021Z","submitted_at":"2024-01-26T17:53:34Z","title":"Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity","version":1},"cited_work":{"arxiv_id":"2401.15034","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.15034","snapshot_observed_at":"2026-08-08T13:16:48.614825Z","title":"Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity","venue":"cs.IT","work_id":"74b7be0a-6596-4aca-9505-68c8962ab1bf","year":2024},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.725998Z"},"links":{"cited_paper":"/paper/2401.15034","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:257e239a03a40614f6ea45612eabfe3816232fffa7d113b1a8b6ec957ee7172a","observation_id":"bbed455f-a836-4a95-9972-68b8be2bfc30","resolution":{"observed_at":"2026-08-08T13:16:48.621320Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/2401.15034/citation-record","integrity":"/paper/2401.15034/integrity","json":"/paper/2401.15034/citation-record.json","paper":"/paper/2401.15034"},"outbound":[],"paper":{"arxiv_id":"2401.15034","last_updated":"2024-01-26T17:53:34Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T01:42:19.916021Z","submitted_at":"2024-01-26T17:53:34Z","title":"Explicit Subcodes of Reed-Solomon Codes that Efficiently 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-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 2 inbound Pith citation observations for arXiv:2401.15034."}