{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5XED4ITIPSC5QBTLTL42LVCEE7","short_pith_number":"pith:5XED4ITI","schema_version":"1.0","canonical_sha256":"edc83e22687c85d8066b9af9a5d44427f87ee1d736266db398334827195044d4","source":{"kind":"arxiv","id":"2311.17841","version":4},"attestation_state":"computed","paper":{"title":"Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ashutosh Shankar, Mrinal Kumar, Prahladh Harsha, Rohan Goyal","submitted_at":"2023-11-29T17:46:17Z","abstract_excerpt":"We show that the known list-decoding algorithms for univariate multiplicity and folded Reed-Solomon codes can be made to run in $\\tilde{O}(n)$ time. Univariate multiplicity codes and FRS codes are natural variants of Reed-Solomon codes that were discovered and studied for their applications to list decoding. It is known that for every $\\epsilon>0$, and rate $r \\in (0,1)$, there exist explicit families of these codes that have rate $r$ and can be list decoded from a $(1-r-\\epsilon)$ fraction of errors with constant list size in polynomial time (Guruswami & Wang (IEEE Trans. Inform. Theory 2013)"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2311.17841","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2023-11-29T17:46:17Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"36270bec87e7d84e9f4f553b54509dce5560f966f3ab24d253371aaaa5241fe0","abstract_canon_sha256":"37fe3a17e93b8d9ea9456f80b1f7aca6a3b68e1095fed74cee4cdce9dd58e5e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:13.805475Z","signature_b64":"ygjjOa0X4S50pWkcZr4XppKz6rT3tNk+pZrfEuwB6NA4h+3Obdn/1cw2HEmRzlF21xfmceuPH5DoKvDTgwVBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edc83e22687c85d8066b9af9a5d44427f87ee1d736266db398334827195044d4","last_reissued_at":"2026-07-05T07:55:13.805005Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:13.805005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ashutosh Shankar, Mrinal Kumar, Prahladh Harsha, Rohan Goyal","submitted_at":"2023-11-29T17:46:17Z","abstract_excerpt":"We show that the known list-decoding algorithms for univariate multiplicity and folded Reed-Solomon codes can be made to run in $\\tilde{O}(n)$ time. Univariate multiplicity codes and FRS codes are natural variants of Reed-Solomon codes that were discovered and studied for their applications to list decoding. It is known that for every $\\epsilon>0$, and rate $r \\in (0,1)$, there exist explicit families of these codes that have rate $r$ and can be list decoded from a $(1-r-\\epsilon)$ fraction of errors with constant list size in polynomial time (Guruswami & Wang (IEEE Trans. Inform. Theory 2013)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.17841","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.17841/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.17841","created_at":"2026-07-05T07:55:13.805064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.17841v4","created_at":"2026-07-05T07:55:13.805064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.17841","created_at":"2026-07-05T07:55:13.805064+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XED4ITIPSC5","created_at":"2026-07-05T07:55:13.805064+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XED4ITIPSC5QBTL","created_at":"2026-07-05T07:55:13.805064+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XED4ITI","created_at":"2026-07-05T07:55:13.805064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.20333","citing_title":"List Decoding Expander-Based Codes up to Capacity in Near-Linear Time","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5XED4ITIPSC5QBTLTL42LVCEE7","json":"https://pith.science/pith/5XED4ITIPSC5QBTLTL42LVCEE7.json","graph_json":"https://pith.science/api/pith-number/5XED4ITIPSC5QBTLTL42LVCEE7/graph.json","events_json":"https://pith.science/api/pith-number/5XED4ITIPSC5QBTLTL42LVCEE7/events.json","paper":"https://pith.science/paper/5XED4ITI"},"agent_actions":{"view_html":"https://pith.science/pith/5XED4ITIPSC5QBTLTL42LVCEE7","download_json":"https://pith.science/pith/5XED4ITIPSC5QBTLTL42LVCEE7.json","view_paper":"https://pith.science/paper/5XED4ITI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.17841&json=true","fetch_graph":"https://pith.science/api/pith-number/5XED4ITIPSC5QBTLTL42LVCEE7/graph.json","fetch_events":"https://pith.science/api/pith-number/5XED4ITIPSC5QBTLTL42LVCEE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XED4ITIPSC5QBTLTL42LVCEE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XED4ITIPSC5QBTLTL42LVCEE7/action/storage_attestation","attest_author":"https://pith.science/pith/5XED4ITIPSC5QBTLTL42LVCEE7/action/author_attestation","sign_citation":"https://pith.science/pith/5XED4ITIPSC5QBTLTL42LVCEE7/action/citation_signature","submit_replication":"https://pith.science/pith/5XED4ITIPSC5QBTLTL42LVCEE7/action/replication_record"}},"created_at":"2026-07-05T07:55:13.805064+00:00","updated_at":"2026-07-05T07:55:13.805064+00:00"}