{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HCC4VJFG5JHIUAIUL6SUS5O5UL","short_pith_number":"pith:HCC4VJFG","schema_version":"1.0","canonical_sha256":"3885caa4a6ea4e8a01145fa54975dda2d8c7684edad54e0b37422997b5457e26","source":{"kind":"arxiv","id":"2606.17319","version":1},"attestation_state":"computed","paper":{"title":"Tight $L_\\infty$ Sample Complexity for Low-Degree and Sparse Boolean Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.CO","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Jasper van Doornmalen, Jos\\'e Verschae, Mathieu Molina, Victor Verdugo","submitted_at":"2026-06-15T22:00:03Z","abstract_excerpt":"Motivated by the optimization of bounded binary black-box functions, we study the problem of learning polynomial surrogates over the Boolean hypercube. To ensure that optimizing the surrogate yields good solutions for the underlying objective, we require uniform $L_\\infty$-error guarantees rather than the usual $L_2$-type guarantees. We characterize the minimax sample complexity of uniform estimation under subgaussian noise for two classes of bounded polynomials. First, for polynomials of degree at most $d$ on $n$ variables, the sample complexity scales as $n^{d+1}$. Second, for $s$-sparse Fou"},"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":"2606.17319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-06-15T22:00:03Z","cross_cats_sorted":["cs.LG","math.CO","math.ST","stat.TH"],"title_canon_sha256":"9c5dd3be63ec5bc3b90c61503aa4ec953e08840fa4cfacac30a826cd51eb46b9","abstract_canon_sha256":"ffb9a999093f050877ca9a77ad1363aba5c759825c094302cdf7a21ceb535201"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:08.893650Z","signature_b64":"jSvx01jEmzBIi8PVhPjcIkdmUBBmZ5J8WSR3eqosyht1EHDzT93SzCU5eBjfuzMdohgPFQQ7onE0GdX6o54NBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3885caa4a6ea4e8a01145fa54975dda2d8c7684edad54e0b37422997b5457e26","last_reissued_at":"2026-06-19T16:10:08.893291Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:08.893291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight $L_\\infty$ Sample Complexity for Low-Degree and Sparse Boolean Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.CO","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Jasper van Doornmalen, Jos\\'e Verschae, Mathieu Molina, Victor Verdugo","submitted_at":"2026-06-15T22:00:03Z","abstract_excerpt":"Motivated by the optimization of bounded binary black-box functions, we study the problem of learning polynomial surrogates over the Boolean hypercube. To ensure that optimizing the surrogate yields good solutions for the underlying objective, we require uniform $L_\\infty$-error guarantees rather than the usual $L_2$-type guarantees. We characterize the minimax sample complexity of uniform estimation under subgaussian noise for two classes of bounded polynomials. First, for polynomials of degree at most $d$ on $n$ variables, the sample complexity scales as $n^{d+1}$. Second, for $s$-sparse Fou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17319","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.17319/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.17319","created_at":"2026-06-19T16:10:08.893367+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.17319v1","created_at":"2026-06-19T16:10:08.893367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17319","created_at":"2026-06-19T16:10:08.893367+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCC4VJFG5JHI","created_at":"2026-06-19T16:10:08.893367+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCC4VJFG5JHIUAIU","created_at":"2026-06-19T16:10:08.893367+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCC4VJFG","created_at":"2026-06-19T16:10:08.893367+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/HCC4VJFG5JHIUAIUL6SUS5O5UL","json":"https://pith.science/pith/HCC4VJFG5JHIUAIUL6SUS5O5UL.json","graph_json":"https://pith.science/api/pith-number/HCC4VJFG5JHIUAIUL6SUS5O5UL/graph.json","events_json":"https://pith.science/api/pith-number/HCC4VJFG5JHIUAIUL6SUS5O5UL/events.json","paper":"https://pith.science/paper/HCC4VJFG"},"agent_actions":{"view_html":"https://pith.science/pith/HCC4VJFG5JHIUAIUL6SUS5O5UL","download_json":"https://pith.science/pith/HCC4VJFG5JHIUAIUL6SUS5O5UL.json","view_paper":"https://pith.science/paper/HCC4VJFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.17319&json=true","fetch_graph":"https://pith.science/api/pith-number/HCC4VJFG5JHIUAIUL6SUS5O5UL/graph.json","fetch_events":"https://pith.science/api/pith-number/HCC4VJFG5JHIUAIUL6SUS5O5UL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCC4VJFG5JHIUAIUL6SUS5O5UL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCC4VJFG5JHIUAIUL6SUS5O5UL/action/storage_attestation","attest_author":"https://pith.science/pith/HCC4VJFG5JHIUAIUL6SUS5O5UL/action/author_attestation","sign_citation":"https://pith.science/pith/HCC4VJFG5JHIUAIUL6SUS5O5UL/action/citation_signature","submit_replication":"https://pith.science/pith/HCC4VJFG5JHIUAIUL6SUS5O5UL/action/replication_record"}},"created_at":"2026-06-19T16:10:08.893367+00:00","updated_at":"2026-06-19T16:10:08.893367+00:00"}