{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VZGDEH4MORAVVWGYQONUPWY3VX","short_pith_number":"pith:VZGDEH4M","schema_version":"1.0","canonical_sha256":"ae4c321f8c74415ad8d8839b47db1badc91888e77d37b1142e97068a4bc0d9da","source":{"kind":"arxiv","id":"1702.06997","version":2},"attestation_state":"computed","paper":{"title":"Beyond Talagrand Functions: New Lower Bounds for Testing Monotonicity and Unateness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik Waingarten, Jinyu Xie, Xi Chen","submitted_at":"2017-02-22T20:38:35Z","abstract_excerpt":"We prove a lower bound of $\\tilde{\\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\\{0,1\\}^n\\rightarrow \\{0,1\\}$ is monotone or far from monotone. This improves the recent bound of $\\tilde{\\Omega}(n^{1/4})$ for the same problem by Belovs and Blais [BB15]. Our result builds on a new family of random Boolean functions that can be viewed as a two-level extension of Talagrand's random DNFs.\n  Beyond monotonicity, we also prove a lower bound of $\\tilde{\\Omega}(n^{2/3})$ for any two-sided and adaptive algorithm, and "},"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":"1702.06997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-22T20:38:35Z","cross_cats_sorted":[],"title_canon_sha256":"2e63c525968f1662326b338bf36b3d5c3dbe9efc7bf871dad3edb52ef0bdfeef","abstract_canon_sha256":"8c26f156f3807595f29d25441a2015a14e2b9a27b5bf701d4b57b47be73857e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:47.889641Z","signature_b64":"x2Rb0jOga3lF6QPC/huChrwoEc3d/hSkVggSNMxE0+0B5lXfy8zytil343MLixWIv8SThuGxND4uwzTTH/AGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae4c321f8c74415ad8d8839b47db1badc91888e77d37b1142e97068a4bc0d9da","last_reissued_at":"2026-05-18T00:37:47.888986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:47.888986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Talagrand Functions: New Lower Bounds for Testing Monotonicity and Unateness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik Waingarten, Jinyu Xie, Xi Chen","submitted_at":"2017-02-22T20:38:35Z","abstract_excerpt":"We prove a lower bound of $\\tilde{\\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\\{0,1\\}^n\\rightarrow \\{0,1\\}$ is monotone or far from monotone. This improves the recent bound of $\\tilde{\\Omega}(n^{1/4})$ for the same problem by Belovs and Blais [BB15]. Our result builds on a new family of random Boolean functions that can be viewed as a two-level extension of Talagrand's random DNFs.\n  Beyond monotonicity, we also prove a lower bound of $\\tilde{\\Omega}(n^{2/3})$ for any two-sided and adaptive algorithm, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06997","kind":"arxiv","version":2},"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":"1702.06997","created_at":"2026-05-18T00:37:47.889064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06997v2","created_at":"2026-05-18T00:37:47.889064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06997","created_at":"2026-05-18T00:37:47.889064+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZGDEH4MORAV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZGDEH4MORAVVWGY","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZGDEH4M","created_at":"2026-05-18T12:31:49.984773+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/VZGDEH4MORAVVWGYQONUPWY3VX","json":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX.json","graph_json":"https://pith.science/api/pith-number/VZGDEH4MORAVVWGYQONUPWY3VX/graph.json","events_json":"https://pith.science/api/pith-number/VZGDEH4MORAVVWGYQONUPWY3VX/events.json","paper":"https://pith.science/paper/VZGDEH4M"},"agent_actions":{"view_html":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX","download_json":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX.json","view_paper":"https://pith.science/paper/VZGDEH4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06997&json=true","fetch_graph":"https://pith.science/api/pith-number/VZGDEH4MORAVVWGYQONUPWY3VX/graph.json","fetch_events":"https://pith.science/api/pith-number/VZGDEH4MORAVVWGYQONUPWY3VX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX/action/storage_attestation","attest_author":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX/action/author_attestation","sign_citation":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX/action/citation_signature","submit_replication":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX/action/replication_record"}},"created_at":"2026-05-18T00:37:47.889064+00:00","updated_at":"2026-05-18T00:37:47.889064+00:00"}