{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JRZER62QRD6IXEYKA2DYHKM6KE","short_pith_number":"pith:JRZER62Q","schema_version":"1.0","canonical_sha256":"4c7248fb5088fc8b930a068783a99e510822ea9459105d566ac86d16976133c9","source":{"kind":"arxiv","id":"2504.10399","version":3},"attestation_state":"computed","paper":{"title":"Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Joshua Brakensiek, Manik Dhar, Yeyuan Chen, Zihan Zhang","submitted_at":"2025-04-14T16:49:45Z","abstract_excerpt":"Motivated by recent developments in coding theory, particular in list-decoding, we introduce a new error model which we call semi-adversarial errors. This error model bridges between fully random errors and fully adversarial errors by allowing some symbols of a message to be corrupted by an adversary while others are replaced with uniformly random symbols.\n  As our main quest, we seek to understand optimal efficient unique decoding algorithms in the semi-adversarial model. For interleaved Reed--Solomon (IRS), folded Reed--Solomon (FRS) and univariate multiplicity codes, we design decoding algo"},"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":"2504.10399","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-14T16:49:45Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"4ef884275f331192bf91c0e208b174cb832417e1aff173a5fb4200fbec019d4f","abstract_canon_sha256":"cfef24c6f80e051416b3615f1e4a55cd55d323634ec553c1786aba0e8bf0171e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.772476Z","signature_b64":"KTKz3+UbFn4dSpV6+IgHRj/tQNLnBmkRSWnXo3pPIiN1yWh/bbpGlc/8Y9n6LBPL/0DEJZ7779nXpUKQxBZkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c7248fb5088fc8b930a068783a99e510822ea9459105d566ac86d16976133c9","last_reissued_at":"2026-05-18T03:10:12.771612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.771612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Joshua Brakensiek, Manik Dhar, Yeyuan Chen, Zihan Zhang","submitted_at":"2025-04-14T16:49:45Z","abstract_excerpt":"Motivated by recent developments in coding theory, particular in list-decoding, we introduce a new error model which we call semi-adversarial errors. This error model bridges between fully random errors and fully adversarial errors by allowing some symbols of a message to be corrupted by an adversary while others are replaced with uniformly random symbols.\n  As our main quest, we seek to understand optimal efficient unique decoding algorithms in the semi-adversarial model. For interleaved Reed--Solomon (IRS), folded Reed--Solomon (FRS) and univariate multiplicity codes, we design decoding algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10399","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"2504.10399","created_at":"2026-05-18T03:10:12.771738+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.10399v3","created_at":"2026-05-18T03:10:12.771738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10399","created_at":"2026-05-18T03:10:12.771738+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRZER62QRD6I","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRZER62QRD6IXEYK","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRZER62Q","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.05284","citing_title":"Simultaneous Rational Function Codes: Improved Analysis Beyond Half the Minimum Distance with Multiplicities and Poles","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JRZER62QRD6IXEYKA2DYHKM6KE","json":"https://pith.science/pith/JRZER62QRD6IXEYKA2DYHKM6KE.json","graph_json":"https://pith.science/api/pith-number/JRZER62QRD6IXEYKA2DYHKM6KE/graph.json","events_json":"https://pith.science/api/pith-number/JRZER62QRD6IXEYKA2DYHKM6KE/events.json","paper":"https://pith.science/paper/JRZER62Q"},"agent_actions":{"view_html":"https://pith.science/pith/JRZER62QRD6IXEYKA2DYHKM6KE","download_json":"https://pith.science/pith/JRZER62QRD6IXEYKA2DYHKM6KE.json","view_paper":"https://pith.science/paper/JRZER62Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.10399&json=true","fetch_graph":"https://pith.science/api/pith-number/JRZER62QRD6IXEYKA2DYHKM6KE/graph.json","fetch_events":"https://pith.science/api/pith-number/JRZER62QRD6IXEYKA2DYHKM6KE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRZER62QRD6IXEYKA2DYHKM6KE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRZER62QRD6IXEYKA2DYHKM6KE/action/storage_attestation","attest_author":"https://pith.science/pith/JRZER62QRD6IXEYKA2DYHKM6KE/action/author_attestation","sign_citation":"https://pith.science/pith/JRZER62QRD6IXEYKA2DYHKM6KE/action/citation_signature","submit_replication":"https://pith.science/pith/JRZER62QRD6IXEYKA2DYHKM6KE/action/replication_record"}},"created_at":"2026-05-18T03:10:12.771738+00:00","updated_at":"2026-05-18T03:10:12.771738+00:00"}