{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CQE5SBULXHZAF6NADIG3JDG35P","short_pith_number":"pith:CQE5SBUL","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"},"canonical_sha256":"1409d9068bb9f202f9a01a0db48cdbebc1dc39727fb72644f936aa6b162332f9","source":{"kind":"arxiv","id":"1504.03398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03398","created_at":"2026-05-18T02:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03398v1","created_at":"2026-05-18T02:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03398","created_at":"2026-05-18T02:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"CQE5SBULXHZA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CQE5SBULXHZAF6NA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CQE5SBUL","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CQE5SBULXHZAF6NADIG3JDG35P","target":"record","payload":{"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"},"canonical_sha256":"1409d9068bb9f202f9a01a0db48cdbebc1dc39727fb72644f936aa6b162332f9","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"},"source_kind":"arxiv","source_id":"1504.03398","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-18T02:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6c52upWcTOZTDoSnMIhrppxqPFjd2VJ89EE5VmaAdF222HPZFT7WZGILHqLx5STFikRSjHQ9yYXzC+PuZq+rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:47:34.458046Z"},"content_sha256":"aa39052276767783dba1eaee0459b0c5b4d4b48b581db62478ea215fb4cc220c","schema_version":"1.0","event_id":"sha256:aa39052276767783dba1eaee0459b0c5b4d4b48b581db62478ea215fb4cc220c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CQE5SBULXHZAF6NADIG3JDG35P","target":"graph","payload":{"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"},"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-18T02:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVpoFuB5VhlJg7ku+xTbLNfTawi6/Jh1jQPGvWPeQus2qrkib4a9QzVp+pn39JI1/1r/TKsE0F0PVL0Zdow9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:47:34.458539Z"},"content_sha256":"07f07b4e88d5e8d51f31414413b57f58dac3ff812c01d2430ec5d81f93214b70","schema_version":"1.0","event_id":"sha256:07f07b4e88d5e8d51f31414413b57f58dac3ff812c01d2430ec5d81f93214b70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P/bundle.json","state_url":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQE5SBULXHZAF6NADIG3JDG35P/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-25T22:47:34Z","links":{"resolver":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P","bundle":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P/bundle.json","state":"https://pith.science/pith/CQE5SBULXHZAF6NADIG3JDG35P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQE5SBULXHZAF6NADIG3JDG35P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CQE5SBULXHZAF6NADIG3JDG35P","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":"74d427ba916cffd3938d94e8f43b08104b64b10827af12fdedd7b369d4fa9a2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-14T01:44:39Z","title_canon_sha256":"88b20b9354252ff7e73b5efb17593c3b64bbc929a0be12150950b2e2ac07ba84"},"schema_version":"1.0","source":{"id":"1504.03398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03398","created_at":"2026-05-18T02:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03398v1","created_at":"2026-05-18T02:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03398","created_at":"2026-05-18T02:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"CQE5SBULXHZA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CQE5SBULXHZAF6NA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CQE5SBUL","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:07f07b4e88d5e8d51f31414413b57f58dac3ff812c01d2430ec5d81f93214b70","target":"graph","created_at":"2026-05-18T02:18:52Z","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":"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","authors_text":"Benjamin Rossman, Li-Yang Tan, Rocco A. Servedio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-14T01:44:39Z","title":"An average-case depth hierarchy theorem for Boolean circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03398","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:aa39052276767783dba1eaee0459b0c5b4d4b48b581db62478ea215fb4cc220c","target":"record","created_at":"2026-05-18T02:18:52Z","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":"74d427ba916cffd3938d94e8f43b08104b64b10827af12fdedd7b369d4fa9a2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-14T01:44:39Z","title_canon_sha256":"88b20b9354252ff7e73b5efb17593c3b64bbc929a0be12150950b2e2ac07ba84"},"schema_version":"1.0","source":{"id":"1504.03398","kind":"arxiv","version":1}},"canonical_sha256":"1409d9068bb9f202f9a01a0db48cdbebc1dc39727fb72644f936aa6b162332f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1409d9068bb9f202f9a01a0db48cdbebc1dc39727fb72644f936aa6b162332f9","first_computed_at":"2026-05-18T02:18:52.299200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:52.299200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K4ckJr1JmSVWQoSEG4tV0GhungZ5MAmfrIlpBwiJXt3iFsl4EHFvuUe5UBV05cJ3G5Y1hKHMVOebWRVS+QE1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:52.299653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa39052276767783dba1eaee0459b0c5b4d4b48b581db62478ea215fb4cc220c","sha256:07f07b4e88d5e8d51f31414413b57f58dac3ff812c01d2430ec5d81f93214b70"],"state_sha256":"951065b3f7bf487fc1b06a5afdf720105920f3e67854478c3c67b7696fae6166"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6GGYi0hJywdSod+lgx79U9BLu0yRgwh516WvUzn9qL/GloRRFoMynZEo2THgSaSaYVNomcqHxL4yWOBlQqUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:47:34.462159Z","bundle_sha256":"241cd668df3a98835af6bb9d40c5eda02c9677487d844717cf76a34b4e5b5953"}}