{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UXCH4WQH7MS4MN7WWNTRSPICTD","short_pith_number":"pith:UXCH4WQH","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"},"canonical_sha256":"a5c47e5a07fb25c637f6b367193d0298d72283e9fddefa58e55ea54dc5c7df90","source":{"kind":"arxiv","id":"1904.06745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06745","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06745v1","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06745","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"pith_short_12","alias_value":"UXCH4WQH7MS4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UXCH4WQH7MS4MN7W","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UXCH4WQH","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UXCH4WQH7MS4MN7WWNTRSPICTD","target":"record","payload":{"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"},"canonical_sha256":"a5c47e5a07fb25c637f6b367193d0298d72283e9fddefa58e55ea54dc5c7df90","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"},"source_kind":"arxiv","source_id":"1904.06745","source_version":1,"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-17T23:48:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CG1MX4N0m9Jp9JbzS8oLMZWERA15u0nnW+cyiqmZ+FOVFT3WnTFr+1QNeVu9OyMkc1IJ3YsiRK4i8iAisbF3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:57:20.830350Z"},"content_sha256":"07579fa8c80dc162e6a03938aa8b13c18a4600cb9e875f832188e70470eff305","schema_version":"1.0","event_id":"sha256:07579fa8c80dc162e6a03938aa8b13c18a4600cb9e875f832188e70470eff305"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UXCH4WQH7MS4MN7WWNTRSPICTD","target":"graph","payload":{"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"},"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-17T23:48:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a21CmmGZvUUmkZDe4kLHK5SkSgOr+YysWgZuinrZf8QkdvsTqsWz2gFNxiELTkRN9925uZkWD8msB/EJMf38CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:57:20.831002Z"},"content_sha256":"f31a280495c8a8691879532885f7887123d62d43d055c5cc3f207aad20cf0e33","schema_version":"1.0","event_id":"sha256:f31a280495c8a8691879532885f7887123d62d43d055c5cc3f207aad20cf0e33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/bundle.json","state_url":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/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-05-27T17:57:20Z","links":{"resolver":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD","bundle":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/bundle.json","state":"https://pith.science/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UXCH4WQH7MS4MN7WWNTRSPICTD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UXCH4WQH7MS4MN7WWNTRSPICTD","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":"fcfb495ecc4755e9024d82c7a9c7fe69ef90df211cf0d3418d2daf41cc3b9693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-14T19:37:05Z","title_canon_sha256":"bef4dcad0a3888ec599f705fa945305035d654e1541f4e675fb68168dcd9b751"},"schema_version":"1.0","source":{"id":"1904.06745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06745","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06745v1","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06745","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"pith_short_12","alias_value":"UXCH4WQH7MS4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UXCH4WQH7MS4MN7W","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UXCH4WQH","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:f31a280495c8a8691879532885f7887123d62d43d055c5cc3f207aad20cf0e33","target":"graph","created_at":"2026-05-17T23:48:36Z","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":"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","authors_text":"Arsen Vasilyan, Ronitt Rubinfeld","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-14T19:37:05Z","title":"Approximating the noise sensitivity of a monotone Boolean function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06745","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:07579fa8c80dc162e6a03938aa8b13c18a4600cb9e875f832188e70470eff305","target":"record","created_at":"2026-05-17T23:48:36Z","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":"fcfb495ecc4755e9024d82c7a9c7fe69ef90df211cf0d3418d2daf41cc3b9693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-14T19:37:05Z","title_canon_sha256":"bef4dcad0a3888ec599f705fa945305035d654e1541f4e675fb68168dcd9b751"},"schema_version":"1.0","source":{"id":"1904.06745","kind":"arxiv","version":1}},"canonical_sha256":"a5c47e5a07fb25c637f6b367193d0298d72283e9fddefa58e55ea54dc5c7df90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5c47e5a07fb25c637f6b367193d0298d72283e9fddefa58e55ea54dc5c7df90","first_computed_at":"2026-05-17T23:48:36.342297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:36.342297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CeXUFnMWsK64YDFUpSP2th61FjNDV0UI/5pkQlRounIQbrrj8kVMKPmm1JJ024pF+QSCIHUonGGYn23MlEZeCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:36.342996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07579fa8c80dc162e6a03938aa8b13c18a4600cb9e875f832188e70470eff305","sha256:f31a280495c8a8691879532885f7887123d62d43d055c5cc3f207aad20cf0e33"],"state_sha256":"e47c9113ff2c751f137e60c0187e5d4430b09f4d7ba3498e200aa1a879aefb1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyxHCEvF03H0Isw9hKKCc44IaHcVFJCpqn90Nb2PTAmYQww/AUJm4Vl223coj55FEh3DuG4lDsKJIAE0v3dYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:57:20.833931Z","bundle_sha256":"c2da47afa3c4c12078a90103559c02dbe30473c71c53271932790ccd8f51a7c4"}}