{"as_of":"2026-08-18T04:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:61340b0a05cd1797719b7ee6c238d898de98a3a9fc6469f5f835016670b481f2","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:07:01.044420Z","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.523659Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.15925","last_updated":"2025-04-14T04:26:07Z","snapshot_observed_at":"2026-08-16T13:23:09.380059Z","submitted_at":"2024-08-28T16:39:58Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15925","snapshot_observed_at":"2026-08-08T17:54:42.151739Z","title":"High-Probability Lis t-Recovery, and Applica- tions to Heavy Hitters","venue":null,"work_id":null,"year":null},"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":2024,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.151739Z"},"links":{"cited_paper":"/paper/2408.15925","citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:c74e69cd058a2f0c63e90defbe6b55c221de043f6ed288114918c803bedc6c6b","observation_id":"67930a5c-c08f-4b87-8e9e-b9088da619ee","resolution":{"observed_at":"2026-08-08T17:54:42.151739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15925","last_updated":"2025-04-14T04:26:07Z","snapshot_observed_at":"2026-08-16T13:23:09.380059Z","submitted_at":"2024-08-28T16:39:58Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds","version":3},"cited_work":{"arxiv_id":"2408.15925","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.15925","snapshot_observed_at":"2026-08-08T13:16:48.523659Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds","venue":"cs.IT","work_id":"2963001e-9c1a-4ef2-a0e4-709375cb2c6e","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":14,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.734524Z"},"links":{"cited_paper":"/paper/2408.15925","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:00d3f28b7cac8f10e65b4b9346f6de1c3255823f6f0353d2e4d3be34a830aa4c","observation_id":"2e0760f5-9400-40ca-ab59-39680d75a54a","resolution":{"observed_at":"2026-08-08T13:16:48.529834Z","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":"2408.15925","last_updated":"2025-04-14T04:26:07Z","snapshot_observed_at":"2026-08-16T13:23:09.380059Z","submitted_at":"2024-08-28T16:39:58Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15925","snapshot_observed_at":"2026-08-15T23:07:01.044420Z","title":"Explicit folded Reed-Solomon and multiplicity codes achieve relaxed generalized Singleton bounds, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.05935","last_updated":"2025-05-09T10:26:12Z","snapshot_observed_at":"2026-08-17T05:01:02.807040Z","submitted_at":"2025-05-09T10:26:12Z","title":"List-Recovery of Random Linear Codes over Small Fields","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.044420Z"},"links":{"cited_paper":"/paper/2408.15925","citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:ac21e25173302e1f8c2de2c45dbe31d55e696594f09ba8dd6a36aaf71fac7ede","observation_id":"dcb622d1-7dc9-4220-bd86-8520a492812f","resolution":{"observed_at":"2026-08-15T23:07:01.044420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15925","last_updated":"2025-04-14T04:26:07Z","snapshot_observed_at":"2026-08-16T13:23:09.380059Z","submitted_at":"2024-08-28T16:39:58Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15925","snapshot_observed_at":"2026-08-15T19:58:05.917595Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.15233","last_updated":"2025-06-18T08:17:28Z","snapshot_observed_at":"2026-08-17T11:47:21.651080Z","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:05.917595Z"},"links":{"cited_paper":"/paper/2408.15925","citing_paper":"/paper/2506.15233"},"observation_digest":"sha256:e1d5ca168e138bafcf2d110b33c5c3bea6b75ec542ed1ca70a9c0186a8fbc799","observation_id":"ce37de69-9191-45df-890e-d87c9101d31e","resolution":{"observed_at":"2026-08-15T19:58:05.917595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.15925/citation-record","integrity":"/paper/2408.15925/integrity","json":"/paper/2408.15925/citation-record.json","paper":"/paper/2408.15925"},"outbound":[],"paper":{"arxiv_id":"2408.15925","last_updated":"2025-04-14T04:26:07Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T13:23:09.380059Z","submitted_at":"2024-08-28T16:39:58Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds"},"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 4 inbound Pith citation observations for arXiv:2408.15925."}