{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VHQUAKZXBUHZ3QZP7UDRDM76VT","short_pith_number":"pith:VHQUAKZX","canonical_record":{"source":{"id":"1505.00619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-04T13:05:20Z","cross_cats_sorted":["cs.CC","cs.IT","math.CO","math.IT"],"title_canon_sha256":"922566c1791b5a2b17525ecc2cf925530bb3a7661ccf8dc41b3acb4d9b82402f","abstract_canon_sha256":"2f6f9fb6a5b653b454aa2d40d2dcd4e9bd36c2a30f5b251877f2f42b58d90030"},"schema_version":"1.0"},"canonical_sha256":"a9e1402b370d0f9dc32ffd0711b3feacc80c5506596f97a047b9096d5e51f1d5","source":{"kind":"arxiv","id":"1505.00619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00619","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00619v1","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00619","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"VHQUAKZXBUHZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHQUAKZXBUHZ3QZP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHQUAKZX","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VHQUAKZXBUHZ3QZP7UDRDM76VT","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-04T13:05:20Z","cross_cats_sorted":["cs.CC","cs.IT","math.CO","math.IT"],"title_canon_sha256":"922566c1791b5a2b17525ecc2cf925530bb3a7661ccf8dc41b3acb4d9b82402f","abstract_canon_sha256":"2f6f9fb6a5b653b454aa2d40d2dcd4e9bd36c2a30f5b251877f2f42b58d90030"},"schema_version":"1.0"},"canonical_sha256":"a9e1402b370d0f9dc32ffd0711b3feacc80c5506596f97a047b9096d5e51f1d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:02.354549Z","signature_b64":"/IO0ozz6HqT/ab8tjZ23cFTRXwy6uWUxwrfkJ2lYgLRVcdOf6rvd+kDOJWNQJo8KPCtZXZFpHmvLo42XkzGQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e1402b370d0f9dc32ffd0711b3feacc80c5506596f97a047b9096d5e51f1d5","last_reissued_at":"2026-05-18T02:17:02.353771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:02.353771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00619","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-18T02:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2F3CoqHKVLTM5pyvQ9Ch3edWB+duopahMGIm6Sx5mQgMMUsDH0pW87CEkaddB9tqfm2yrHtxiXpSv3nIAJGNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:43.161085Z"},"content_sha256":"e0852328e66dd971f8ca5770857d79748ee23b8239722f2376cee6653af51e5f","schema_version":"1.0","event_id":"sha256:e0852328e66dd971f8ca5770857d79748ee23b8239722f2376cee6653af51e5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VHQUAKZXBUHZ3QZP7UDRDM76VT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using higher-order Fourier analysis over general fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.CO","math.IT"],"primary_cat":"cs.DS","authors_text":"Abhishek Bhowmick, Arnab Bhattacharyya","submitted_at":"2015-05-04T13:05:20Z","abstract_excerpt":"Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis to analyze functions over general fields. Using these new tools, we revisit the results in the above areas.\n  * For any fixed finite field $\\mathbb{K}$, we show that the list decoding radius of the generalized Reed Muller code over $\\mathbb{K}$ equals the minimum distance of the code. Previously, this had been proved over prime fields [BL14] and for the case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00619","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-18T02:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJEC+pQpzjJLv3O9+xNiJL7l+AGz503JNCKwqzRXsjd6OYVheQikMcS1OVtA8iArKNZUCscQp5QnJxbJRQ/vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:43.161789Z"},"content_sha256":"f1b301c5f88ffc4c47eb991f7a96a1bca5e81c466a79aabd9444d61f5355270a","schema_version":"1.0","event_id":"sha256:f1b301c5f88ffc4c47eb991f7a96a1bca5e81c466a79aabd9444d61f5355270a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHQUAKZXBUHZ3QZP7UDRDM76VT/bundle.json","state_url":"https://pith.science/pith/VHQUAKZXBUHZ3QZP7UDRDM76VT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHQUAKZXBUHZ3QZP7UDRDM76VT/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-05-27T09:23:43Z","links":{"resolver":"https://pith.science/pith/VHQUAKZXBUHZ3QZP7UDRDM76VT","bundle":"https://pith.science/pith/VHQUAKZXBUHZ3QZP7UDRDM76VT/bundle.json","state":"https://pith.science/pith/VHQUAKZXBUHZ3QZP7UDRDM76VT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHQUAKZXBUHZ3QZP7UDRDM76VT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VHQUAKZXBUHZ3QZP7UDRDM76VT","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":"2f6f9fb6a5b653b454aa2d40d2dcd4e9bd36c2a30f5b251877f2f42b58d90030","cross_cats_sorted":["cs.CC","cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-04T13:05:20Z","title_canon_sha256":"922566c1791b5a2b17525ecc2cf925530bb3a7661ccf8dc41b3acb4d9b82402f"},"schema_version":"1.0","source":{"id":"1505.00619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00619","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00619v1","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00619","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"VHQUAKZXBUHZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHQUAKZXBUHZ3QZP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHQUAKZX","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:f1b301c5f88ffc4c47eb991f7a96a1bca5e81c466a79aabd9444d61f5355270a","target":"graph","created_at":"2026-05-18T02:17:02Z","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":"Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis to analyze functions over general fields. Using these new tools, we revisit the results in the above areas.\n  * For any fixed finite field $\\mathbb{K}$, we show that the list decoding radius of the generalized Reed Muller code over $\\mathbb{K}$ equals the minimum distance of the code. Previously, this had been proved over prime fields [BL14] and for the case","authors_text":"Abhishek Bhowmick, Arnab Bhattacharyya","cross_cats":["cs.CC","cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-04T13:05:20Z","title":"Using higher-order Fourier analysis over general fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00619","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:e0852328e66dd971f8ca5770857d79748ee23b8239722f2376cee6653af51e5f","target":"record","created_at":"2026-05-18T02:17:02Z","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":"2f6f9fb6a5b653b454aa2d40d2dcd4e9bd36c2a30f5b251877f2f42b58d90030","cross_cats_sorted":["cs.CC","cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-04T13:05:20Z","title_canon_sha256":"922566c1791b5a2b17525ecc2cf925530bb3a7661ccf8dc41b3acb4d9b82402f"},"schema_version":"1.0","source":{"id":"1505.00619","kind":"arxiv","version":1}},"canonical_sha256":"a9e1402b370d0f9dc32ffd0711b3feacc80c5506596f97a047b9096d5e51f1d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9e1402b370d0f9dc32ffd0711b3feacc80c5506596f97a047b9096d5e51f1d5","first_computed_at":"2026-05-18T02:17:02.353771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:02.353771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/IO0ozz6HqT/ab8tjZ23cFTRXwy6uWUxwrfkJ2lYgLRVcdOf6rvd+kDOJWNQJo8KPCtZXZFpHmvLo42XkzGQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:02.354549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0852328e66dd971f8ca5770857d79748ee23b8239722f2376cee6653af51e5f","sha256:f1b301c5f88ffc4c47eb991f7a96a1bca5e81c466a79aabd9444d61f5355270a"],"state_sha256":"d05089f071c02c0219cbdc59abda39877aa6ebb2b99c1a73d59d1d1cbfc80d93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"igQ2+g4eejhkdW49MG+HKBvSBfbgGu29hHqyRn5ccffmcvPBU/yXmXyictMRDpxJYtTeXBAI2+izhRjlVbLXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:23:43.165986Z","bundle_sha256":"80ad60c7cff163f24d4443024aa3a456eaad3b84aa55201cf82a37a0ec33bca4"}}