{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SYPIMHSDHPYL3IAKLVTAKWAYPB","short_pith_number":"pith:SYPIMHSD","schema_version":"1.0","canonical_sha256":"961e861e433bf0bda00a5d66055818784cbbf37701edb87ed0fd0a4bf9f54bb5","source":{"kind":"arxiv","id":"1704.06314","version":1},"attestation_state":"computed","paper":{"title":"Settling the query complexity of non-adaptive junta testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik Waingarten, Jinyu Xie, Li-Yang Tan, Rocco A. Servedio, Xi Chen","submitted_at":"2017-04-20T19:49:50Z","abstract_excerpt":"We prove that any non-adaptive algorithm that tests whether an unknown Boolean function $f: \\{0, 1\\}^n\\to \\{0, 1\\}$ is a $k$-junta or $\\epsilon$-far from every $k$-junta must make $\\widetilde{\\Omega}(k^{3/2} / \\epsilon)$ many queries for a wide range of parameters $k$ and $\\epsilon$. Our result dramatically improves previous lower bounds from [BGSMdW13, STW15], and is essentially optimal given Blais's non-adaptive junta tester from [Blais08], which makes $\\widetilde{O}(k^{3/2})/\\epsilon$ queries. Combined with the adaptive tester of [Blais09] which makes $O(k\\log k + k /\\epsilon)$ queries, our"},"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":"1704.06314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-20T19:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"811994bb4e4f70367d992dd358403644753c78c9e787d8570c8750e0cff165fd","abstract_canon_sha256":"f35da3c8c1ed77291a1caaa27bbd2baaac4b3b8034dfc6da7c8f4442017ea9bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:00.018262Z","signature_b64":"4woTzrazXgtMiimiSfX7lvi7FkFTn0ky9OUOmGxjoA8/bUOFgDGyxVjcXQVFbH3lzllK7Zl1ZpRQ2Zz/Mi+pAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961e861e433bf0bda00a5d66055818784cbbf37701edb87ed0fd0a4bf9f54bb5","last_reissued_at":"2026-05-18T00:46:00.017649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:00.017649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Settling the query complexity of non-adaptive junta testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik Waingarten, Jinyu Xie, Li-Yang Tan, Rocco A. Servedio, Xi Chen","submitted_at":"2017-04-20T19:49:50Z","abstract_excerpt":"We prove that any non-adaptive algorithm that tests whether an unknown Boolean function $f: \\{0, 1\\}^n\\to \\{0, 1\\}$ is a $k$-junta or $\\epsilon$-far from every $k$-junta must make $\\widetilde{\\Omega}(k^{3/2} / \\epsilon)$ many queries for a wide range of parameters $k$ and $\\epsilon$. Our result dramatically improves previous lower bounds from [BGSMdW13, STW15], and is essentially optimal given Blais's non-adaptive junta tester from [Blais08], which makes $\\widetilde{O}(k^{3/2})/\\epsilon$ queries. Combined with the adaptive tester of [Blais09] which makes $O(k\\log k + k /\\epsilon)$ queries, our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06314","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":"1704.06314","created_at":"2026-05-18T00:46:00.017743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06314v1","created_at":"2026-05-18T00:46:00.017743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06314","created_at":"2026-05-18T00:46:00.017743+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYPIMHSDHPYL","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYPIMHSDHPYL3IAK","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYPIMHSD","created_at":"2026-05-18T12:31:43.269735+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/SYPIMHSDHPYL3IAKLVTAKWAYPB","json":"https://pith.science/pith/SYPIMHSDHPYL3IAKLVTAKWAYPB.json","graph_json":"https://pith.science/api/pith-number/SYPIMHSDHPYL3IAKLVTAKWAYPB/graph.json","events_json":"https://pith.science/api/pith-number/SYPIMHSDHPYL3IAKLVTAKWAYPB/events.json","paper":"https://pith.science/paper/SYPIMHSD"},"agent_actions":{"view_html":"https://pith.science/pith/SYPIMHSDHPYL3IAKLVTAKWAYPB","download_json":"https://pith.science/pith/SYPIMHSDHPYL3IAKLVTAKWAYPB.json","view_paper":"https://pith.science/paper/SYPIMHSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06314&json=true","fetch_graph":"https://pith.science/api/pith-number/SYPIMHSDHPYL3IAKLVTAKWAYPB/graph.json","fetch_events":"https://pith.science/api/pith-number/SYPIMHSDHPYL3IAKLVTAKWAYPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYPIMHSDHPYL3IAKLVTAKWAYPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYPIMHSDHPYL3IAKLVTAKWAYPB/action/storage_attestation","attest_author":"https://pith.science/pith/SYPIMHSDHPYL3IAKLVTAKWAYPB/action/author_attestation","sign_citation":"https://pith.science/pith/SYPIMHSDHPYL3IAKLVTAKWAYPB/action/citation_signature","submit_replication":"https://pith.science/pith/SYPIMHSDHPYL3IAKLVTAKWAYPB/action/replication_record"}},"created_at":"2026-05-18T00:46:00.017743+00:00","updated_at":"2026-05-18T00:46:00.017743+00:00"}