{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:65PW27AXDHCUQNLEK6ZJ7XX4U3","short_pith_number":"pith:65PW27AX","schema_version":"1.0","canonical_sha256":"f75f6d7c1719c548356457b29fdefca6df5efaca43cd58a1c8b6cbcf9ad8a867","source":{"kind":"arxiv","id":"1204.4209","version":1},"attestation_state":"computed","paper":{"title":"Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.AG","math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Venkatesan Guruswami","submitted_at":"2012-04-18T21:02:36Z","abstract_excerpt":"We give a new construction of algebraic codes which are efficiently list decodable from a fraction $1-R-\\eps$ of adversarial errors where $R$ is the rate of the code, for any desired positive constant $\\eps$. The worst-case list size output by the algorithm is $O(1/\\eps)$, matching the existential bound for random codes up to constant factors. Further, the alphabet size of the codes is a constant depending only on $\\eps$ - it can be made $\\exp(\\tilde{O}(1/\\eps^2))$ which is not much worse than the lower bound of $\\exp(\\Omega(1/\\eps))$. The parameters we achieve are thus quite close to the exis"},"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":"1204.4209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T21:02:36Z","cross_cats_sorted":["cs.DS","math.AG","math.IT","math.NT"],"title_canon_sha256":"a24e41d3f2a405658726c39cc781f4347fe02ab396b4525401fc007c02f139eb","abstract_canon_sha256":"57f55216978db1c6ddf0777761f387f3ccc57d8b2ee878ebd56b45d2fb76f3ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:16.174391Z","signature_b64":"iU5vrU8D6hyziegrcbo/KeUDoUMwEXACcgJZarznwF8RaDXuurnjdvNvCDv6KQPUfatMiO7Kv/bRxf6RqiZgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f75f6d7c1719c548356457b29fdefca6df5efaca43cd58a1c8b6cbcf9ad8a867","last_reissued_at":"2026-05-18T02:21:16.173752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:16.173752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.AG","math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Venkatesan Guruswami","submitted_at":"2012-04-18T21:02:36Z","abstract_excerpt":"We give a new construction of algebraic codes which are efficiently list decodable from a fraction $1-R-\\eps$ of adversarial errors where $R$ is the rate of the code, for any desired positive constant $\\eps$. The worst-case list size output by the algorithm is $O(1/\\eps)$, matching the existential bound for random codes up to constant factors. Further, the alphabet size of the codes is a constant depending only on $\\eps$ - it can be made $\\exp(\\tilde{O}(1/\\eps^2))$ which is not much worse than the lower bound of $\\exp(\\Omega(1/\\eps))$. The parameters we achieve are thus quite close to the exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4209","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":"1204.4209","created_at":"2026-05-18T02:21:16.173862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4209v1","created_at":"2026-05-18T02:21:16.173862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4209","created_at":"2026-05-18T02:21:16.173862+00:00"},{"alias_kind":"pith_short_12","alias_value":"65PW27AXDHCU","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"65PW27AXDHCUQNLE","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"65PW27AX","created_at":"2026-05-18T12:26:56.085431+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/65PW27AXDHCUQNLEK6ZJ7XX4U3","json":"https://pith.science/pith/65PW27AXDHCUQNLEK6ZJ7XX4U3.json","graph_json":"https://pith.science/api/pith-number/65PW27AXDHCUQNLEK6ZJ7XX4U3/graph.json","events_json":"https://pith.science/api/pith-number/65PW27AXDHCUQNLEK6ZJ7XX4U3/events.json","paper":"https://pith.science/paper/65PW27AX"},"agent_actions":{"view_html":"https://pith.science/pith/65PW27AXDHCUQNLEK6ZJ7XX4U3","download_json":"https://pith.science/pith/65PW27AXDHCUQNLEK6ZJ7XX4U3.json","view_paper":"https://pith.science/paper/65PW27AX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4209&json=true","fetch_graph":"https://pith.science/api/pith-number/65PW27AXDHCUQNLEK6ZJ7XX4U3/graph.json","fetch_events":"https://pith.science/api/pith-number/65PW27AXDHCUQNLEK6ZJ7XX4U3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65PW27AXDHCUQNLEK6ZJ7XX4U3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65PW27AXDHCUQNLEK6ZJ7XX4U3/action/storage_attestation","attest_author":"https://pith.science/pith/65PW27AXDHCUQNLEK6ZJ7XX4U3/action/author_attestation","sign_citation":"https://pith.science/pith/65PW27AXDHCUQNLEK6ZJ7XX4U3/action/citation_signature","submit_replication":"https://pith.science/pith/65PW27AXDHCUQNLEK6ZJ7XX4U3/action/replication_record"}},"created_at":"2026-05-18T02:21:16.173862+00:00","updated_at":"2026-05-18T02:21:16.173862+00:00"}