{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5OIJ6TBIL3576J3XTGMUXC6GP3","short_pith_number":"pith:5OIJ6TBI","canonical_record":{"source":{"id":"2002.03317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-09T08:41:55Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"a03042fa5505c05ec04ad0e2722501ff20a386695854479168579eab40a400fc","abstract_canon_sha256":"3f1894bc24865f06e51e8159cc59c5f13bb8d30825570f628259b98c09957ccb"},"schema_version":"1.0"},"canonical_sha256":"eb909f4c285efbff277799994b8bc67ef2031bd7b16a9f7179448cc7280858c5","source":{"kind":"arxiv","id":"2002.03317","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03317","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03317v2","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03317","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"5OIJ6TBIL357","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"pith_short_16","alias_value":"5OIJ6TBIL3576J3X","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"pith_short_8","alias_value":"5OIJ6TBI","created_at":"2026-07-05T01:09:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5OIJ6TBIL3576J3XTGMUXC6GP3","target":"record","payload":{"canonical_record":{"source":{"id":"2002.03317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-09T08:41:55Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"a03042fa5505c05ec04ad0e2722501ff20a386695854479168579eab40a400fc","abstract_canon_sha256":"3f1894bc24865f06e51e8159cc59c5f13bb8d30825570f628259b98c09957ccb"},"schema_version":"1.0"},"canonical_sha256":"eb909f4c285efbff277799994b8bc67ef2031bd7b16a9f7179448cc7280858c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:03.471414Z","signature_b64":"pTA7xqfldLKROS2q5sk1qUVVzQbND2uf/di7qAUTtmwZT37VIDC9fI32J0jv3iD2hKO+Rex1uf19216MOUX9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb909f4c285efbff277799994b8bc67ef2031bd7b16a9f7179448cc7280858c5","last_reissued_at":"2026-07-05T01:09:03.470914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:03.470914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.03317","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-07-05T01:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTxNa5SSq7pGpzo4Cf5SaDxYk8igB343/0Czg4QeKCcjltoqJ9Cis0BnYRtDM5pvla0JDxTnW3oJw8WsuFtoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:25:08.666467Z"},"content_sha256":"3f3f1e811fcca2445e63ab4c885eb26bff62330404c522dce25e58c8b124f7a6","schema_version":"1.0","event_id":"sha256:3f3f1e811fcca2445e63ab4c885eb26bff62330404c522dce25e58c8b124f7a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5OIJ6TBIL3576J3XTGMUXC6GP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reed-Muller Codes: Theory and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Shpilka, Emmanuel Abbe, Min Ye","submitted_at":"2020-02-09T08:41:55Z","abstract_excerpt":"Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science. Yet, many of their important properties are still under investigation. This paper covers some of the recent developments regarding the weight enumerator and the capacity-achieving properties of RM codes, as well as some of the algorithmic developments. In particular, the paper discusses the recent connections established between RM codes, thresholds of Boolean functions, polarization theory, hypercon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03317","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.03317/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oUEquNclobx9zTRqN30RQA1FJCozF5G6A01YcnYjqXBF1P3vetWPmwRYMh9v7Ls3yO0286zthm1SkfQuJfzDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:25:08.666962Z"},"content_sha256":"c720b916fb8de3d1497bd08bc5d838bb1463b59d95395c4f8461a2a5af1d9592","schema_version":"1.0","event_id":"sha256:c720b916fb8de3d1497bd08bc5d838bb1463b59d95395c4f8461a2a5af1d9592"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OIJ6TBIL3576J3XTGMUXC6GP3/bundle.json","state_url":"https://pith.science/pith/5OIJ6TBIL3576J3XTGMUXC6GP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OIJ6TBIL3576J3XTGMUXC6GP3/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-08-08T16:25:08Z","links":{"resolver":"https://pith.science/pith/5OIJ6TBIL3576J3XTGMUXC6GP3","bundle":"https://pith.science/pith/5OIJ6TBIL3576J3XTGMUXC6GP3/bundle.json","state":"https://pith.science/pith/5OIJ6TBIL3576J3XTGMUXC6GP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OIJ6TBIL3576J3XTGMUXC6GP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5OIJ6TBIL3576J3XTGMUXC6GP3","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":"3f1894bc24865f06e51e8159cc59c5f13bb8d30825570f628259b98c09957ccb","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-09T08:41:55Z","title_canon_sha256":"a03042fa5505c05ec04ad0e2722501ff20a386695854479168579eab40a400fc"},"schema_version":"1.0","source":{"id":"2002.03317","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03317","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03317v2","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03317","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"5OIJ6TBIL357","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"pith_short_16","alias_value":"5OIJ6TBIL3576J3X","created_at":"2026-07-05T01:09:03Z"},{"alias_kind":"pith_short_8","alias_value":"5OIJ6TBI","created_at":"2026-07-05T01:09:03Z"}],"graph_snapshots":[{"event_id":"sha256:c720b916fb8de3d1497bd08bc5d838bb1463b59d95395c4f8461a2a5af1d9592","target":"graph","created_at":"2026-07-05T01:09:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.03317/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science. Yet, many of their important properties are still under investigation. This paper covers some of the recent developments regarding the weight enumerator and the capacity-achieving properties of RM codes, as well as some of the algorithmic developments. In particular, the paper discusses the recent connections established between RM codes, thresholds of Boolean functions, polarization theory, hypercon","authors_text":"Amir Shpilka, Emmanuel Abbe, Min Ye","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-09T08:41:55Z","title":"Reed-Muller Codes: Theory and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03317","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:3f3f1e811fcca2445e63ab4c885eb26bff62330404c522dce25e58c8b124f7a6","target":"record","created_at":"2026-07-05T01:09:03Z","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":"3f1894bc24865f06e51e8159cc59c5f13bb8d30825570f628259b98c09957ccb","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-09T08:41:55Z","title_canon_sha256":"a03042fa5505c05ec04ad0e2722501ff20a386695854479168579eab40a400fc"},"schema_version":"1.0","source":{"id":"2002.03317","kind":"arxiv","version":2}},"canonical_sha256":"eb909f4c285efbff277799994b8bc67ef2031bd7b16a9f7179448cc7280858c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb909f4c285efbff277799994b8bc67ef2031bd7b16a9f7179448cc7280858c5","first_computed_at":"2026-07-05T01:09:03.470914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:09:03.470914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pTA7xqfldLKROS2q5sk1qUVVzQbND2uf/di7qAUTtmwZT37VIDC9fI32J0jv3iD2hKO+Rex1uf19216MOUX9BA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:09:03.471414Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.03317","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f3f1e811fcca2445e63ab4c885eb26bff62330404c522dce25e58c8b124f7a6","sha256:c720b916fb8de3d1497bd08bc5d838bb1463b59d95395c4f8461a2a5af1d9592"],"state_sha256":"e4464e220db5749520cefbafd2098907251cd52861dd8dcd288cc7432d281bf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQu87cz7mU4IpQpG129tALfnVuB35wvP8u8+Varecpk/h0BY7M/o9CYRD09QZiZvfBEn9+9ihNyCTrDq01JlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:25:08.670595Z","bundle_sha256":"777ee3e71e95b3c049aef68ba05ec789ec59f9b20f45e908b8fdac75c7ba6835"}}