{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VZGDEH4MORAVVWGYQONUPWY3VX","short_pith_number":"pith:VZGDEH4M","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"},"canonical_sha256":"ae4c321f8c74415ad8d8839b47db1badc91888e77d37b1142e97068a4bc0d9da","source":{"kind":"arxiv","id":"1702.06997","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06997","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06997v2","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06997","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"pith_short_12","alias_value":"VZGDEH4MORAV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VZGDEH4MORAVVWGY","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VZGDEH4M","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VZGDEH4MORAVVWGYQONUPWY3VX","target":"record","payload":{"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"},"canonical_sha256":"ae4c321f8c74415ad8d8839b47db1badc91888e77d37b1142e97068a4bc0d9da","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"},"source_kind":"arxiv","source_id":"1702.06997","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quR6mnrdJrkhQjHGRWaUBX57zkSNiv8vDZvviyWm4SztST+xS11qZ8/qJkSmDfpHikoapvac0AV9/803968bDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T23:21:34.818437Z"},"content_sha256":"e050ef4d11cc4592dceab38217c5a8c7510f16626b81c0493c2f0d05816aa485","schema_version":"1.0","event_id":"sha256:e050ef4d11cc4592dceab38217c5a8c7510f16626b81c0493c2f0d05816aa485"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VZGDEH4MORAVVWGYQONUPWY3VX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Rxh5CKTiR2CHrc2A8cwYI+VMC+gXq6KukPjgOSArGcvaQUkTFKNvjmOdNol5NCOfnbJTnXEemw4cOXWxCgjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T23:21:34.818907Z"},"content_sha256":"64378a678d53d22a69e60b4d49b239c80898f02d0da446355b169f5c42e7ab2e","schema_version":"1.0","event_id":"sha256:64378a678d53d22a69e60b4d49b239c80898f02d0da446355b169f5c42e7ab2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX/bundle.json","state_url":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZGDEH4MORAVVWGYQONUPWY3VX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-22T23:21:34Z","links":{"resolver":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX","bundle":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX/bundle.json","state":"https://pith.science/pith/VZGDEH4MORAVVWGYQONUPWY3VX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZGDEH4MORAVVWGYQONUPWY3VX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VZGDEH4MORAVVWGYQONUPWY3VX","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":"8c26f156f3807595f29d25441a2015a14e2b9a27b5bf701d4b57b47be73857e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-22T20:38:35Z","title_canon_sha256":"2e63c525968f1662326b338bf36b3d5c3dbe9efc7bf871dad3edb52ef0bdfeef"},"schema_version":"1.0","source":{"id":"1702.06997","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06997","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06997v2","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06997","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"pith_short_12","alias_value":"VZGDEH4MORAV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VZGDEH4MORAVVWGY","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VZGDEH4M","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:64378a678d53d22a69e60b4d49b239c80898f02d0da446355b169f5c42e7ab2e","target":"graph","created_at":"2026-05-18T00:37:47Z","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 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 ","authors_text":"Erik Waingarten, Jinyu Xie, Xi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-22T20:38:35Z","title":"Beyond Talagrand Functions: New Lower Bounds for Testing Monotonicity and Unateness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06997","kind":"arxiv","version":2},"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:e050ef4d11cc4592dceab38217c5a8c7510f16626b81c0493c2f0d05816aa485","target":"record","created_at":"2026-05-18T00:37:47Z","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":"8c26f156f3807595f29d25441a2015a14e2b9a27b5bf701d4b57b47be73857e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-22T20:38:35Z","title_canon_sha256":"2e63c525968f1662326b338bf36b3d5c3dbe9efc7bf871dad3edb52ef0bdfeef"},"schema_version":"1.0","source":{"id":"1702.06997","kind":"arxiv","version":2}},"canonical_sha256":"ae4c321f8c74415ad8d8839b47db1badc91888e77d37b1142e97068a4bc0d9da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae4c321f8c74415ad8d8839b47db1badc91888e77d37b1142e97068a4bc0d9da","first_computed_at":"2026-05-18T00:37:47.888986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:47.888986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x2Rb0jOga3lF6QPC/huChrwoEc3d/hSkVggSNMxE0+0B5lXfy8zytil343MLixWIv8SThuGxND4uwzTTH/AGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:47.889641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06997","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e050ef4d11cc4592dceab38217c5a8c7510f16626b81c0493c2f0d05816aa485","sha256:64378a678d53d22a69e60b4d49b239c80898f02d0da446355b169f5c42e7ab2e"],"state_sha256":"b541e9922d65ae3b8e72e9b737aa3d3eaea6b757e16c26bdc8202c37bdbf5d20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQqfOfDpZFiT59PvXQkJjPYevBsFwP1mSJjXEmrnRe2ju3W7fw54IL89ka9nip7QB/w977GgUh8lS2pFEHItBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T23:21:34.824441Z","bundle_sha256":"43412c1a2144affdf1b1553e111a5f8c10c6a3cb513c2b40883f292801705358"}}