{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HE2FG5E23VVE4X2W32KZAWNCRW","short_pith_number":"pith:HE2FG5E2","canonical_record":{"source":{"id":"1511.07488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T22:11:19Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"129ed47d1673bbdd593f6737b8284c6eb6e1ef45924d4d7d16e61cb0c6a6058b","abstract_canon_sha256":"0e03416031e488e303ffd90392c7a7086c4cb2fd27dbb570d1ee2e8a9eec9c0b"},"schema_version":"1.0"},"canonical_sha256":"393453749add6a4e5f56de959059a28da53f836ae22d026aefbc58bdfa9bb65f","source":{"kind":"arxiv","id":"1511.07488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07488","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07488v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07488","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"HE2FG5E23VVE","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HE2FG5E23VVE4X2W","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HE2FG5E2","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HE2FG5E23VVE4X2W32KZAWNCRW","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T22:11:19Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"129ed47d1673bbdd593f6737b8284c6eb6e1ef45924d4d7d16e61cb0c6a6058b","abstract_canon_sha256":"0e03416031e488e303ffd90392c7a7086c4cb2fd27dbb570d1ee2e8a9eec9c0b"},"schema_version":"1.0"},"canonical_sha256":"393453749add6a4e5f56de959059a28da53f836ae22d026aefbc58bdfa9bb65f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.664791Z","signature_b64":"587x+hMCxEM+TUuHFuz2+B2hajT/zIyIH4LxKjSL8K3Gq5I7B36gRr7kG+v/SqWcO4LzbmselqTrcbsYIiEbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"393453749add6a4e5f56de959059a28da53f836ae22d026aefbc58bdfa9bb65f","last_reissued_at":"2026-05-18T01:26:04.664328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.664328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07488","source_version":1,"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-18T01:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HT5II7EzlcryWTQxplkfp91AF87QFC6HVKS6qHYdy8FJP7ifLhxwZS7cXp+YDUnTwgqocnPnbEbvYruu+De7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:21:27.421930Z"},"content_sha256":"85feb0177e1cd1463803db778065000624d0035a0be487a6cffb757dd081ab28","schema_version":"1.0","event_id":"sha256:85feb0177e1cd1463803db778065000624d0035a0be487a6cffb757dd081ab28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HE2FG5E23VVE4X2W32KZAWNCRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding Reed-Muller codes over product sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.CC","authors_text":"John Kim, Swastik Kopparty","submitted_at":"2015-11-23T22:11:19Z","abstract_excerpt":"We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can achieve this only if the set $S$ has some very special algebraic structure, or if the degree $d$ is significantly smaller than $|S|$. We also give a near-linear time randomized algorithm, which is based on tools from list-decoding, to decode these codes from nearly half their minimum distance, provided $d < (1-\\epsilon)|S|$ for constant $\\epsilon > 0$.\n  Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07488","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"},"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-18T01:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSfOFHAgWannHbr3zPAnPH4HC23n4krZQD/2gxPTxuRIAM+KdKYpeQvywS5RrBBrJAcFgh8LtozKt8+Szc0BAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:21:27.422276Z"},"content_sha256":"e0bcab6705dbed1292e250cef2f5031bcce08a4f24915a427ed9276d71e3ef68","schema_version":"1.0","event_id":"sha256:e0bcab6705dbed1292e250cef2f5031bcce08a4f24915a427ed9276d71e3ef68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW/bundle.json","state_url":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HE2FG5E23VVE4X2W32KZAWNCRW/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-28T09:21:27Z","links":{"resolver":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW","bundle":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW/bundle.json","state":"https://pith.science/pith/HE2FG5E23VVE4X2W32KZAWNCRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HE2FG5E23VVE4X2W32KZAWNCRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HE2FG5E23VVE4X2W32KZAWNCRW","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":"0e03416031e488e303ffd90392c7a7086c4cb2fd27dbb570d1ee2e8a9eec9c0b","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T22:11:19Z","title_canon_sha256":"129ed47d1673bbdd593f6737b8284c6eb6e1ef45924d4d7d16e61cb0c6a6058b"},"schema_version":"1.0","source":{"id":"1511.07488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07488","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07488v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07488","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"HE2FG5E23VVE","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HE2FG5E23VVE4X2W","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HE2FG5E2","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:e0bcab6705dbed1292e250cef2f5031bcce08a4f24915a427ed9276d71e3ef68","target":"graph","created_at":"2026-05-18T01:26:04Z","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":"We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can achieve this only if the set $S$ has some very special algebraic structure, or if the degree $d$ is significantly smaller than $|S|$. We also give a near-linear time randomized algorithm, which is based on tools from list-decoding, to decode these codes from nearly half their minimum distance, provided $d < (1-\\epsilon)|S|$ for constant $\\epsilon > 0$.\n  Ou","authors_text":"John Kim, Swastik Kopparty","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T22:11:19Z","title":"Decoding Reed-Muller codes over product sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07488","kind":"arxiv","version":1},"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:85feb0177e1cd1463803db778065000624d0035a0be487a6cffb757dd081ab28","target":"record","created_at":"2026-05-18T01:26:04Z","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":"0e03416031e488e303ffd90392c7a7086c4cb2fd27dbb570d1ee2e8a9eec9c0b","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T22:11:19Z","title_canon_sha256":"129ed47d1673bbdd593f6737b8284c6eb6e1ef45924d4d7d16e61cb0c6a6058b"},"schema_version":"1.0","source":{"id":"1511.07488","kind":"arxiv","version":1}},"canonical_sha256":"393453749add6a4e5f56de959059a28da53f836ae22d026aefbc58bdfa9bb65f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"393453749add6a4e5f56de959059a28da53f836ae22d026aefbc58bdfa9bb65f","first_computed_at":"2026-05-18T01:26:04.664328Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:04.664328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"587x+hMCxEM+TUuHFuz2+B2hajT/zIyIH4LxKjSL8K3Gq5I7B36gRr7kG+v/SqWcO4LzbmselqTrcbsYIiEbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:04.664791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85feb0177e1cd1463803db778065000624d0035a0be487a6cffb757dd081ab28","sha256:e0bcab6705dbed1292e250cef2f5031bcce08a4f24915a427ed9276d71e3ef68"],"state_sha256":"9b320782d0f588872130ae7b15df5165393ede94b2115c8ab06582814160b5cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMJCWJ8HQNIslhOHUi3UFaLHZHwwXdBKDZYp4foR3aALXToLcfG6Tvq66UnUZKZAd05UZeASJOz/GBHIIHg0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T09:21:27.424187Z","bundle_sha256":"978aab51ad3932e1503c700d6f314ce069e4bedd98f453c90285858fe5cd3715"}}