{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YTQFN32HMT4J5PMUPCGRWE3IVA","short_pith_number":"pith:YTQFN32H","canonical_record":{"source":{"id":"1508.00603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-03T21:33:26Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"a1036166262b02ec9a98f1019f3c76708bf58f5aefef5d3497929fce6bf7c009","abstract_canon_sha256":"cc19780ddc116114f822a9d7dde899694415c2240bdeaa87892a62b968149186"},"schema_version":"1.0"},"canonical_sha256":"c4e056ef4764f89ebd94788d1b1368a827be3035cd522d25021756594b786583","source":{"kind":"arxiv","id":"1508.00603","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00603","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00603v3","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00603","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"pith_short_12","alias_value":"YTQFN32HMT4J","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YTQFN32HMT4J5PMU","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YTQFN32H","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YTQFN32HMT4J5PMUPCGRWE3IVA","target":"record","payload":{"canonical_record":{"source":{"id":"1508.00603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-03T21:33:26Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"a1036166262b02ec9a98f1019f3c76708bf58f5aefef5d3497929fce6bf7c009","abstract_canon_sha256":"cc19780ddc116114f822a9d7dde899694415c2240bdeaa87892a62b968149186"},"schema_version":"1.0"},"canonical_sha256":"c4e056ef4764f89ebd94788d1b1368a827be3035cd522d25021756594b786583","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:29.543875Z","signature_b64":"qZkf1mpk0V3wHK28Hq8SykCe1bLSrrNVTX+bwKT0zx+53lt2nfaDK2zYBWqi/z3avTRHBMSpcQQcPSPnH+aCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4e056ef4764f89ebd94788d1b1368a827be3035cd522d25021756594b786583","last_reissued_at":"2026-05-18T00:47:29.543353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:29.543353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.00603","source_version":3,"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:47:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6O20R0EUXYW6ubr98t1V2PmZ7Pw2Mh6l+zK7wpZw0iUd/8LKKzqOiHWtYucNXEb56KnZPrnhd+ZgJbsnLxoKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:14:12.980419Z"},"content_sha256":"06b0cc770e9df6414677950f5689cf9a7a07d0c82d07c4d8e25c9cbc831bd179","schema_version":"1.0","event_id":"sha256:06b0cc770e9df6414677950f5689cf9a7a07d0c82d07c4d8e25c9cbc831bd179"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YTQFN32HMT4J5PMUPCGRWE3IVA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently list-decodable punctured Reed-Muller codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Lingfei Jin, Venkatesan Guruswami","submitted_at":"2015-08-03T21:33:26Z","abstract_excerpt":"The Reed-Muller (RM) code encoding $n$-variate degree-$d$ polynomials over ${\\mathbb F}_q$ for $d < q$, with its evaluation on ${\\mathbb F}_q^n$, has relative distance $1-d/q$ and can be list decoded from a $1-O(\\sqrt{d/q})$ fraction of errors. In this work, for $d \\ll q$, we give a length-efficient puncturing of such codes which (almost) retains the distance and list decodability properties of the Reed-Muller code, but has much better rate. Specificially, when $q =\\Omega( d^2/\\epsilon^2)$, we given an explicit rate $\\Omega\\left(\\frac{\\epsilon}{d!}\\right)$ puncturing of Reed-Muller codes which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00603","kind":"arxiv","version":3},"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:47:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80Bi+NRtO9nlDhaQp6JZfgd7Vh8Z1+oCD0/xnCosIDN1D2QbAzW8mn5hbhMUMnYnItnhk8kXmeBORrJsOyfnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:14:12.981068Z"},"content_sha256":"a376911800ec27b0482a743f9159a0259038a2e32a91bfd66bef56cfcf6f037a","schema_version":"1.0","event_id":"sha256:a376911800ec27b0482a743f9159a0259038a2e32a91bfd66bef56cfcf6f037a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTQFN32HMT4J5PMUPCGRWE3IVA/bundle.json","state_url":"https://pith.science/pith/YTQFN32HMT4J5PMUPCGRWE3IVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTQFN32HMT4J5PMUPCGRWE3IVA/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-07T11:14:12Z","links":{"resolver":"https://pith.science/pith/YTQFN32HMT4J5PMUPCGRWE3IVA","bundle":"https://pith.science/pith/YTQFN32HMT4J5PMUPCGRWE3IVA/bundle.json","state":"https://pith.science/pith/YTQFN32HMT4J5PMUPCGRWE3IVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTQFN32HMT4J5PMUPCGRWE3IVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YTQFN32HMT4J5PMUPCGRWE3IVA","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":"cc19780ddc116114f822a9d7dde899694415c2240bdeaa87892a62b968149186","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-03T21:33:26Z","title_canon_sha256":"a1036166262b02ec9a98f1019f3c76708bf58f5aefef5d3497929fce6bf7c009"},"schema_version":"1.0","source":{"id":"1508.00603","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00603","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00603v3","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00603","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"pith_short_12","alias_value":"YTQFN32HMT4J","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YTQFN32HMT4J5PMU","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YTQFN32H","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:a376911800ec27b0482a743f9159a0259038a2e32a91bfd66bef56cfcf6f037a","target":"graph","created_at":"2026-05-18T00:47:29Z","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":"The Reed-Muller (RM) code encoding $n$-variate degree-$d$ polynomials over ${\\mathbb F}_q$ for $d < q$, with its evaluation on ${\\mathbb F}_q^n$, has relative distance $1-d/q$ and can be list decoded from a $1-O(\\sqrt{d/q})$ fraction of errors. In this work, for $d \\ll q$, we give a length-efficient puncturing of such codes which (almost) retains the distance and list decodability properties of the Reed-Muller code, but has much better rate. Specificially, when $q =\\Omega( d^2/\\epsilon^2)$, we given an explicit rate $\\Omega\\left(\\frac{\\epsilon}{d!}\\right)$ puncturing of Reed-Muller codes which","authors_text":"Chaoping Xing, Lingfei Jin, Venkatesan Guruswami","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-03T21:33:26Z","title":"Efficiently list-decodable punctured Reed-Muller codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00603","kind":"arxiv","version":3},"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:06b0cc770e9df6414677950f5689cf9a7a07d0c82d07c4d8e25c9cbc831bd179","target":"record","created_at":"2026-05-18T00:47:29Z","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":"cc19780ddc116114f822a9d7dde899694415c2240bdeaa87892a62b968149186","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-03T21:33:26Z","title_canon_sha256":"a1036166262b02ec9a98f1019f3c76708bf58f5aefef5d3497929fce6bf7c009"},"schema_version":"1.0","source":{"id":"1508.00603","kind":"arxiv","version":3}},"canonical_sha256":"c4e056ef4764f89ebd94788d1b1368a827be3035cd522d25021756594b786583","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4e056ef4764f89ebd94788d1b1368a827be3035cd522d25021756594b786583","first_computed_at":"2026-05-18T00:47:29.543353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:29.543353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qZkf1mpk0V3wHK28Hq8SykCe1bLSrrNVTX+bwKT0zx+53lt2nfaDK2zYBWqi/z3avTRHBMSpcQQcPSPnH+aCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:29.543875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00603","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06b0cc770e9df6414677950f5689cf9a7a07d0c82d07c4d8e25c9cbc831bd179","sha256:a376911800ec27b0482a743f9159a0259038a2e32a91bfd66bef56cfcf6f037a"],"state_sha256":"a3d1309dbabff75aee0a97ca893bb174f583897434f91ac88dcd6b1c79de5e05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGhuBuqOcmp0YZ6zpVYzYGaFtN1OG7nfsPPe4NFdiTNMPUb8kaZt5BDcJkTFS+EBpOmn9K9lZ7Tca0zgBzzVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:14:12.984787Z","bundle_sha256":"904c0a960a36bd1a8e1f2abf59727df0922b2a046d18efa94399a77d1e46effe"}}