{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5WOPO2VLCLUF2QM7BMT7ZG2E5O","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cb3fb1b787f56dd282dc1d8a792d7404375d633baeac3b0384e14d9608a56749","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-16T17:38:59Z","title_canon_sha256":"b45bbea9f5a1def20bdcaf207f25ad9dcca139c923d807a2a50f60eed9cec0ff"},"schema_version":"1.0","source":{"id":"1511.05053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05053","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05053v1","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05053","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"pith_short_12","alias_value":"5WOPO2VLCLUF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5WOPO2VLCLUF2QM7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5WOPO2VL","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:65354e97ed437e17adc2a58351e62c04c55eb1fc5e694666f6db2d6f8f323233","target":"graph","created_at":"2026-05-18T01:26:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We show that every algorithm for testing $n$-variate Boolean functions for monotonicity must have query complexity $\\tilde{\\Omega}(n^{1/4})$. All previous lower bounds for this problem were designed for non-adaptive algorithms and, as a result, the best previous lower bound for general (possibly adaptive) monotonicity testers was only $\\Omega(\\log n)$. Combined with the query complexity of the non-adaptive monotonicity tester of Khot, Minzer, and Safra (FOCS 2015), our lower bound shows that adaptivity can result in at most a quadratic reduction in the query complexity for testing monotonicity","authors_text":"Aleksandrs Belovs, Eric Blais","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-16T17:38:59Z","title":"A Polynomial Lower Bound for Testing Monotonicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05053","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c2df969ed0b573f1bb3b2e93564c517d5c7ecacf97b9e87824a50a718288ab18","target":"record","created_at":"2026-05-18T01:26:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cb3fb1b787f56dd282dc1d8a792d7404375d633baeac3b0384e14d9608a56749","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-16T17:38:59Z","title_canon_sha256":"b45bbea9f5a1def20bdcaf207f25ad9dcca139c923d807a2a50f60eed9cec0ff"},"schema_version":"1.0","source":{"id":"1511.05053","kind":"arxiv","version":1}},"canonical_sha256":"ed9cf76aab12e85d419f0b27fc9b44ebb16b1f62dfd9973297ec54f0c570c73e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed9cf76aab12e85d419f0b27fc9b44ebb16b1f62dfd9973297ec54f0c570c73e","first_computed_at":"2026-05-18T01:26:50.951929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:50.951929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vvkkuYQgn4rQiEfFK8szVJ8q6tglooAdgqOwUkzJEnUkomzoclQdUheAF6WnDg/30BT1+QQy0NzhB6dPRi/tDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:50.952572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2df969ed0b573f1bb3b2e93564c517d5c7ecacf97b9e87824a50a718288ab18","sha256:65354e97ed437e17adc2a58351e62c04c55eb1fc5e694666f6db2d6f8f323233"],"state_sha256":"b8e6743b14d10109e0c608dda9b20b29a117aa37606ce78198221abf1ed05ec8"}