{"as_of":"2026-08-14T21:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:11f03b50f6add159df3c00a59c11b7467d03fa06b2f84c358ffc75acebbf708e","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-08T13:16:44.866661Z","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:46.384065Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1805.01498","last_updated":"2018-05-03T18:29:18Z","snapshot_observed_at":"2026-08-14T19:19:03.944823Z","submitted_at":"2018-05-03T18:29:18Z","title":"Improved decoding of Folded Reed-Solomon and Multiplicity Codes","version":1},"cited_work":{"arxiv_id":"1805.01498","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.01498","snapshot_observed_at":"2026-08-08T13:16:46.384065Z","title":"Improved decoding of Folded Reed-Solomon and Multiplicity Codes","venue":"cs.IT","work_id":"8f74af21-cc25-4fe6-8bf7-22f8837c12e5","year":2018},"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":45,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.866661Z"},"links":{"cited_paper":"/paper/1805.01498","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:7c5eb44b1f0abdf657e99325bd98debe5491ed7ad83c006d52b9f64deda1da1f","observation_id":"cb23c349-7e15-4a49-9cbe-d2cc937ba94c","resolution":{"observed_at":"2026-08-08T13:16:46.389171Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1805.01498","last_updated":"2018-05-03T18:29:18Z","snapshot_observed_at":"2026-08-14T19:19:03.944823Z","submitted_at":"2018-05-03T18:29:18Z","title":"Improved decoding of Folded Reed-Solomon and Multiplicity Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.01498","snapshot_observed_at":"2026-08-03T10:38:16.489671Z","title":"Improved decoding of Folded Reed-Solomon and Multiplicity Codes","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.10047","last_updated":"2026-06-10T15:41:34Z","snapshot_observed_at":"2026-08-08T08:18:37.096235Z","submitted_at":"2026-01-15T03:53:19Z","title":"Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T10:38:16.489671Z"},"links":{"cited_paper":"/paper/1805.01498","citing_paper":"/paper/2601.10047"},"observation_digest":"sha256:55c1983bb0155284e84594f26a92b6d78ec9b3ad2f5f4abfb1667de4a4a32f79","observation_id":"6dd17c79-6228-4720-baa8-8d4a9744542d","resolution":{"observed_at":"2026-08-03T10:38:16.489671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1805.01498/citation-record","integrity":"/paper/1805.01498/integrity","json":"/paper/1805.01498/citation-record.json","paper":"/paper/1805.01498"},"outbound":[],"paper":{"arxiv_id":"1805.01498","last_updated":"2018-05-03T18:29:18Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T19:19:03.944823Z","submitted_at":"2018-05-03T18:29:18Z","title":"Improved decoding of Folded Reed-Solomon and Multiplicity 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 2 inbound Pith citation observations for arXiv:1805.01498."}