{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S555CUREV6TEIJAERULWPRMT75","short_pith_number":"pith:S555CURE","schema_version":"1.0","canonical_sha256":"977bd15224afa64424048d1767c593ff7a878046b5e59c089848f5b4c4c191ce","source":{"kind":"arxiv","id":"1801.02816","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Boolean Monotonicity Testing in Total Influence Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Deeparnab Chakrabarty","submitted_at":"2018-01-09T06:43:29Z","abstract_excerpt":"The problem of testing monotonicity of a Boolean function $f:\\{0,1\\}^n \\to \\{0,1\\}$ has received much attention recently. Denoting the proximity parameter by $\\varepsilon$, the best tester is the non-adaptive $\\widetilde{O}(\\sqrt{n}/\\varepsilon^2)$ tester of Khot-Minzer-Safra (FOCS 2015). Let $I(f)$ denote the total influence of $f$. We give an adaptive tester whose running time is $I(f)poly(\\varepsilon^{-1}\\log n)$."},"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":"1801.02816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-09T06:43:29Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"95ecf61219312b37364991c153ec48e49ecd10615fef25d171cc5eec245e0680","abstract_canon_sha256":"a00d4c3f09607e1de3737a37da191f7634014e198c8f8bf2662d9de77e6bf564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:22.364272Z","signature_b64":"uolo4yy5tdEkhOARdSMPnYUv2V3lAi/mmLeOCZT8w5ToYb9r56bZLCfk4zu6tD+ikv2bx/Z3hA0cyuhfQ9PDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"977bd15224afa64424048d1767c593ff7a878046b5e59c089848f5b4c4c191ce","last_reissued_at":"2026-05-18T00:26:22.363082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:22.363082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Boolean Monotonicity Testing in Total Influence Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Deeparnab Chakrabarty","submitted_at":"2018-01-09T06:43:29Z","abstract_excerpt":"The problem of testing monotonicity of a Boolean function $f:\\{0,1\\}^n \\to \\{0,1\\}$ has received much attention recently. Denoting the proximity parameter by $\\varepsilon$, the best tester is the non-adaptive $\\widetilde{O}(\\sqrt{n}/\\varepsilon^2)$ tester of Khot-Minzer-Safra (FOCS 2015). Let $I(f)$ denote the total influence of $f$. We give an adaptive tester whose running time is $I(f)poly(\\varepsilon^{-1}\\log n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02816","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":"1801.02816","created_at":"2026-05-18T00:26:22.363209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02816v1","created_at":"2026-05-18T00:26:22.363209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02816","created_at":"2026-05-18T00:26:22.363209+00:00"},{"alias_kind":"pith_short_12","alias_value":"S555CUREV6TE","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S555CUREV6TEIJAE","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S555CURE","created_at":"2026-05-18T12:32:50.500415+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/S555CUREV6TEIJAERULWPRMT75","json":"https://pith.science/pith/S555CUREV6TEIJAERULWPRMT75.json","graph_json":"https://pith.science/api/pith-number/S555CUREV6TEIJAERULWPRMT75/graph.json","events_json":"https://pith.science/api/pith-number/S555CUREV6TEIJAERULWPRMT75/events.json","paper":"https://pith.science/paper/S555CURE"},"agent_actions":{"view_html":"https://pith.science/pith/S555CUREV6TEIJAERULWPRMT75","download_json":"https://pith.science/pith/S555CUREV6TEIJAERULWPRMT75.json","view_paper":"https://pith.science/paper/S555CURE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02816&json=true","fetch_graph":"https://pith.science/api/pith-number/S555CUREV6TEIJAERULWPRMT75/graph.json","fetch_events":"https://pith.science/api/pith-number/S555CUREV6TEIJAERULWPRMT75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S555CUREV6TEIJAERULWPRMT75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S555CUREV6TEIJAERULWPRMT75/action/storage_attestation","attest_author":"https://pith.science/pith/S555CUREV6TEIJAERULWPRMT75/action/author_attestation","sign_citation":"https://pith.science/pith/S555CUREV6TEIJAERULWPRMT75/action/citation_signature","submit_replication":"https://pith.science/pith/S555CUREV6TEIJAERULWPRMT75/action/replication_record"}},"created_at":"2026-05-18T00:26:22.363209+00:00","updated_at":"2026-05-18T00:26:22.363209+00:00"}