{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V4HIAC7UJFDVW2TR7A2ZBPDMVA","short_pith_number":"pith:V4HIAC7U","schema_version":"1.0","canonical_sha256":"af0e800bf449475b6a71f83590bc6ca8314180f443398d399cab00b517b448fd","source":{"kind":"arxiv","id":"1703.05784","version":1},"attestation_state":"computed","paper":{"title":"A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Justin Thaler, Mark Bun","submitted_at":"2017-03-16T18:18:51Z","abstract_excerpt":"The approximate degree of a Boolean function $f \\colon \\{-1, 1\\}^n \\rightarrow \\{-1, 1\\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the approximate degree of a given function, while preserving its computability by constant-depth circuits.\n  Specifically, we show how to transform any Boolean function $f$ with approximate degree $d$ into a function $F$ on $O(n \\cdot \\operatorname{polylog}(n))$ variables with approximate degree at least $D = \\Omega(n^{1/3} \\cdot d^{2/3})$. In particular, if $d= n^{"},"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":"1703.05784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-16T18:18:51Z","cross_cats_sorted":[],"title_canon_sha256":"bd142e77dcc3a01f10ee8c3e1a3b7721429366ed9798dfa984f23e63d036d481","abstract_canon_sha256":"c367ed0244e26a910f0728b488dd232806ce105871e0502b76ce141c261bc3c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:32.105514Z","signature_b64":"9obt7Og2KRGnjYBjp0G8qMzOwfzxPSHthtLLOvV2ln8tHOw9hhb2D23ngDx6Gyz6Awjgm98xsPRmT3zEMEizDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af0e800bf449475b6a71f83590bc6ca8314180f443398d399cab00b517b448fd","last_reissued_at":"2026-05-18T00:48:32.104897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:32.104897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Justin Thaler, Mark Bun","submitted_at":"2017-03-16T18:18:51Z","abstract_excerpt":"The approximate degree of a Boolean function $f \\colon \\{-1, 1\\}^n \\rightarrow \\{-1, 1\\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the approximate degree of a given function, while preserving its computability by constant-depth circuits.\n  Specifically, we show how to transform any Boolean function $f$ with approximate degree $d$ into a function $F$ on $O(n \\cdot \\operatorname{polylog}(n))$ variables with approximate degree at least $D = \\Omega(n^{1/3} \\cdot d^{2/3})$. In particular, if $d= n^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05784","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":"1703.05784","created_at":"2026-05-18T00:48:32.104988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05784v1","created_at":"2026-05-18T00:48:32.104988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05784","created_at":"2026-05-18T00:48:32.104988+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4HIAC7UJFDV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4HIAC7UJFDVW2TR","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4HIAC7U","created_at":"2026-05-18T12:31:49.984773+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/V4HIAC7UJFDVW2TR7A2ZBPDMVA","json":"https://pith.science/pith/V4HIAC7UJFDVW2TR7A2ZBPDMVA.json","graph_json":"https://pith.science/api/pith-number/V4HIAC7UJFDVW2TR7A2ZBPDMVA/graph.json","events_json":"https://pith.science/api/pith-number/V4HIAC7UJFDVW2TR7A2ZBPDMVA/events.json","paper":"https://pith.science/paper/V4HIAC7U"},"agent_actions":{"view_html":"https://pith.science/pith/V4HIAC7UJFDVW2TR7A2ZBPDMVA","download_json":"https://pith.science/pith/V4HIAC7UJFDVW2TR7A2ZBPDMVA.json","view_paper":"https://pith.science/paper/V4HIAC7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05784&json=true","fetch_graph":"https://pith.science/api/pith-number/V4HIAC7UJFDVW2TR7A2ZBPDMVA/graph.json","fetch_events":"https://pith.science/api/pith-number/V4HIAC7UJFDVW2TR7A2ZBPDMVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4HIAC7UJFDVW2TR7A2ZBPDMVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4HIAC7UJFDVW2TR7A2ZBPDMVA/action/storage_attestation","attest_author":"https://pith.science/pith/V4HIAC7UJFDVW2TR7A2ZBPDMVA/action/author_attestation","sign_citation":"https://pith.science/pith/V4HIAC7UJFDVW2TR7A2ZBPDMVA/action/citation_signature","submit_replication":"https://pith.science/pith/V4HIAC7UJFDVW2TR7A2ZBPDMVA/action/replication_record"}},"created_at":"2026-05-18T00:48:32.104988+00:00","updated_at":"2026-05-18T00:48:32.104988+00:00"}