{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:U5S62PWBVOJN6PQO7IQ32RY3FT","short_pith_number":"pith:U5S62PWB","canonical_record":{"source":{"id":"1204.5467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-24T19:38:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"146d9f602cccf7caa5a2d3fdcc3ed1b259e7d8b8bc45b103d3956ea6930bee8c","abstract_canon_sha256":"7efba264b9dcc8dcd757978b24cc52612357de6823f5a3b89b5b5e189620c9d3"},"schema_version":"1.0"},"canonical_sha256":"a765ed3ec1ab92df3e0efa21bd471b2ccbbd73766cf00c0845304dd414d58492","source":{"kind":"arxiv","id":"1204.5467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5467","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5467v1","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5467","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"U5S62PWBVOJN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U5S62PWBVOJN6PQO","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U5S62PWB","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:U5S62PWBVOJN6PQO7IQ32RY3FT","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-24T19:38:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"146d9f602cccf7caa5a2d3fdcc3ed1b259e7d8b8bc45b103d3956ea6930bee8c","abstract_canon_sha256":"7efba264b9dcc8dcd757978b24cc52612357de6823f5a3b89b5b5e189620c9d3"},"schema_version":"1.0"},"canonical_sha256":"a765ed3ec1ab92df3e0efa21bd471b2ccbbd73766cf00c0845304dd414d58492","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:16.000295Z","signature_b64":"GSOsu/3t/3sQbo5iQM1XRrKwsnu+u5ZoP4dca1iHJ8Vu/b+oxqEybL6cZcTErk/bxx1xlUqehyUG2SXAmErcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a765ed3ec1ab92df3e0efa21bd471b2ccbbd73766cf00c0845304dd414d58492","last_reissued_at":"2026-05-18T02:21:15.999802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.999802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5467","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:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5WJBEGicEgxw76PnWfG3cNyT2JuTsd2qbn7ACpPTvuecGXIdGMAa09a7x8e63tk/aPY1nYNFZ4qs+uImlUYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:24:42.321882Z"},"content_sha256":"d11ee84374b085cc6333488aac88fc42bb7dae2ae0e4c77cef422feb537fc88b","schema_version":"1.0","event_id":"sha256:d11ee84374b085cc6333488aac88fc42bb7dae2ae0e4c77cef422feb537fc88b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:U5S62PWBVOJN6PQO7IQ32RY3FT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new upper bound on the query complexity for testing generalized Reed-Muller codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Madhu Sudan, Noga Ron-Zewi","submitted_at":"2012-04-24T19:38:10Z","abstract_excerpt":"Over a finite field $\\F_q$ the $(n,d,q)$-Reed-Muller code is the code given by evaluations of $n$-variate polynomials of total degree at most $d$ on all points (of $\\F_q^n$). The task of testing if a function $f:\\F_q^n \\to \\F_q$ is close to a codeword of an $(n,d,q)$-Reed-Muller code has been of central interest in complexity theory and property testing. The query complexity of this task is the minimal number of queries that a tester can make (minimum over all testers of the maximum number of queries over all random choices) while accepting all Reed-Muller codewords and rejecting words that ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5467","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:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wjjj10acXsjTKPK5ayvlVZcnSO/mruCZ5mkFDXer1yZjpkkF9acQ+1Gus/2VAJ7RGf0wYg7mxJ/myAxSHpXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:24:42.322251Z"},"content_sha256":"330bfbda2be0a95a3677aeadbfd151f39d74f6e8c2f43e8f1f8c7a610e4d821c","schema_version":"1.0","event_id":"sha256:330bfbda2be0a95a3677aeadbfd151f39d74f6e8c2f43e8f1f8c7a610e4d821c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/bundle.json","state_url":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/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-27T00:24:42Z","links":{"resolver":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT","bundle":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/bundle.json","state":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:U5S62PWBVOJN6PQO7IQ32RY3FT","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":"7efba264b9dcc8dcd757978b24cc52612357de6823f5a3b89b5b5e189620c9d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-24T19:38:10Z","title_canon_sha256":"146d9f602cccf7caa5a2d3fdcc3ed1b259e7d8b8bc45b103d3956ea6930bee8c"},"schema_version":"1.0","source":{"id":"1204.5467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5467","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5467v1","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5467","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"U5S62PWBVOJN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U5S62PWBVOJN6PQO","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U5S62PWB","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:330bfbda2be0a95a3677aeadbfd151f39d74f6e8c2f43e8f1f8c7a610e4d821c","target":"graph","created_at":"2026-05-18T02:21:15Z","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":"Over a finite field $\\F_q$ the $(n,d,q)$-Reed-Muller code is the code given by evaluations of $n$-variate polynomials of total degree at most $d$ on all points (of $\\F_q^n$). The task of testing if a function $f:\\F_q^n \\to \\F_q$ is close to a codeword of an $(n,d,q)$-Reed-Muller code has been of central interest in complexity theory and property testing. The query complexity of this task is the minimal number of queries that a tester can make (minimum over all testers of the maximum number of queries over all random choices) while accepting all Reed-Muller codewords and rejecting words that ar","authors_text":"Madhu Sudan, Noga Ron-Zewi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-24T19:38:10Z","title":"A new upper bound on the query complexity for testing generalized Reed-Muller codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5467","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:d11ee84374b085cc6333488aac88fc42bb7dae2ae0e4c77cef422feb537fc88b","target":"record","created_at":"2026-05-18T02:21:15Z","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":"7efba264b9dcc8dcd757978b24cc52612357de6823f5a3b89b5b5e189620c9d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-24T19:38:10Z","title_canon_sha256":"146d9f602cccf7caa5a2d3fdcc3ed1b259e7d8b8bc45b103d3956ea6930bee8c"},"schema_version":"1.0","source":{"id":"1204.5467","kind":"arxiv","version":1}},"canonical_sha256":"a765ed3ec1ab92df3e0efa21bd471b2ccbbd73766cf00c0845304dd414d58492","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a765ed3ec1ab92df3e0efa21bd471b2ccbbd73766cf00c0845304dd414d58492","first_computed_at":"2026-05-18T02:21:15.999802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:15.999802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GSOsu/3t/3sQbo5iQM1XRrKwsnu+u5ZoP4dca1iHJ8Vu/b+oxqEybL6cZcTErk/bxx1xlUqehyUG2SXAmErcBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:16.000295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d11ee84374b085cc6333488aac88fc42bb7dae2ae0e4c77cef422feb537fc88b","sha256:330bfbda2be0a95a3677aeadbfd151f39d74f6e8c2f43e8f1f8c7a610e4d821c"],"state_sha256":"3cec4183dd7d4455cc3d70e183d39d432085a324b984d4b81adb5725f9199251"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydyqk6uOwjLUF5ZeMtDY+bFLROeS4w1tYzUqk8+0mkrBCvavmvoSVujMFQLBaR9jVLaPe7RFVOyGrrh6TUEfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:24:42.324769Z","bundle_sha256":"72ee4b4a0c349b283b2519d81a10b9f3902c6352de6dc4bd94630d6a18b26939"}}