{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EPDTP7OBIP4QT4KPJUUS3YMJ6O","short_pith_number":"pith:EPDTP7OB","schema_version":"1.0","canonical_sha256":"23c737fdc143f909f14f4d292de189f39d24ef7a91c53bd84112f2a8d43cf2f0","source":{"kind":"arxiv","id":"1412.5657","version":1},"attestation_state":"computed","paper":{"title":"Boolean function monotonicity testing requires (almost) $n^{1/2}$ non-adaptive queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anindya De, Li-Yang Tan, Rocco A. Servedio, Xi Chen","submitted_at":"2014-12-17T22:37:54Z","abstract_excerpt":"We prove a lower bound of $\\Omega(n^{1/2 - c})$, for all $c>0$, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an $n$-variable Boolean function is monotone versus constant-far from monotone. This improves a $\\tilde{\\Omega}(n^{1/5})$ lower bound for the same problem that was recently given in [CST14] and is very close to $\\Omega(n^{1/2})$, which we conjecture is the optimal lower bound for this model."},"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.5657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-17T22:37:54Z","cross_cats_sorted":[],"title_canon_sha256":"56af98d80a630b71c512e309288542f507ce072466cc18ca891386d54250b4d3","abstract_canon_sha256":"8540fb0eecb5e22983327fdbcc35438312c69336071fd0c373562d20b226d8d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:01.710525Z","signature_b64":"7fYRAQlRQOu/fat1/nAw3/Q1vyICariN1bY8Iaxjccc8Qqji9yxJ2M0sFe4pEJEGA4Q0Lh/c0y4H/Pqokww1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23c737fdc143f909f14f4d292de189f39d24ef7a91c53bd84112f2a8d43cf2f0","last_reissued_at":"2026-05-18T02:31:01.709970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:01.709970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boolean function monotonicity testing requires (almost) $n^{1/2}$ non-adaptive queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anindya De, Li-Yang Tan, Rocco A. Servedio, Xi Chen","submitted_at":"2014-12-17T22:37:54Z","abstract_excerpt":"We prove a lower bound of $\\Omega(n^{1/2 - c})$, for all $c>0$, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an $n$-variable Boolean function is monotone versus constant-far from monotone. This improves a $\\tilde{\\Omega}(n^{1/5})$ lower bound for the same problem that was recently given in [CST14] and is very close to $\\Omega(n^{1/2})$, which we conjecture is the optimal lower bound for this model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5657","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.5657","created_at":"2026-05-18T02:31:01.710069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5657v1","created_at":"2026-05-18T02:31:01.710069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5657","created_at":"2026-05-18T02:31:01.710069+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPDTP7OBIP4Q","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPDTP7OBIP4QT4KP","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPDTP7OB","created_at":"2026-05-18T12:28:28.263976+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/EPDTP7OBIP4QT4KPJUUS3YMJ6O","json":"https://pith.science/pith/EPDTP7OBIP4QT4KPJUUS3YMJ6O.json","graph_json":"https://pith.science/api/pith-number/EPDTP7OBIP4QT4KPJUUS3YMJ6O/graph.json","events_json":"https://pith.science/api/pith-number/EPDTP7OBIP4QT4KPJUUS3YMJ6O/events.json","paper":"https://pith.science/paper/EPDTP7OB"},"agent_actions":{"view_html":"https://pith.science/pith/EPDTP7OBIP4QT4KPJUUS3YMJ6O","download_json":"https://pith.science/pith/EPDTP7OBIP4QT4KPJUUS3YMJ6O.json","view_paper":"https://pith.science/paper/EPDTP7OB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5657&json=true","fetch_graph":"https://pith.science/api/pith-number/EPDTP7OBIP4QT4KPJUUS3YMJ6O/graph.json","fetch_events":"https://pith.science/api/pith-number/EPDTP7OBIP4QT4KPJUUS3YMJ6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPDTP7OBIP4QT4KPJUUS3YMJ6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPDTP7OBIP4QT4KPJUUS3YMJ6O/action/storage_attestation","attest_author":"https://pith.science/pith/EPDTP7OBIP4QT4KPJUUS3YMJ6O/action/author_attestation","sign_citation":"https://pith.science/pith/EPDTP7OBIP4QT4KPJUUS3YMJ6O/action/citation_signature","submit_replication":"https://pith.science/pith/EPDTP7OBIP4QT4KPJUUS3YMJ6O/action/replication_record"}},"created_at":"2026-05-18T02:31:01.710069+00:00","updated_at":"2026-05-18T02:31:01.710069+00:00"}