{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NOK3RQW72ZI2S5Q3ZAE5DHSTLG","short_pith_number":"pith:NOK3RQW7","schema_version":"1.0","canonical_sha256":"6b95b8c2dfd651a9761bc809d19e535982141e8342a522a2b76ab8d14b0f906d","source":{"kind":"arxiv","id":"1110.3898","version":1},"attestation_state":"computed","paper":{"title":"An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh (INRIA Saclay - Ile de France), Christian Gentner (DLR), Daniel Augot (INRIA Saclay - Ile de France)","submitted_at":"2011-10-18T07:45:01Z","abstract_excerpt":"The key step of syndrome-based decoding of Reed-Solomon codes up to half the minimum distance is to solve the so-called Key Equation. List decoding algorithms, capable of decoding beyond half the minimum distance, are based on interpolation and factorization of multivariate polynomials. This article provides a link between syndrome-based decoding approaches based on Key Equations and the interpolation-based list decoding algorithms of Guruswami and Sudan for Reed-Solomon codes. The original interpolation conditions of Guruswami and Sudan for Reed-Solomon codes are reformulated in terms of a se"},"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":"1110.3898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T07:45:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4015e8c2dd0c3c27509555f754d4cb96c6315318f984a382eeee2d2d158f42f6","abstract_canon_sha256":"f9bb3108ed6b942285f877aa965f20a495326761e6ffafb6e6af0dc05752874d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:46.733709Z","signature_b64":"D/zcVYjBHHsvS8Sv27pidkp/AzgwZIBsqbEIFlS+5ybpWg+CZzGPWPJe1aan5/GgO6sq9Q6OBcDk/h6xB9QhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b95b8c2dfd651a9761bc809d19e535982141e8342a522a2b76ab8d14b0f906d","last_reissued_at":"2026-05-18T04:10:46.733264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:46.733264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh (INRIA Saclay - Ile de France), Christian Gentner (DLR), Daniel Augot (INRIA Saclay - Ile de France)","submitted_at":"2011-10-18T07:45:01Z","abstract_excerpt":"The key step of syndrome-based decoding of Reed-Solomon codes up to half the minimum distance is to solve the so-called Key Equation. List decoding algorithms, capable of decoding beyond half the minimum distance, are based on interpolation and factorization of multivariate polynomials. This article provides a link between syndrome-based decoding approaches based on Key Equations and the interpolation-based list decoding algorithms of Guruswami and Sudan for Reed-Solomon codes. The original interpolation conditions of Guruswami and Sudan for Reed-Solomon codes are reformulated in terms of a se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3898","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":"1110.3898","created_at":"2026-05-18T04:10:46.733327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3898v1","created_at":"2026-05-18T04:10:46.733327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3898","created_at":"2026-05-18T04:10:46.733327+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOK3RQW72ZI2","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOK3RQW72ZI2S5Q3","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOK3RQW7","created_at":"2026-05-18T12:26:37.096874+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/NOK3RQW72ZI2S5Q3ZAE5DHSTLG","json":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG.json","graph_json":"https://pith.science/api/pith-number/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/graph.json","events_json":"https://pith.science/api/pith-number/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/events.json","paper":"https://pith.science/paper/NOK3RQW7"},"agent_actions":{"view_html":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG","download_json":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG.json","view_paper":"https://pith.science/paper/NOK3RQW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3898&json=true","fetch_graph":"https://pith.science/api/pith-number/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/graph.json","fetch_events":"https://pith.science/api/pith-number/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/action/storage_attestation","attest_author":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/action/author_attestation","sign_citation":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/action/citation_signature","submit_replication":"https://pith.science/pith/NOK3RQW72ZI2S5Q3ZAE5DHSTLG/action/replication_record"}},"created_at":"2026-05-18T04:10:46.733327+00:00","updated_at":"2026-05-18T04:10:46.733327+00:00"}