{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U5S62PWBVOJN6PQO7IQ32RY3FT","short_pith_number":"pith:U5S62PWB","schema_version":"1.0","canonical_sha256":"a765ed3ec1ab92df3e0efa21bd471b2ccbbd73766cf00c0845304dd414d58492","source":{"kind":"arxiv","id":"1204.5467","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.5467","created_at":"2026-05-18T02:21:15.999878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5467v1","created_at":"2026-05-18T02:21:15.999878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5467","created_at":"2026-05-18T02:21:15.999878+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5S62PWBVOJN","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5S62PWBVOJN6PQO","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5S62PWB","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT","json":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT.json","graph_json":"https://pith.science/api/pith-number/U5S62PWBVOJN6PQO7IQ32RY3FT/graph.json","events_json":"https://pith.science/api/pith-number/U5S62PWBVOJN6PQO7IQ32RY3FT/events.json","paper":"https://pith.science/paper/U5S62PWB"},"agent_actions":{"view_html":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT","download_json":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT.json","view_paper":"https://pith.science/paper/U5S62PWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5467&json=true","fetch_graph":"https://pith.science/api/pith-number/U5S62PWBVOJN6PQO7IQ32RY3FT/graph.json","fetch_events":"https://pith.science/api/pith-number/U5S62PWBVOJN6PQO7IQ32RY3FT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/action/storage_attestation","attest_author":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/action/author_attestation","sign_citation":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/action/citation_signature","submit_replication":"https://pith.science/pith/U5S62PWBVOJN6PQO7IQ32RY3FT/action/replication_record"}},"created_at":"2026-05-18T02:21:15.999878+00:00","updated_at":"2026-05-18T02:21:15.999878+00:00"}