{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4M554IU5UIPSTT7HVMVDYGX3EP","short_pith_number":"pith:4M554IU5","schema_version":"1.0","canonical_sha256":"e33bde229da21f29cfe7ab2a3c1afb23c0dc6d21900acd14ecd8d33cdb6ea51f","source":{"kind":"arxiv","id":"1412.0305","version":2},"attestation_state":"computed","paper":{"title":"List-decoding algorithms for lifted codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alan Guo, Swastik Kopparty","submitted_at":"2014-11-30T23:29:17Z","abstract_excerpt":"Lifted Reed-Solomon codes are a natural affine-invariant family of error-correcting codes which generalize Reed-Muller codes. They were known to have efficient local-testing and local-decoding algorithms (comparable to the known algorithms for Reed-Muller codes), but with significantly better rate. We give efficient algorithms for list-decoding and local list-decoding of lifted codes. Our algorithms are based on a new technical lemma, which says that codewords of lifted codes are low degree polynomials when viewed as univariate polynomials over a big field (even though they may be very high de"},"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":"1412.0305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-30T23:29:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"55526c75ed6d3d63fb2d4c1f1c5182ad185d995415be68f328479c2e51cefc27","abstract_canon_sha256":"7ce820a0e8e8aca4dcbe417ac623dbdd3aacde0b5793b49dd7462b09799d2da5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:31.594499Z","signature_b64":"8c2Ez/4PiTkm19XLZnoFR1NlkFtXD7Z0sjuNx8gcSTNh3Dkvp1eQn9oo/59lFTrinN3c2OXCyp/4Xz7/ExVlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e33bde229da21f29cfe7ab2a3c1afb23c0dc6d21900acd14ecd8d33cdb6ea51f","last_reissued_at":"2026-05-18T00:38:31.594054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:31.594054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List-decoding algorithms for lifted codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alan Guo, Swastik Kopparty","submitted_at":"2014-11-30T23:29:17Z","abstract_excerpt":"Lifted Reed-Solomon codes are a natural affine-invariant family of error-correcting codes which generalize Reed-Muller codes. They were known to have efficient local-testing and local-decoding algorithms (comparable to the known algorithms for Reed-Muller codes), but with significantly better rate. We give efficient algorithms for list-decoding and local list-decoding of lifted codes. Our algorithms are based on a new technical lemma, which says that codewords of lifted codes are low degree polynomials when viewed as univariate polynomials over a big field (even though they may be very high de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0305","kind":"arxiv","version":2},"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":"1412.0305","created_at":"2026-05-18T00:38:31.594120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0305v2","created_at":"2026-05-18T00:38:31.594120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0305","created_at":"2026-05-18T00:38:31.594120+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M554IU5UIPS","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M554IU5UIPSTT7H","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M554IU5","created_at":"2026-05-18T12:28:14.216126+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/4M554IU5UIPSTT7HVMVDYGX3EP","json":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP.json","graph_json":"https://pith.science/api/pith-number/4M554IU5UIPSTT7HVMVDYGX3EP/graph.json","events_json":"https://pith.science/api/pith-number/4M554IU5UIPSTT7HVMVDYGX3EP/events.json","paper":"https://pith.science/paper/4M554IU5"},"agent_actions":{"view_html":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP","download_json":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP.json","view_paper":"https://pith.science/paper/4M554IU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0305&json=true","fetch_graph":"https://pith.science/api/pith-number/4M554IU5UIPSTT7HVMVDYGX3EP/graph.json","fetch_events":"https://pith.science/api/pith-number/4M554IU5UIPSTT7HVMVDYGX3EP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP/action/storage_attestation","attest_author":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP/action/author_attestation","sign_citation":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP/action/citation_signature","submit_replication":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP/action/replication_record"}},"created_at":"2026-05-18T00:38:31.594120+00:00","updated_at":"2026-05-18T00:38:31.594120+00:00"}