{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XS7QSQEUP4HOPYFQECM7UFYV6J","short_pith_number":"pith:XS7QSQEU","canonical_record":{"source":{"id":"2605.22813","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T17:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"62ceab586958a9ebb432f267be084c387d241ffd0a787dcf582ed1e9c104a40f","abstract_canon_sha256":"91a6ceab913e1bbd9772ff443a9b928021c3cd9a54535dcd84d0a35e996e5a68"},"schema_version":"1.0"},"canonical_sha256":"bcbf0940947f0ee7e0b02099fa1715f26bc2733fa0a1b4907683c61bb286f10a","source":{"kind":"arxiv","id":"2605.22813","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22813","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22813v1","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22813","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"XS7QSQEUP4HO","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"XS7QSQEUP4HOPYFQ","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"XS7QSQEU","created_at":"2026-05-22T02:04:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XS7QSQEUP4HOPYFQECM7UFYV6J","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22813","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T17:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"62ceab586958a9ebb432f267be084c387d241ffd0a787dcf582ed1e9c104a40f","abstract_canon_sha256":"91a6ceab913e1bbd9772ff443a9b928021c3cd9a54535dcd84d0a35e996e5a68"},"schema_version":"1.0"},"canonical_sha256":"bcbf0940947f0ee7e0b02099fa1715f26bc2733fa0a1b4907683c61bb286f10a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:55.923342Z","signature_b64":"rpvqYV3wJk1ciSC//4qAx/hs5Bd24Z+IrNJNnrJWgseQFKsACTQsJzVaa9I119AA8jd2GMPJKsR3UANDJNGbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcbf0940947f0ee7e0b02099fa1715f26bc2733fa0a1b4907683c61bb286f10a","last_reissued_at":"2026-05-22T02:04:55.922843Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:55.922843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22813","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-22T02:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlDtFAQ6FLAAZXBExscGnVPiyz/6iuGnG93J+qiStvdvwSHyfe5dzXLGSaH15Vc5Qwmz9T4d3NfEv8puo++aBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:25:30.782115Z"},"content_sha256":"361b1e71d1aa85392d1bf85a502f7ed4665f09c38231637c9cefc0c04a35fe27","schema_version":"1.0","event_id":"sha256:361b1e71d1aa85392d1bf85a502f7ed4665f09c38231637c9cefc0c04a35fe27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XS7QSQEUP4HOPYFQECM7UFYV6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Testing of Reed-Muller Codes with an Online Adversary","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Esty Kelman, Kai Zhe Zheng, Uri Meir","submitted_at":"2026-05-21T17:57:58Z","abstract_excerpt":"Motivated by applications to property testing in the online-erasure model of Kalemaj, Raskhodnikova, and Varma (ITCS 2022 and Theory of Computing 2023), we define and analyze {\\em semi-sample-based testers} for Reed-Muller codes. The task in Reed-Muller testing is to determine whether an input function $f: \\F^n \\to \\F$ belongs to the Reed-Muller code or is far from it, using as few point queries to $f$ as possible. Reed-Muller testing is a well-studied task with its roots in both the Property Testing and Probabilistically Checkable Proofs literature. The online-erasure model introduces a twist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22813","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.22813/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-05-22T02:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQ4/kJHG7cqBITgDqPl9eznd/s9bOqrCw0fke8gwHSv21hSTU5y0QiWNQx2CzQiuIqxyleyQeUFHdRcK/tcxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:25:30.782511Z"},"content_sha256":"7dcfa898e30f0e3731c3890b292317bcfd78af7627abf3b5d93014c4836a918c","schema_version":"1.0","event_id":"sha256:7dcfa898e30f0e3731c3890b292317bcfd78af7627abf3b5d93014c4836a918c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XS7QSQEUP4HOPYFQECM7UFYV6J/bundle.json","state_url":"https://pith.science/pith/XS7QSQEUP4HOPYFQECM7UFYV6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XS7QSQEUP4HOPYFQECM7UFYV6J/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-30T12:25:30Z","links":{"resolver":"https://pith.science/pith/XS7QSQEUP4HOPYFQECM7UFYV6J","bundle":"https://pith.science/pith/XS7QSQEUP4HOPYFQECM7UFYV6J/bundle.json","state":"https://pith.science/pith/XS7QSQEUP4HOPYFQECM7UFYV6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XS7QSQEUP4HOPYFQECM7UFYV6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XS7QSQEUP4HOPYFQECM7UFYV6J","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":"91a6ceab913e1bbd9772ff443a9b928021c3cd9a54535dcd84d0a35e996e5a68","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T17:57:58Z","title_canon_sha256":"62ceab586958a9ebb432f267be084c387d241ffd0a787dcf582ed1e9c104a40f"},"schema_version":"1.0","source":{"id":"2605.22813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22813","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22813v1","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22813","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"XS7QSQEUP4HO","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"XS7QSQEUP4HOPYFQ","created_at":"2026-05-22T02:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"XS7QSQEU","created_at":"2026-05-22T02:04:55Z"}],"graph_snapshots":[{"event_id":"sha256:7dcfa898e30f0e3731c3890b292317bcfd78af7627abf3b5d93014c4836a918c","target":"graph","created_at":"2026-05-22T02:04:55Z","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/2605.22813/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by applications to property testing in the online-erasure model of Kalemaj, Raskhodnikova, and Varma (ITCS 2022 and Theory of Computing 2023), we define and analyze {\\em semi-sample-based testers} for Reed-Muller codes. The task in Reed-Muller testing is to determine whether an input function $f: \\F^n \\to \\F$ belongs to the Reed-Muller code or is far from it, using as few point queries to $f$ as possible. Reed-Muller testing is a well-studied task with its roots in both the Property Testing and Probabilistically Checkable Proofs literature. The online-erasure model introduces a twist","authors_text":"Esty Kelman, Kai Zhe Zheng, Uri Meir","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T17:57:58Z","title":"Optimal Testing of Reed-Muller Codes with an Online Adversary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22813","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:361b1e71d1aa85392d1bf85a502f7ed4665f09c38231637c9cefc0c04a35fe27","target":"record","created_at":"2026-05-22T02:04:55Z","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":"91a6ceab913e1bbd9772ff443a9b928021c3cd9a54535dcd84d0a35e996e5a68","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T17:57:58Z","title_canon_sha256":"62ceab586958a9ebb432f267be084c387d241ffd0a787dcf582ed1e9c104a40f"},"schema_version":"1.0","source":{"id":"2605.22813","kind":"arxiv","version":1}},"canonical_sha256":"bcbf0940947f0ee7e0b02099fa1715f26bc2733fa0a1b4907683c61bb286f10a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcbf0940947f0ee7e0b02099fa1715f26bc2733fa0a1b4907683c61bb286f10a","first_computed_at":"2026-05-22T02:04:55.922843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T02:04:55.922843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rpvqYV3wJk1ciSC//4qAx/hs5Bd24Z+IrNJNnrJWgseQFKsACTQsJzVaa9I119AA8jd2GMPJKsR3UANDJNGbBw==","signature_status":"signed_v1","signed_at":"2026-05-22T02:04:55.923342Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:361b1e71d1aa85392d1bf85a502f7ed4665f09c38231637c9cefc0c04a35fe27","sha256:7dcfa898e30f0e3731c3890b292317bcfd78af7627abf3b5d93014c4836a918c"],"state_sha256":"881ad4a86e1eaba315b4e493b003b92f564d9bd630f0452213e5e506247d4f8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDeKTwT+x960MIWKL+TcuZy9zaNDV8xn7kCVagw7Np1Gw9q/NSplv82tUThjhpZ26O35P5nzwkBruN+4WB1SAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:25:30.784736Z","bundle_sha256":"22a93785ec1fdaf60b8e97744f9eab95621e5f6da9e943d904cf57c562c88c47"}}