{"as_of":"2026-08-18T02:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a82304a1b9b0b59a18931625fb28c27da3b094a61f22563c694e5fcf8bf948f","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-17T06:30:58.91139+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-08T13:16:44.778423Z","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:47.873563Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.04453","last_updated":"2023-12-26T15:10:23Z","snapshot_observed_at":"2026-08-16T19:07:10.832363Z","submitted_at":"2020-11-09T14:22:37Z","title":"Improved List-Decodability of Reed--Solomon Codes via Tree Packings","version":2},"cited_work":{"arxiv_id":"2011.04453","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.04453","snapshot_observed_at":"2026-08-08T13:16:47.873563Z","title":"Improved List-Decodability of Reed--Solomon Codes via Tree Packings","venue":"cs.IT","work_id":"8dce8670-af1c-43a2-a630-d397d994428d","year":2020},"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":24,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.778423Z"},"links":{"cited_paper":"/paper/2011.04453","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:f25f8473f66655b98c0b24ce9bab71d4ae513c8b6ee3cbc1103bd920e825d2b3","observation_id":"2d6e05cc-62b1-47a1-9912-5eebe45e97cd","resolution":{"observed_at":"2026-08-08T13:16:47.878706Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2011.04453/citation-record","integrity":"/paper/2011.04453/integrity","json":"/paper/2011.04453/citation-record.json","paper":"/paper/2011.04453"},"outbound":[],"paper":{"arxiv_id":"2011.04453","last_updated":"2023-12-26T15:10:23Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T19:07:10.832363Z","submitted_at":"2020-11-09T14:22:37Z","title":"Improved List-Decodability of Reed--Solomon Codes via Tree Packings"},"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 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2011.04453."}