{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EHUN63EVYTF2LFVELS4WXGWRBI","short_pith_number":"pith:EHUN63EV","schema_version":"1.0","canonical_sha256":"21e8df6c95c4cba596a45cb96b9ad10a04bf75c10df7925cb930f2ab5d00597d","source":{"kind":"arxiv","id":"1311.1616","version":4},"attestation_state":"computed","paper":{"title":"Hardness Amplification and the Approximate Degree of Constant-Depth Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Justin Thaler, Mark Bun","submitted_at":"2013-11-07T09:26:48Z","abstract_excerpt":"We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials. Specifically, we show that if a Boolean circuit cannot be pointwise approximated by low-degree polynomials to within constant error in a certain one-sided sense, then an OR of disjoint copies of that circuit cannot be pointwise approximated even with very high error. As our main application, we show that for every sequence of degrees $d(n)$, there is an explicit depth-three circuit $F: \\{-1,1\\}^n \\to \\{-1,1\\}$ of polynomial-size such that any degree-$d$ polynomial ca"},"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":"1311.1616","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-07T09:26:48Z","cross_cats_sorted":[],"title_canon_sha256":"28f142c18c0767d3b94992ec00c0f1b5167e6b184e2b18dc08cd7bf069c1b39f","abstract_canon_sha256":"7eb980820879591145129b32b6272d6517d40cd77d19c40fba63ea88a734fb35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:07.809532Z","signature_b64":"xs34F8CZrPvpi1dpx/LuvOvnPFRbkLniOHkpyf/CWZEpCTLSL/lF1+/e8s5NpuCXGUHiGErlJM7f5/N4u3XfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21e8df6c95c4cba596a45cb96b9ad10a04bf75c10df7925cb930f2ab5d00597d","last_reissued_at":"2026-05-18T02:53:07.808805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:07.808805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness Amplification and the Approximate Degree of Constant-Depth Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Justin Thaler, Mark Bun","submitted_at":"2013-11-07T09:26:48Z","abstract_excerpt":"We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials. Specifically, we show that if a Boolean circuit cannot be pointwise approximated by low-degree polynomials to within constant error in a certain one-sided sense, then an OR of disjoint copies of that circuit cannot be pointwise approximated even with very high error. As our main application, we show that for every sequence of degrees $d(n)$, there is an explicit depth-three circuit $F: \\{-1,1\\}^n \\to \\{-1,1\\}$ of polynomial-size such that any degree-$d$ polynomial ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1616","kind":"arxiv","version":4},"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":"1311.1616","created_at":"2026-05-18T02:53:07.808928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1616v4","created_at":"2026-05-18T02:53:07.808928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1616","created_at":"2026-05-18T02:53:07.808928+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHUN63EVYTF2","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHUN63EVYTF2LFVE","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHUN63EV","created_at":"2026-05-18T12:27:43.054852+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/EHUN63EVYTF2LFVELS4WXGWRBI","json":"https://pith.science/pith/EHUN63EVYTF2LFVELS4WXGWRBI.json","graph_json":"https://pith.science/api/pith-number/EHUN63EVYTF2LFVELS4WXGWRBI/graph.json","events_json":"https://pith.science/api/pith-number/EHUN63EVYTF2LFVELS4WXGWRBI/events.json","paper":"https://pith.science/paper/EHUN63EV"},"agent_actions":{"view_html":"https://pith.science/pith/EHUN63EVYTF2LFVELS4WXGWRBI","download_json":"https://pith.science/pith/EHUN63EVYTF2LFVELS4WXGWRBI.json","view_paper":"https://pith.science/paper/EHUN63EV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1616&json=true","fetch_graph":"https://pith.science/api/pith-number/EHUN63EVYTF2LFVELS4WXGWRBI/graph.json","fetch_events":"https://pith.science/api/pith-number/EHUN63EVYTF2LFVELS4WXGWRBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHUN63EVYTF2LFVELS4WXGWRBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHUN63EVYTF2LFVELS4WXGWRBI/action/storage_attestation","attest_author":"https://pith.science/pith/EHUN63EVYTF2LFVELS4WXGWRBI/action/author_attestation","sign_citation":"https://pith.science/pith/EHUN63EVYTF2LFVELS4WXGWRBI/action/citation_signature","submit_replication":"https://pith.science/pith/EHUN63EVYTF2LFVELS4WXGWRBI/action/replication_record"}},"created_at":"2026-05-18T02:53:07.808928+00:00","updated_at":"2026-05-18T02:53:07.808928+00:00"}