{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:VUIIEZNO6MKTJDMJ3OBAH5ETYZ","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":"1534f290d578a3aa77991d0ae90056033ca0c04f6237e5efbc32b50f9037463e","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.DS","submitted_at":"2006-07-20T21:02:29Z","title_canon_sha256":"83c57cc87f74ff93a72591a86f0da13bb11291c0ef91515a2b4aa9b4d0885c53"},"schema_version":"1.0","source":{"id":"cs/0607098","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0607098","created_at":"2026-07-04T15:03:01Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0607098v2","created_at":"2026-07-04T15:03:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0607098","created_at":"2026-07-04T15:03:01Z"},{"alias_kind":"pith_short_12","alias_value":"VUIIEZNO6MKT","created_at":"2026-07-04T15:03:01Z"},{"alias_kind":"pith_short_16","alias_value":"VUIIEZNO6MKTJDMJ","created_at":"2026-07-04T15:03:01Z"},{"alias_kind":"pith_short_8","alias_value":"VUIIEZNO","created_at":"2026-07-04T15:03:01Z"}],"graph_snapshots":[{"event_id":"sha256:d62086a4297aa5f47e6af206ab08a0437787c1b6dc4de6ca2c948a8714f08380","target":"graph","created_at":"2026-07-04T15:03:01Z","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/cs/0607098/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"First- and second-order Reed-Muller (RM(1) and RM(2), respectively) codes are two fundamental error-correcting codes which arise in communication as well as in probabilistically-checkable proofs and learning. In this paper, we take the first steps toward extending the quick randomized decoding tools of RM(1) into the realm of quadratic binary and, equivalently, Z_4 codes. Our main algorithmic result is an extension of the RM(1) techniques from Goldreich-Levin and Kushilevitz-Mansour algorithms to the Hankel code, a code between RM(1) and RM(2). That is, given signal s of length N, we find a li","authors_text":"Anna C. Gilbert, A. R. Calderbank, Martin J. Strauss","cross_cats":["cs.IT","math.IT"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2006-07-20T21:02:29Z","title":"List decoding of noisy Reed-Muller-like codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0607098","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:b13d51efbd27e3cbdf8ceb06e00a95b811d9f6facf249b3f0b548520ed6e2f7f","target":"record","created_at":"2026-07-04T15:03:01Z","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":"1534f290d578a3aa77991d0ae90056033ca0c04f6237e5efbc32b50f9037463e","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.DS","submitted_at":"2006-07-20T21:02:29Z","title_canon_sha256":"83c57cc87f74ff93a72591a86f0da13bb11291c0ef91515a2b4aa9b4d0885c53"},"schema_version":"1.0","source":{"id":"cs/0607098","kind":"arxiv","version":2}},"canonical_sha256":"ad108265aef315348d89db8203f493c6608cc1523df6bedbb710b3bcd7e77072","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad108265aef315348d89db8203f493c6608cc1523df6bedbb710b3bcd7e77072","first_computed_at":"2026-07-04T15:03:01.498353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:03:01.498353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mdFjdpBlzNxpj+fuJL/I4OEvBkd60myGfvMAlgGpl9/mWtqgCdB7HHbLF+ggEo++9FwvTSfZ0DlAuh9rVzvtDA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:03:01.498735Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0607098","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b13d51efbd27e3cbdf8ceb06e00a95b811d9f6facf249b3f0b548520ed6e2f7f","sha256:d62086a4297aa5f47e6af206ab08a0437787c1b6dc4de6ca2c948a8714f08380"],"state_sha256":"13c954faa475fa4e433a13cde1542421f2dd8f24f49f54dc505aa1bbe9250647"}