{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZNW5K5Q3KGQXEMRBMIMI5KBIPB","short_pith_number":"pith:ZNW5K5Q3","schema_version":"1.0","canonical_sha256":"cb6dd5761b51a172322162188ea828787dc58e824fea5b6c72d8581810f3e289","source":{"kind":"arxiv","id":"1508.07677","version":1},"attestation_state":"computed","paper":{"title":"The Average Sensitivity of Bounded-Depth Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Benjamin Rossman","submitted_at":"2015-08-31T04:09:03Z","abstract_excerpt":"We show that unbounded fan-in boolean formulas of depth $d+1$ and size $s$ have average sensitivity $O(\\frac{1}{d}\\log s)^d$. In particular, this gives a tight $2^{\\Omega(d(n^{1/d}-1))}$ lower bound on the size of depth $d+1$ formulas computing the \\textsc{parity} function. These results strengthen the corresponding $2^{\\Omega(n^{1/d})}$ and $O(\\log s)^d$ bounds for circuits due to H{\\aa}stad (1986) and Boppana (1997). Our proof technique studies a random process where the Switching Lemma is applied to formulas in an efficient manner."},"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":"1508.07677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-31T04:09:03Z","cross_cats_sorted":[],"title_canon_sha256":"8cbb98d69e3d6cf7a1252007c70e2a73d057f67fb0cc902834de23985279cb8c","abstract_canon_sha256":"498e4b5acaf878e031dbf0e2e3a0aff81564f005ede5c836f129b6941bb6e0b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:31.687427Z","signature_b64":"3vO0k5U1IBloBIN/6kuUrnd5vY1UdRpxQoYkVrca+E8hqE2lWXqz56UAqfLsEodc6GVNXbx+xOzHGPskW8ZDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb6dd5761b51a172322162188ea828787dc58e824fea5b6c72d8581810f3e289","last_reissued_at":"2026-05-18T01:34:31.687019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:31.687019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Average Sensitivity of Bounded-Depth Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Benjamin Rossman","submitted_at":"2015-08-31T04:09:03Z","abstract_excerpt":"We show that unbounded fan-in boolean formulas of depth $d+1$ and size $s$ have average sensitivity $O(\\frac{1}{d}\\log s)^d$. In particular, this gives a tight $2^{\\Omega(d(n^{1/d}-1))}$ lower bound on the size of depth $d+1$ formulas computing the \\textsc{parity} function. These results strengthen the corresponding $2^{\\Omega(n^{1/d})}$ and $O(\\log s)^d$ bounds for circuits due to H{\\aa}stad (1986) and Boppana (1997). Our proof technique studies a random process where the Switching Lemma is applied to formulas in an efficient manner."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07677","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":"1508.07677","created_at":"2026-05-18T01:34:31.687077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.07677v1","created_at":"2026-05-18T01:34:31.687077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07677","created_at":"2026-05-18T01:34:31.687077+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNW5K5Q3KGQX","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNW5K5Q3KGQXEMRB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNW5K5Q3","created_at":"2026-05-18T12:29:52.810259+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/ZNW5K5Q3KGQXEMRBMIMI5KBIPB","json":"https://pith.science/pith/ZNW5K5Q3KGQXEMRBMIMI5KBIPB.json","graph_json":"https://pith.science/api/pith-number/ZNW5K5Q3KGQXEMRBMIMI5KBIPB/graph.json","events_json":"https://pith.science/api/pith-number/ZNW5K5Q3KGQXEMRBMIMI5KBIPB/events.json","paper":"https://pith.science/paper/ZNW5K5Q3"},"agent_actions":{"view_html":"https://pith.science/pith/ZNW5K5Q3KGQXEMRBMIMI5KBIPB","download_json":"https://pith.science/pith/ZNW5K5Q3KGQXEMRBMIMI5KBIPB.json","view_paper":"https://pith.science/paper/ZNW5K5Q3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.07677&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNW5K5Q3KGQXEMRBMIMI5KBIPB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNW5K5Q3KGQXEMRBMIMI5KBIPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNW5K5Q3KGQXEMRBMIMI5KBIPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNW5K5Q3KGQXEMRBMIMI5KBIPB/action/storage_attestation","attest_author":"https://pith.science/pith/ZNW5K5Q3KGQXEMRBMIMI5KBIPB/action/author_attestation","sign_citation":"https://pith.science/pith/ZNW5K5Q3KGQXEMRBMIMI5KBIPB/action/citation_signature","submit_replication":"https://pith.science/pith/ZNW5K5Q3KGQXEMRBMIMI5KBIPB/action/replication_record"}},"created_at":"2026-05-18T01:34:31.687077+00:00","updated_at":"2026-05-18T01:34:31.687077+00:00"}