{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WZTJXGQRVB5ALO6FJT7TB5WGWW","short_pith_number":"pith:WZTJXGQR","schema_version":"1.0","canonical_sha256":"b6669b9a11a87a05bbc54cff30f6c6b595551469725d0ca9bcf405769af716de","source":{"kind":"arxiv","id":"1106.0436","version":1},"attestation_state":"computed","paper":{"title":"Linear-algebraic list decoding of folded Reed-Solomon codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Venkatesan Guruswami","submitted_at":"2011-06-02T14:18:27Z","abstract_excerpt":"Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any $\\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\\eps)}$ time algorithm to list decode appropriate folded RS codes of rate $R$ from a fraction $1-R-\\eps$ of errors. The algorithm is based on multivariate polynomial interpolation and root-finding over extension fields. It was noted by Vadhan that interpolating a linear polynomial suffices if one settles for a smaller decoding radius (but still enough for a statement of th"},"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.0436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-02T14:18:27Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"87f282707eb2fb5f9a68c33fc1cebe0791d94f3916531b5722d0f23ef8a63cd4","abstract_canon_sha256":"dcaaf897cf29c9cbaaed983112c741cb934c0ae7b3f892f7e7f6ec4ef3b15756"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.447715Z","signature_b64":"tjiSsMTmsX9gQVaRYCIOJ5Oy5NOnHXYQJb+AZiWh50WY3lV4+KGk5TWLC186w8RBIF4A6I29he870tZsJAEEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6669b9a11a87a05bbc54cff30f6c6b595551469725d0ca9bcf405769af716de","last_reissued_at":"2026-05-18T00:58:43.447206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.447206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-algebraic list decoding of folded Reed-Solomon codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Venkatesan Guruswami","submitted_at":"2011-06-02T14:18:27Z","abstract_excerpt":"Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any $\\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\\eps)}$ time algorithm to list decode appropriate folded RS codes of rate $R$ from a fraction $1-R-\\eps$ of errors. The algorithm is based on multivariate polynomial interpolation and root-finding over extension fields. It was noted by Vadhan that interpolating a linear polynomial suffices if one settles for a smaller decoding radius (but still enough for a statement of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0436","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.0436","created_at":"2026-05-18T00:58:43.447281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.0436v1","created_at":"2026-05-18T00:58:43.447281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0436","created_at":"2026-05-18T00:58:43.447281+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZTJXGQRVB5A","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZTJXGQRVB5ALO6F","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZTJXGQR","created_at":"2026-05-18T12:26:44.992195+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/WZTJXGQRVB5ALO6FJT7TB5WGWW","json":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW.json","graph_json":"https://pith.science/api/pith-number/WZTJXGQRVB5ALO6FJT7TB5WGWW/graph.json","events_json":"https://pith.science/api/pith-number/WZTJXGQRVB5ALO6FJT7TB5WGWW/events.json","paper":"https://pith.science/paper/WZTJXGQR"},"agent_actions":{"view_html":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW","download_json":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW.json","view_paper":"https://pith.science/paper/WZTJXGQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.0436&json=true","fetch_graph":"https://pith.science/api/pith-number/WZTJXGQRVB5ALO6FJT7TB5WGWW/graph.json","fetch_events":"https://pith.science/api/pith-number/WZTJXGQRVB5ALO6FJT7TB5WGWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/action/storage_attestation","attest_author":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/action/author_attestation","sign_citation":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/action/citation_signature","submit_replication":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/action/replication_record"}},"created_at":"2026-05-18T00:58:43.447281+00:00","updated_at":"2026-05-18T00:58:43.447281+00:00"}