{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IMJVQH44NWT4IAOFQQITXXW3F6","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":"6a5c1a61c2483bc3a25ebfab625558a581cbbfa2a28e1a61f47e6b42ffa2373f","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-11-06T07:23:12Z","title_canon_sha256":"1b5e8ae54908d745f463a5013c6977720f286fe8ad42d58c86641fd13bbd0707"},"schema_version":"1.0","source":{"id":"2511.04135","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.04135","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"2511.04135v2","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.04135","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"IMJVQH44NWT4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IMJVQH44NWT4IAOF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IMJVQH44","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:344a9dc67c77baf012f4c0256f527ab26a1b77570ef934ca42eb8646dea730ae","target":"graph","created_at":"2026-05-18T03:09:33Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We first extend the list decoding procedure of Guruswami and Sudan to Reed-Solomon codes over Galois rings, which shows that RS codes with rate r can be list decoded up to radius 1−√r."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The algebraic properties of Galois rings (in particular their module structure and root-finding behavior) permit the same interpolation and factorization steps used over fields to succeed with identical radius guarantees."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Extends list decoding of Reed-Solomon and folded Reed-Solomon codes to Galois rings, achieving radius 1-sqrt(r) and Singleton-bound performance with list size O(1/ε²)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Reed-Solomon codes over Galois rings can be list decoded up to radius 1 minus the square root of their rate."}],"snapshot_sha256":"42c18ea2237ce1acfe3f7115ab86292dfada8eb85a5111617130a170d00d36eb"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c692bc798c1868df3fa220fd30326e4117da2dda76c10989a499ee6f38285369"},"paper":{"abstract_excerpt":"List decoding of codes can be seen as the generalization of unique decoding of codes While list decoding over finite fields has been extensively studied, extending these results to more general algebraic structures such as Galois rings remains an important challenge. Due to recent progress in zero knowledge systems, there is a growing demand to investigate the proximity gap of codes over Galois rings in Yizhou Yao and coauthors(2025), Alexander Golovne and coauthors(2023), Yuanju Wei and coauthors(2025). The proximity gap is closely related to the decoding capability of codes. It was shown in ","authors_text":"Chen Yuan, Ruiqi Zhu","cross_cats":["cs.CR","math.IT"],"headline":"Reed-Solomon codes over Galois rings can be list decoded up to radius 1 minus the square root of their rate.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-11-06T07:23:12Z","title":"List Decoding of Reed-Solomon Codes and Folded Reed-Solomon Codes Over Galois Ring"},"references":{"count":5,"internal_anchors":0,"resolved_work":5,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Proximity gaps for reed-solomon codes","work_id":"0b29d68e-12a4-4b7d-9561-aaeb79e19bf4","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Fast reed- solomon interactive oracle proofs of proximity","work_id":"1306394c-0f98-47a4-8caa-1a4748ea3cac","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"[GLS+23] Alexander Golovnev, Jonathan Lee, Srinath T. V. Setty, Justin Thaler, and Riad S. Wahby. Brakedown: Linear-time and field-agnostic snarks for R1CS. In Helena Handschuh and Anna Lysyanskaya, e","work_id":"b969c5f2-a339-46ef-8f04-d3d89ce7d281","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Poly- nomial commitments for galois rings and applications to snarks overZ2k","work_id":"e0844e48-91be-438d-9dc5-7684447c2884","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Improved list size for folded reed-solomon codes","work_id":"521d29e4-1ee6-4224-897d-bb2e385e0ff2","year":2025}],"snapshot_sha256":"06d6f8e91850cf39bfd16079b6078858aaa97cedd003964148233fedf8d3f4e2"},"source":{"id":"2511.04135","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-18T01:24:28.782543Z","id":"c372044d-06c2-4dfc-99e7-cd073c8f312b","model_set":{"reader":"grok-4.3"},"one_line_summary":"Extends list decoding of Reed-Solomon and folded Reed-Solomon codes to Galois rings, achieving radius 1-sqrt(r) and Singleton-bound performance with list size O(1/ε²).","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Reed-Solomon codes over Galois rings can be list decoded up to radius 1 minus the square root of their rate.","strongest_claim":"We first extend the list decoding procedure of Guruswami and Sudan to Reed-Solomon codes over Galois rings, which shows that RS codes with rate r can be list decoded up to radius 1−√r.","weakest_assumption":"The algebraic properties of Galois rings (in particular their module structure and root-finding behavior) permit the same interpolation and factorization steps used over fields to succeed with identical radius guarantees."}},"verdict_id":"c372044d-06c2-4dfc-99e7-cd073c8f312b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:80f98010360b08a2439b5fe297d35a53ec36624081d9fbf11b903248b3e154ab","target":"record","created_at":"2026-05-18T03:09:33Z","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":"6a5c1a61c2483bc3a25ebfab625558a581cbbfa2a28e1a61f47e6b42ffa2373f","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-11-06T07:23:12Z","title_canon_sha256":"1b5e8ae54908d745f463a5013c6977720f286fe8ad42d58c86641fd13bbd0707"},"schema_version":"1.0","source":{"id":"2511.04135","kind":"arxiv","version":2}},"canonical_sha256":"4313581f9c6da7c401c584113bdedb2f884612632abd205aab7b7fcc6542754e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4313581f9c6da7c401c584113bdedb2f884612632abd205aab7b7fcc6542754e","first_computed_at":"2026-05-18T03:09:33.538706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:33.538706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yMc/VVUNeADAX7x3yLQbeFrkB191WsViViGos5B4l9yMX7+M7VoUtnbm2srijykts6nhpDWsDQggOBNGS9AeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:33.539566Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.04135","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80f98010360b08a2439b5fe297d35a53ec36624081d9fbf11b903248b3e154ab","sha256:344a9dc67c77baf012f4c0256f527ab26a1b77570ef934ca42eb8646dea730ae"],"state_sha256":"e8d11a133b5262c76e7e217780925d8e67197d75300634c46607cf8ed5fce1cb"}