{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:B3Q47PKRZAFN4OWKE3VFKMR4LK","short_pith_number":"pith:B3Q47PKR","schema_version":"1.0","canonical_sha256":"0ee1cfbd51c80ade3aca26ea55323c5aa88bc91cc18ef492a9c4eafb0bfefc76","source":{"kind":"arxiv","id":"1202.3479","version":4},"attestation_state":"computed","paper":{"title":"Lower Bounds on Testing Functions of Low Fourier Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pooya Hatami","submitted_at":"2012-02-16T00:23:15Z","abstract_excerpt":"We consider the problem of testing whether a Boolean function has Fourier degree $\\leq k$ or it is $\\epsilon$-far from any Boolean function with Fourier degree $\\leq k$. We improve the known lower bound of $\\Omega(k)$ \\cite{BBM11,CGM10}, to $\\Omega(k/\\sqrt{\\epsilon})$. The lower bound uses the recently discovered connections between property testing and communication complexity by Blais \\textit{et. al.} \\cite{BBM11}"},"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":"1202.3479","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-16T00:23:15Z","cross_cats_sorted":[],"title_canon_sha256":"bedc158cb1577d657b834d62601fae62f593fe77d2b8f6b3e529156334119d81","abstract_canon_sha256":"1230243659a1b7703e67d672f51b28c02cc38356caf8246a32eb65edb1a993e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:06.668313Z","signature_b64":"XgXzziWtNjPPEG3fXPPNNffgageP5yP7ETYSyGP8TWTFMQGexqNgyQ0fdcoHd5mLF0vi2/3suFkplY1IBRPOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ee1cfbd51c80ade3aca26ea55323c5aa88bc91cc18ef492a9c4eafb0bfefc76","last_reissued_at":"2026-05-18T03:15:06.667518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:06.667518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on Testing Functions of Low Fourier Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pooya Hatami","submitted_at":"2012-02-16T00:23:15Z","abstract_excerpt":"We consider the problem of testing whether a Boolean function has Fourier degree $\\leq k$ or it is $\\epsilon$-far from any Boolean function with Fourier degree $\\leq k$. We improve the known lower bound of $\\Omega(k)$ \\cite{BBM11,CGM10}, to $\\Omega(k/\\sqrt{\\epsilon})$. The lower bound uses the recently discovered connections between property testing and communication complexity by Blais \\textit{et. al.} \\cite{BBM11}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3479","kind":"arxiv","version":4},"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":"1202.3479","created_at":"2026-05-18T03:15:06.667636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3479v4","created_at":"2026-05-18T03:15:06.667636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3479","created_at":"2026-05-18T03:15:06.667636+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3Q47PKRZAFN","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3Q47PKRZAFN4OWK","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3Q47PKR","created_at":"2026-05-18T12:26:58.693483+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/B3Q47PKRZAFN4OWKE3VFKMR4LK","json":"https://pith.science/pith/B3Q47PKRZAFN4OWKE3VFKMR4LK.json","graph_json":"https://pith.science/api/pith-number/B3Q47PKRZAFN4OWKE3VFKMR4LK/graph.json","events_json":"https://pith.science/api/pith-number/B3Q47PKRZAFN4OWKE3VFKMR4LK/events.json","paper":"https://pith.science/paper/B3Q47PKR"},"agent_actions":{"view_html":"https://pith.science/pith/B3Q47PKRZAFN4OWKE3VFKMR4LK","download_json":"https://pith.science/pith/B3Q47PKRZAFN4OWKE3VFKMR4LK.json","view_paper":"https://pith.science/paper/B3Q47PKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3479&json=true","fetch_graph":"https://pith.science/api/pith-number/B3Q47PKRZAFN4OWKE3VFKMR4LK/graph.json","fetch_events":"https://pith.science/api/pith-number/B3Q47PKRZAFN4OWKE3VFKMR4LK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3Q47PKRZAFN4OWKE3VFKMR4LK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3Q47PKRZAFN4OWKE3VFKMR4LK/action/storage_attestation","attest_author":"https://pith.science/pith/B3Q47PKRZAFN4OWKE3VFKMR4LK/action/author_attestation","sign_citation":"https://pith.science/pith/B3Q47PKRZAFN4OWKE3VFKMR4LK/action/citation_signature","submit_replication":"https://pith.science/pith/B3Q47PKRZAFN4OWKE3VFKMR4LK/action/replication_record"}},"created_at":"2026-05-18T03:15:06.667636+00:00","updated_at":"2026-05-18T03:15:06.667636+00:00"}