{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CQE5SBULXHZAF6NADIG3JDG35P","short_pith_number":"pith:CQE5SBUL","schema_version":"1.0","canonical_sha256":"1409d9068bb9f202f9a01a0db48cdbebc1dc39727fb72644f936aa6b162332f9","source":{"kind":"arxiv","id":"1504.03398","version":1},"attestation_state":"computed","paper":{"title":"An average-case depth hierarchy theorem for Boolean circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Benjamin Rossman, Li-Yang Tan, Rocco A. Servedio","submitted_at":"2015-04-14T01:44:39Z","abstract_excerpt":"We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of $\\mathsf{AND}$, $\\mathsf{OR}$, and $\\mathsf{NOT}$ gates. Our hierarchy theorem says that for every $d \\geq 2$, there is an explicit $n$-variable Boolean function $f$, computed by a linear-size depth-$d$ formula, which is such that any depth-$(d-1)$ circuit that agrees with $f$ on $(1/2 + o_n(1))$ fraction of all inputs must have size $\\exp({n^{\\Omega(1/d)}}).$ This answers an open question posed by H{\\aa}stad in his Ph.D. thesis.\n  Our average-case depth hierarchy theorem implies that the polynomia"},"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":"1504.03398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-14T01:44:39Z","cross_cats_sorted":[],"title_canon_sha256":"88b20b9354252ff7e73b5efb17593c3b64bbc929a0be12150950b2e2ac07ba84","abstract_canon_sha256":"74d427ba916cffd3938d94e8f43b08104b64b10827af12fdedd7b369d4fa9a2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:52.299653Z","signature_b64":"K4ckJr1JmSVWQoSEG4tV0GhungZ5MAmfrIlpBwiJXt3iFsl4EHFvuUe5UBV05cJ3G5Y1hKHMVOebWRVS+QE1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1409d9068bb9f202f9a01a0db48cdbebc1dc39727fb72644f936aa6b162332f9","last_reissued_at":"2026-05-18T02:18:52.299200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:52.299200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An average-case depth hierarchy theorem for Boolean circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Benjamin Rossman, Li-Yang Tan, Rocco A. Servedio","submitted_at":"2015-04-14T01:44:39Z","abstract_excerpt":"We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of $\\mathsf{AND}$, $\\mathsf{OR}$, and $\\mathsf{NOT}$ gates. Our hierarchy theorem says that for every $d \\geq 2$, there is an explicit $n$-variable Boolean function $f$, computed by a linear-size depth-$d$ formula, which is such that any depth-$(d-1)$ circuit that agrees with $f$ on $(1/2 + o_n(1))$ fraction of all inputs must have size $\\exp({n^{\\Omega(1/d)}}).$ This answers an open question posed by H{\\aa}stad in his Ph.D. thesis.\n  Our average-case depth hierarchy theorem implies that the polynomia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03398","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":"1504.03398","created_at":"2026-05-18T02:18:52.299267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03398v1","created_at":"2026-05-18T02:18:52.299267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03398","created_at":"2026-05-18T02:18:52.299267+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQE5SBULXHZA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQE5SBULXHZAF6NA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQE5SBUL","created_at":"2026-05-18T12:29:17.054201+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/CQE5SBULXHZAF6NADIG3JDG35P","json":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P.json","graph_json":"https://pith.science/api/pith-number/CQE5SBULXHZAF6NADIG3JDG35P/graph.json","events_json":"https://pith.science/api/pith-number/CQE5SBULXHZAF6NADIG3JDG35P/events.json","paper":"https://pith.science/paper/CQE5SBUL"},"agent_actions":{"view_html":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P","download_json":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P.json","view_paper":"https://pith.science/paper/CQE5SBUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03398&json=true","fetch_graph":"https://pith.science/api/pith-number/CQE5SBULXHZAF6NADIG3JDG35P/graph.json","fetch_events":"https://pith.science/api/pith-number/CQE5SBULXHZAF6NADIG3JDG35P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P/action/storage_attestation","attest_author":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P/action/author_attestation","sign_citation":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P/action/citation_signature","submit_replication":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P/action/replication_record"}},"created_at":"2026-05-18T02:18:52.299267+00:00","updated_at":"2026-05-18T02:18:52.299267+00:00"}