{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4M554IU5UIPSTT7HVMVDYGX3EP","short_pith_number":"pith:4M554IU5","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"},"canonical_sha256":"e33bde229da21f29cfe7ab2a3c1afb23c0dc6d21900acd14ecd8d33cdb6ea51f","source":{"kind":"arxiv","id":"1412.0305","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0305","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0305v2","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0305","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"pith_short_12","alias_value":"4M554IU5UIPS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4M554IU5UIPSTT7H","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4M554IU5","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4M554IU5UIPSTT7HVMVDYGX3EP","target":"record","payload":{"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"},"canonical_sha256":"e33bde229da21f29cfe7ab2a3c1afb23c0dc6d21900acd14ecd8d33cdb6ea51f","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"},"source_kind":"arxiv","source_id":"1412.0305","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GENI1gsJ1IT/sg0oQxegP4MVOq9fkYFbj5aU8y++wqCCJT7yHDMI4Ndmymma2p1+4365xoqxi7E8t2AeVoYNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:12:32.313719Z"},"content_sha256":"07020b5abfb40d6957a493e0edf92f8b543ef15ef86023daf1c8826c68feaee1","schema_version":"1.0","event_id":"sha256:07020b5abfb40d6957a493e0edf92f8b543ef15ef86023daf1c8826c68feaee1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4M554IU5UIPSTT7HVMVDYGX3EP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieDREN5ZxfPlrFssbdkUcYp/0qWxJADArh5qL+bQgvYR0I/27cORbAFpOF6DkEcMzwwIz3KfR4PbX2/UEAeJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:12:32.314069Z"},"content_sha256":"befe9814220c2597412cc3cc022cd76961030a2d62dde46e41cf24ebd39aa805","schema_version":"1.0","event_id":"sha256:befe9814220c2597412cc3cc022cd76961030a2d62dde46e41cf24ebd39aa805"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP/bundle.json","state_url":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4M554IU5UIPSTT7HVMVDYGX3EP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T01:12:32Z","links":{"resolver":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP","bundle":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP/bundle.json","state":"https://pith.science/pith/4M554IU5UIPSTT7HVMVDYGX3EP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4M554IU5UIPSTT7HVMVDYGX3EP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4M554IU5UIPSTT7HVMVDYGX3EP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7ce820a0e8e8aca4dcbe417ac623dbdd3aacde0b5793b49dd7462b09799d2da5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-30T23:29:17Z","title_canon_sha256":"55526c75ed6d3d63fb2d4c1f1c5182ad185d995415be68f328479c2e51cefc27"},"schema_version":"1.0","source":{"id":"1412.0305","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0305","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0305v2","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0305","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"pith_short_12","alias_value":"4M554IU5UIPS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4M554IU5UIPSTT7H","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4M554IU5","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:befe9814220c2597412cc3cc022cd76961030a2d62dde46e41cf24ebd39aa805","target":"graph","created_at":"2026-05-18T00:38:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alan Guo, Swastik Kopparty","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-30T23:29:17Z","title":"List-decoding algorithms for lifted codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0305","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:07020b5abfb40d6957a493e0edf92f8b543ef15ef86023daf1c8826c68feaee1","target":"record","created_at":"2026-05-18T00:38:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7ce820a0e8e8aca4dcbe417ac623dbdd3aacde0b5793b49dd7462b09799d2da5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-30T23:29:17Z","title_canon_sha256":"55526c75ed6d3d63fb2d4c1f1c5182ad185d995415be68f328479c2e51cefc27"},"schema_version":"1.0","source":{"id":"1412.0305","kind":"arxiv","version":2}},"canonical_sha256":"e33bde229da21f29cfe7ab2a3c1afb23c0dc6d21900acd14ecd8d33cdb6ea51f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e33bde229da21f29cfe7ab2a3c1afb23c0dc6d21900acd14ecd8d33cdb6ea51f","first_computed_at":"2026-05-18T00:38:31.594054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:31.594054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8c2Ez/4PiTkm19XLZnoFR1NlkFtXD7Z0sjuNx8gcSTNh3Dkvp1eQn9oo/59lFTrinN3c2OXCyp/4Xz7/ExVlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:31.594499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0305","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07020b5abfb40d6957a493e0edf92f8b543ef15ef86023daf1c8826c68feaee1","sha256:befe9814220c2597412cc3cc022cd76961030a2d62dde46e41cf24ebd39aa805"],"state_sha256":"4e7109dc15cff0391e1efc2a1180ee2d786cb66b17e6fc39c9f4baab68cc63bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WEP4aBRifOY+RsNfalRtkXRq891xWxdEleniHa/CzNqyd6rXTX/ZgoytgZH5def/ZZmxuLH+UgcHZZ66ASt5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:12:32.316031Z","bundle_sha256":"fe27ea569fd02aa6b30493ffbcee90dea55dcf3884000cf76061d36560d42e96"}}