{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EZVZT2F6H67FPVL67W7DECARB5","short_pith_number":"pith:EZVZT2F6","schema_version":"1.0","canonical_sha256":"266b99e8be3fbe57d57efdbe3208110f5474d65d86f0ed5d51addad6983e5dff","source":{"kind":"arxiv","id":"1101.5345","version":1},"attestation_state":"computed","paper":{"title":"Approximating the Influence of a monotone Boolean function in O(\\sqrt{n}) query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dana Ron, Muli Safra, Omri Weinstein, Ronitt Rubinfeld","submitted_at":"2011-01-27T17:31:59Z","abstract_excerpt":"The {\\em Total Influence} ({\\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \\ifnum\\plusminus=1 $f: \\{\\pm1\\}^n \\longrightarrow \\{\\pm1\\}$, \\else $f: \\bitset^n \\to \\bitset$, \\fi which we denote by $I[f]$. We present a randomized algorithm that approximates the influence of such functions to within a multiplicative factor of $(1\\pm \\eps)$ by performing $O(\\frac{\\sqrt{n}\\log n}{I[f]} \\poly(1/\\eps)) $ queries. % \\mnote{D: say something about technique?} We also prove a lower b"},"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":"1101.5345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-27T17:31:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b0ef153b58994b3371c5a98f4ac4ac9e58b10795fb6e1a9d586a737fb17345a1","abstract_canon_sha256":"e0330310cb2502db5d467bacd321b22ee62c807285ed8145614577fca29a9eb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:35.646697Z","signature_b64":"e1HFMOzAXOGVyjBsa+H1cftkVli1pu+pDnpN3PKbs51Nl6XDAN10qjC3Dx8Q/8lEklyS7jbg9kIRsKpMB8FMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"266b99e8be3fbe57d57efdbe3208110f5474d65d86f0ed5d51addad6983e5dff","last_reissued_at":"2026-05-18T04:30:35.646214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:35.646214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Influence of a monotone Boolean function in O(\\sqrt{n}) query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dana Ron, Muli Safra, Omri Weinstein, Ronitt Rubinfeld","submitted_at":"2011-01-27T17:31:59Z","abstract_excerpt":"The {\\em Total Influence} ({\\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \\ifnum\\plusminus=1 $f: \\{\\pm1\\}^n \\longrightarrow \\{\\pm1\\}$, \\else $f: \\bitset^n \\to \\bitset$, \\fi which we denote by $I[f]$. We present a randomized algorithm that approximates the influence of such functions to within a multiplicative factor of $(1\\pm \\eps)$ by performing $O(\\frac{\\sqrt{n}\\log n}{I[f]} \\poly(1/\\eps)) $ queries. % \\mnote{D: say something about technique?} We also prove a lower b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5345","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":"1101.5345","created_at":"2026-05-18T04:30:35.646284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5345v1","created_at":"2026-05-18T04:30:35.646284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5345","created_at":"2026-05-18T04:30:35.646284+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZVZT2F6H67F","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZVZT2F6H67FPVL6","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZVZT2F6","created_at":"2026-05-18T12:26:28.662955+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/EZVZT2F6H67FPVL67W7DECARB5","json":"https://pith.science/pith/EZVZT2F6H67FPVL67W7DECARB5.json","graph_json":"https://pith.science/api/pith-number/EZVZT2F6H67FPVL67W7DECARB5/graph.json","events_json":"https://pith.science/api/pith-number/EZVZT2F6H67FPVL67W7DECARB5/events.json","paper":"https://pith.science/paper/EZVZT2F6"},"agent_actions":{"view_html":"https://pith.science/pith/EZVZT2F6H67FPVL67W7DECARB5","download_json":"https://pith.science/pith/EZVZT2F6H67FPVL67W7DECARB5.json","view_paper":"https://pith.science/paper/EZVZT2F6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5345&json=true","fetch_graph":"https://pith.science/api/pith-number/EZVZT2F6H67FPVL67W7DECARB5/graph.json","fetch_events":"https://pith.science/api/pith-number/EZVZT2F6H67FPVL67W7DECARB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZVZT2F6H67FPVL67W7DECARB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZVZT2F6H67FPVL67W7DECARB5/action/storage_attestation","attest_author":"https://pith.science/pith/EZVZT2F6H67FPVL67W7DECARB5/action/author_attestation","sign_citation":"https://pith.science/pith/EZVZT2F6H67FPVL67W7DECARB5/action/citation_signature","submit_replication":"https://pith.science/pith/EZVZT2F6H67FPVL67W7DECARB5/action/replication_record"}},"created_at":"2026-05-18T04:30:35.646284+00:00","updated_at":"2026-05-18T04:30:35.646284+00:00"}