{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QXUPRPXVKJPMZXTX4RZXJ4K6CF","short_pith_number":"pith:QXUPRPXV","schema_version":"1.0","canonical_sha256":"85e8f8bef5525eccde77e47374f15e1173c20f7e02ba7bc495fe739648ed37fc","source":{"kind":"arxiv","id":"1906.00326","version":1},"attestation_state":"computed","paper":{"title":"Approximate degree, secret sharing, and concentration phenomena","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrej Bogdanov, Christopher Williamson, Justin Thaler, Nikhil S. Mande","submitted_at":"2019-06-02T02:17:18Z","abstract_excerpt":"The $\\epsilon$-approximate degree $deg_\\epsilon(f)$ of a Boolean function $f$ is the least degree of a real-valued polynomial that approximates $f$ pointwise to error $\\epsilon$. The approximate degree of $f$ is at least $k$ iff there exists a pair of probability distributions, also known as a dual polynomial, that are perfectly $k$-wise indistinguishable, but are distinguishable by $f$ with advantage $1 - \\epsilon$. Our contributions are:\n  We give a simple new construction of a dual polynomial for the AND function, certifying that $deg_\\epsilon(f) \\geq \\Omega(\\sqrt{n \\log 1/\\epsilon})$. This"},"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":"1906.00326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-06-02T02:17:18Z","cross_cats_sorted":[],"title_canon_sha256":"c916d5fbc9103318e16949c4218dd22b6f92c0158b8e833a1bc7cc4bf7fd2a35","abstract_canon_sha256":"d773240bf072323d3004a013a44bd63796b62d5c61f46ca97b7bc00ff02db3f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:27.428279Z","signature_b64":"W6Z5/DcdDw3ptZNmMxB8pM0JsaT2g85RouMUfCydWEdhjCE0RI/7q6X4vM0AJWQLdJgPaS4BGMMWQIR+RRJzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85e8f8bef5525eccde77e47374f15e1173c20f7e02ba7bc495fe739648ed37fc","last_reissued_at":"2026-05-17T23:44:27.427739Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:27.427739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate degree, secret sharing, and concentration phenomena","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrej Bogdanov, Christopher Williamson, Justin Thaler, Nikhil S. Mande","submitted_at":"2019-06-02T02:17:18Z","abstract_excerpt":"The $\\epsilon$-approximate degree $deg_\\epsilon(f)$ of a Boolean function $f$ is the least degree of a real-valued polynomial that approximates $f$ pointwise to error $\\epsilon$. The approximate degree of $f$ is at least $k$ iff there exists a pair of probability distributions, also known as a dual polynomial, that are perfectly $k$-wise indistinguishable, but are distinguishable by $f$ with advantage $1 - \\epsilon$. Our contributions are:\n  We give a simple new construction of a dual polynomial for the AND function, certifying that $deg_\\epsilon(f) \\geq \\Omega(\\sqrt{n \\log 1/\\epsilon})$. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00326","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":"1906.00326","created_at":"2026-05-17T23:44:27.427825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00326v1","created_at":"2026-05-17T23:44:27.427825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00326","created_at":"2026-05-17T23:44:27.427825+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXUPRPXVKJPM","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXUPRPXVKJPMZXTX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXUPRPXV","created_at":"2026-05-18T12:33:27.125529+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/QXUPRPXVKJPMZXTX4RZXJ4K6CF","json":"https://pith.science/pith/QXUPRPXVKJPMZXTX4RZXJ4K6CF.json","graph_json":"https://pith.science/api/pith-number/QXUPRPXVKJPMZXTX4RZXJ4K6CF/graph.json","events_json":"https://pith.science/api/pith-number/QXUPRPXVKJPMZXTX4RZXJ4K6CF/events.json","paper":"https://pith.science/paper/QXUPRPXV"},"agent_actions":{"view_html":"https://pith.science/pith/QXUPRPXVKJPMZXTX4RZXJ4K6CF","download_json":"https://pith.science/pith/QXUPRPXVKJPMZXTX4RZXJ4K6CF.json","view_paper":"https://pith.science/paper/QXUPRPXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00326&json=true","fetch_graph":"https://pith.science/api/pith-number/QXUPRPXVKJPMZXTX4RZXJ4K6CF/graph.json","fetch_events":"https://pith.science/api/pith-number/QXUPRPXVKJPMZXTX4RZXJ4K6CF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXUPRPXVKJPMZXTX4RZXJ4K6CF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXUPRPXVKJPMZXTX4RZXJ4K6CF/action/storage_attestation","attest_author":"https://pith.science/pith/QXUPRPXVKJPMZXTX4RZXJ4K6CF/action/author_attestation","sign_citation":"https://pith.science/pith/QXUPRPXVKJPMZXTX4RZXJ4K6CF/action/citation_signature","submit_replication":"https://pith.science/pith/QXUPRPXVKJPMZXTX4RZXJ4K6CF/action/replication_record"}},"created_at":"2026-05-17T23:44:27.427825+00:00","updated_at":"2026-05-17T23:44:27.427825+00:00"}