{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YRELBOJYGF6KXHPP6HWEVEP4F7","short_pith_number":"pith:YRELBOJY","schema_version":"1.0","canonical_sha256":"c448b0b938317cab9deff1ec4a91fc2fcba741328b875239d806f7b23a2f813d","source":{"kind":"arxiv","id":"1412.5655","version":1},"attestation_state":"computed","paper":{"title":"New algorithms and lower bounds for monotonicity testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Li-Yang Tan, Rocco A. Servedio, Xi Chen","submitted_at":"2014-12-17T22:26:10Z","abstract_excerpt":"We consider the problem of testing whether an unknown Boolean function $f$ is monotone versus $\\epsilon$-far from every monotone function. The two main results of this paper are a new lower bound and a new algorithm for this well-studied problem.\n  Lower bound: We prove an $\\tilde{\\Omega}(n^{1/5})$ lower bound on the query complexity of any non-adaptive two-sided error algorithm for testing whether an unknown Boolean function $f$ is monotone versus constant-far from monotone. This gives an exponential improvement on the previous lower bound of $\\Omega(\\log n)$ due to Fischer et al. [FLN+02]. W"},"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":"1412.5655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-17T22:26:10Z","cross_cats_sorted":[],"title_canon_sha256":"e3decb7d16c04d2372b56e9430cd8c104f6d8981bc1bb3a2dfbfada60a2abbdc","abstract_canon_sha256":"7e55011495c4e82b00f45b97d9f6bd1eafa0fdb044a6773c5eb5fd86609a0292"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:01.726347Z","signature_b64":"BVmUZ63Hje6ZZ20UNG6U3sgESYuorj85pnxKk+sxox1SPpd6aadOqy1gB4jxDb5Wu4z3om4WJc4AHkcQK4ckAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c448b0b938317cab9deff1ec4a91fc2fcba741328b875239d806f7b23a2f813d","last_reissued_at":"2026-05-18T02:31:01.725655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:01.725655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New algorithms and lower bounds for monotonicity testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Li-Yang Tan, Rocco A. Servedio, Xi Chen","submitted_at":"2014-12-17T22:26:10Z","abstract_excerpt":"We consider the problem of testing whether an unknown Boolean function $f$ is monotone versus $\\epsilon$-far from every monotone function. The two main results of this paper are a new lower bound and a new algorithm for this well-studied problem.\n  Lower bound: We prove an $\\tilde{\\Omega}(n^{1/5})$ lower bound on the query complexity of any non-adaptive two-sided error algorithm for testing whether an unknown Boolean function $f$ is monotone versus constant-far from monotone. This gives an exponential improvement on the previous lower bound of $\\Omega(\\log n)$ due to Fischer et al. [FLN+02]. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5655","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":"1412.5655","created_at":"2026-05-18T02:31:01.725769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5655v1","created_at":"2026-05-18T02:31:01.725769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5655","created_at":"2026-05-18T02:31:01.725769+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRELBOJYGF6K","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRELBOJYGF6KXHPP","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRELBOJY","created_at":"2026-05-18T12:28:57.508820+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/YRELBOJYGF6KXHPP6HWEVEP4F7","json":"https://pith.science/pith/YRELBOJYGF6KXHPP6HWEVEP4F7.json","graph_json":"https://pith.science/api/pith-number/YRELBOJYGF6KXHPP6HWEVEP4F7/graph.json","events_json":"https://pith.science/api/pith-number/YRELBOJYGF6KXHPP6HWEVEP4F7/events.json","paper":"https://pith.science/paper/YRELBOJY"},"agent_actions":{"view_html":"https://pith.science/pith/YRELBOJYGF6KXHPP6HWEVEP4F7","download_json":"https://pith.science/pith/YRELBOJYGF6KXHPP6HWEVEP4F7.json","view_paper":"https://pith.science/paper/YRELBOJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5655&json=true","fetch_graph":"https://pith.science/api/pith-number/YRELBOJYGF6KXHPP6HWEVEP4F7/graph.json","fetch_events":"https://pith.science/api/pith-number/YRELBOJYGF6KXHPP6HWEVEP4F7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRELBOJYGF6KXHPP6HWEVEP4F7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRELBOJYGF6KXHPP6HWEVEP4F7/action/storage_attestation","attest_author":"https://pith.science/pith/YRELBOJYGF6KXHPP6HWEVEP4F7/action/author_attestation","sign_citation":"https://pith.science/pith/YRELBOJYGF6KXHPP6HWEVEP4F7/action/citation_signature","submit_replication":"https://pith.science/pith/YRELBOJYGF6KXHPP6HWEVEP4F7/action/replication_record"}},"created_at":"2026-05-18T02:31:01.725769+00:00","updated_at":"2026-05-18T02:31:01.725769+00:00"}