{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IE3CHZZ2SZKNWKUM55Q2KCK2T5","short_pith_number":"pith:IE3CHZZ2","schema_version":"1.0","canonical_sha256":"413623e73a9654db2a8cef61a5095a9f53a7864df8c3e23b8e9c252e3de909d2","source":{"kind":"arxiv","id":"1106.3951","version":1},"attestation_state":"computed","paper":{"title":"Optimal rate list decoding via derivative codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Carol Wang, Venkatesan Guruswami","submitted_at":"2011-06-20T15:51:22Z","abstract_excerpt":"The classical family of $[n,k]_q$ Reed-Solomon codes over a field $\\F_q$ consist of the evaluations of polynomials $f \\in \\F_q[X]$ of degree $< k$ at $n$ distinct field elements. In this work, we consider a closely related family of codes, called (order $m$) {\\em derivative codes} and defined over fields of large characteristic, which consist of the evaluations of $f$ as well as its first $m-1$ formal derivatives at $n$ distinct field elements. For large enough $m$, we show that these codes can be list-decoded in polynomial time from an error fraction approaching $1-R$, where $R=k/(nm)$ is the"},"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":"1106.3951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-20T15:51:22Z","cross_cats_sorted":["cs.CC","cs.DS","math.IT"],"title_canon_sha256":"df6b33e1eee42ac06301a4029e57876af18e2ab8e60c4c8224b4bb9efc0a06b2","abstract_canon_sha256":"3837a61b469c67ca96656acb186fa7f250ed9c021478637866d8614c3ea00ebf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.726255Z","signature_b64":"vzJqGuzjN0dR4uI3rmENx4bG/qOWg0XMiL9P6d+7hHlfUmVTeY2RgnwTiX2ocNqL5K9WgbnWnZ/5H7OnjPVsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"413623e73a9654db2a8cef61a5095a9f53a7864df8c3e23b8e9c252e3de909d2","last_reissued_at":"2026-05-18T02:21:43.725847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.725847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal rate list decoding via derivative codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Carol Wang, Venkatesan Guruswami","submitted_at":"2011-06-20T15:51:22Z","abstract_excerpt":"The classical family of $[n,k]_q$ Reed-Solomon codes over a field $\\F_q$ consist of the evaluations of polynomials $f \\in \\F_q[X]$ of degree $< k$ at $n$ distinct field elements. In this work, we consider a closely related family of codes, called (order $m$) {\\em derivative codes} and defined over fields of large characteristic, which consist of the evaluations of $f$ as well as its first $m-1$ formal derivatives at $n$ distinct field elements. For large enough $m$, we show that these codes can be list-decoded in polynomial time from an error fraction approaching $1-R$, where $R=k/(nm)$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3951","kind":"arxiv","version":1},"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":"1106.3951","created_at":"2026-05-18T02:21:43.725916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3951v1","created_at":"2026-05-18T02:21:43.725916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3951","created_at":"2026-05-18T02:21:43.725916+00:00"},{"alias_kind":"pith_short_12","alias_value":"IE3CHZZ2SZKN","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IE3CHZZ2SZKNWKUM","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IE3CHZZ2","created_at":"2026-05-18T12:26:30.835961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5","json":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5.json","graph_json":"https://pith.science/api/pith-number/IE3CHZZ2SZKNWKUM55Q2KCK2T5/graph.json","events_json":"https://pith.science/api/pith-number/IE3CHZZ2SZKNWKUM55Q2KCK2T5/events.json","paper":"https://pith.science/paper/IE3CHZZ2"},"agent_actions":{"view_html":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5","download_json":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5.json","view_paper":"https://pith.science/paper/IE3CHZZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3951&json=true","fetch_graph":"https://pith.science/api/pith-number/IE3CHZZ2SZKNWKUM55Q2KCK2T5/graph.json","fetch_events":"https://pith.science/api/pith-number/IE3CHZZ2SZKNWKUM55Q2KCK2T5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/action/storage_attestation","attest_author":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/action/author_attestation","sign_citation":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/action/citation_signature","submit_replication":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/action/replication_record"}},"created_at":"2026-05-18T02:21:43.725916+00:00","updated_at":"2026-05-18T02:21:43.725916+00:00"}