{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5XED4ITIPSC5QBTLTL42LVCEE7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"37fe3a17e93b8d9ea9456f80b1f7aca6a3b68e1095fed74cee4cdce9dd58e5e5","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2023-11-29T17:46:17Z","title_canon_sha256":"36270bec87e7d84e9f4f553b54509dce5560f966f3ab24d253371aaaa5241fe0"},"schema_version":"1.0","source":{"id":"2311.17841","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.17841","created_at":"2026-07-05T07:55:13Z"},{"alias_kind":"arxiv_version","alias_value":"2311.17841v4","created_at":"2026-07-05T07:55:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.17841","created_at":"2026-07-05T07:55:13Z"},{"alias_kind":"pith_short_12","alias_value":"5XED4ITIPSC5","created_at":"2026-07-05T07:55:13Z"},{"alias_kind":"pith_short_16","alias_value":"5XED4ITIPSC5QBTL","created_at":"2026-07-05T07:55:13Z"},{"alias_kind":"pith_short_8","alias_value":"5XED4ITI","created_at":"2026-07-05T07:55:13Z"}],"graph_snapshots":[{"event_id":"sha256:c44b3d198d84c692619107355bb209c6d4df89b792c0b2dc91c4f446e01717b4","target":"graph","created_at":"2026-07-05T07:55:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.17841/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)","authors_text":"Ashutosh Shankar, Mrinal Kumar, Prahladh Harsha, Rohan Goyal","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2023-11-29T17:46:17Z","title":"Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.17841","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:080e71eb010b4b8b5d99886f72b297072408a000267b9167122d69412eb7c5b9","target":"record","created_at":"2026-07-05T07:55:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"37fe3a17e93b8d9ea9456f80b1f7aca6a3b68e1095fed74cee4cdce9dd58e5e5","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2023-11-29T17:46:17Z","title_canon_sha256":"36270bec87e7d84e9f4f553b54509dce5560f966f3ab24d253371aaaa5241fe0"},"schema_version":"1.0","source":{"id":"2311.17841","kind":"arxiv","version":4}},"canonical_sha256":"edc83e22687c85d8066b9af9a5d44427f87ee1d736266db398334827195044d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edc83e22687c85d8066b9af9a5d44427f87ee1d736266db398334827195044d4","first_computed_at":"2026-07-05T07:55:13.805005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:55:13.805005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ygjjOa0X4S50pWkcZr4XppKz6rT3tNk+pZrfEuwB6NA4h+3Obdn/1cw2HEmRzlF21xfmceuPH5DoKvDTgwVBBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:55:13.805475Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.17841","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:080e71eb010b4b8b5d99886f72b297072408a000267b9167122d69412eb7c5b9","sha256:c44b3d198d84c692619107355bb209c6d4df89b792c0b2dc91c4f446e01717b4"],"state_sha256":"ea2ef0e70d9d51935aebeeb46982912519078dae26e27653459e29895f88924b"}