{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UXCH4WQH7MS4MN7WWNTRSPICTD","short_pith_number":"pith:UXCH4WQH","schema_version":"1.0","canonical_sha256":"a5c47e5a07fb25c637f6b367193d0298d72283e9fddefa58e55ea54dc5c7df90","source":{"kind":"arxiv","id":"1904.06745","version":1},"attestation_state":"computed","paper":{"title":"Approximating the noise sensitivity of a monotone Boolean function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arsen Vasilyan, Ronitt Rubinfeld","submitted_at":"2019-04-14T19:37:05Z","abstract_excerpt":"The noise sensitivity of a Boolean function $f: \\{0,1\\}^n \\rightarrow \\{0,1\\}$ is one of its fundamental properties. A function of a positive noise parameter $\\delta$, it is denoted as $NS_{\\delta}[f]$. Here we study the algorithmic problem of approximating it for monotone $f$, such that $NS_{\\delta}[f] \\geq 1/n^{C}$ for constant $C$, and where $\\delta$ satisfies $1/n \\leq \\delta \\leq 1/2$. For such $f$ and $\\delta$, we give a randomized algorithm performing $O\\left(\\frac{\\min(1,\\sqrt{n} \\delta \\log^{1.5} n) }{NS_{\\delta}[f]} \\text{poly}\\left(\\frac{1}{\\epsilon}\\right)\\right)$ queries and appro"},"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":"1904.06745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-14T19:37:05Z","cross_cats_sorted":[],"title_canon_sha256":"bef4dcad0a3888ec599f705fa945305035d654e1541f4e675fb68168dcd9b751","abstract_canon_sha256":"fcfb495ecc4755e9024d82c7a9c7fe69ef90df211cf0d3418d2daf41cc3b9693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:36.342996Z","signature_b64":"CeXUFnMWsK64YDFUpSP2th61FjNDV0UI/5pkQlRounIQbrrj8kVMKPmm1JJ024pF+QSCIHUonGGYn23MlEZeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5c47e5a07fb25c637f6b367193d0298d72283e9fddefa58e55ea54dc5c7df90","last_reissued_at":"2026-05-17T23:48:36.342297Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:36.342297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the noise sensitivity of a monotone Boolean function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arsen Vasilyan, Ronitt Rubinfeld","submitted_at":"2019-04-14T19:37:05Z","abstract_excerpt":"The noise sensitivity of a Boolean function $f: \\{0,1\\}^n \\rightarrow \\{0,1\\}$ is one of its fundamental properties. A function of a positive noise parameter $\\delta$, it is denoted as $NS_{\\delta}[f]$. Here we study the algorithmic problem of approximating it for monotone $f$, such that $NS_{\\delta}[f] \\geq 1/n^{C}$ for constant $C$, and where $\\delta$ satisfies $1/n \\leq \\delta \\leq 1/2$. For such $f$ and $\\delta$, we give a randomized algorithm performing $O\\left(\\frac{\\min(1,\\sqrt{n} \\delta \\log^{1.5} n) }{NS_{\\delta}[f]} \\text{poly}\\left(\\frac{1}{\\epsilon}\\right)\\right)$ queries and appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06745","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":"1904.06745","created_at":"2026-05-17T23:48:36.342418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06745v1","created_at":"2026-05-17T23:48:36.342418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06745","created_at":"2026-05-17T23:48:36.342418+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXCH4WQH7MS4","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXCH4WQH7MS4MN7W","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXCH4WQH","created_at":"2026-05-18T12:33:30.264802+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/UXCH4WQH7MS4MN7WWNTRSPICTD","json":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD.json","graph_json":"https://pith.science/api/pith-number/UXCH4WQH7MS4MN7WWNTRSPICTD/graph.json","events_json":"https://pith.science/api/pith-number/UXCH4WQH7MS4MN7WWNTRSPICTD/events.json","paper":"https://pith.science/paper/UXCH4WQH"},"agent_actions":{"view_html":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD","download_json":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD.json","view_paper":"https://pith.science/paper/UXCH4WQH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06745&json=true","fetch_graph":"https://pith.science/api/pith-number/UXCH4WQH7MS4MN7WWNTRSPICTD/graph.json","fetch_events":"https://pith.science/api/pith-number/UXCH4WQH7MS4MN7WWNTRSPICTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/action/storage_attestation","attest_author":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/action/author_attestation","sign_citation":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/action/citation_signature","submit_replication":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/action/replication_record"}},"created_at":"2026-05-17T23:48:36.342418+00:00","updated_at":"2026-05-17T23:48:36.342418+00:00"}