{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:M36Q2K6G5TROWQJ5X2VNVJUTPU","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":"186513531f1563d5ddb4beae870f63bc1da96b679a842c965956bbf58ce9e6f3","cross_cats_sorted":["cs.CC","math.CO","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-17T23:52:08Z","title_canon_sha256":"565b9ba35f387d6e29e0a4af4e9929b648d358a3c191ef9660c3827a8fd053cb"},"schema_version":"1.0","source":{"id":"2203.09659","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.09659","created_at":"2026-07-05T09:23:32Z"},{"alias_kind":"arxiv_version","alias_value":"2203.09659v4","created_at":"2026-07-05T09:23:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.09659","created_at":"2026-07-05T09:23:32Z"},{"alias_kind":"pith_short_12","alias_value":"M36Q2K6G5TRO","created_at":"2026-07-05T09:23:32Z"},{"alias_kind":"pith_short_16","alias_value":"M36Q2K6G5TROWQJ5","created_at":"2026-07-05T09:23:32Z"},{"alias_kind":"pith_short_8","alias_value":"M36Q2K6G","created_at":"2026-07-05T09:23:32Z"}],"graph_snapshots":[{"event_id":"sha256:d9696e5190f59e88d5a092f786cae9a280a88fa09b517c6b2bf44dcaf1912c84","target":"graph","created_at":"2026-07-05T09:23:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.09659/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathscr{F}_{n,d}$ be the class of all functions $f:\\{-1,1\\}^n\\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which learns $\\mathscr{F}_{n,d}$ with $L_2$-accuracy $\\varepsilon$ requires at least $\\Omega((1-\\sqrt{\\varepsilon})2^d\\log n)$ queries for large enough $n$, thus establishing the sharpness as $n\\to\\infty$ of a recent upper bound of Eskenazis and Ivanisvili (2021). To do this, we show that the $L_2$-packing numbers $\\mathsf{M}(\\mathscr{F}_{n,d},\\|\\cdot\\|_{L_2},\\var","authors_text":"Alexandros Eskenazis, Lauritz Streck, Paata Ivanisvili","cross_cats":["cs.CC","math.CO","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-17T23:52:08Z","title":"Low-degree learning and the metric entropy of polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.09659","kind":"arxiv","version":4},"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:a3bc0d38d468cc51cee9a8f8babc3948d51c66d41e8210279d8b846810798dca","target":"record","created_at":"2026-07-05T09:23:32Z","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":"186513531f1563d5ddb4beae870f63bc1da96b679a842c965956bbf58ce9e6f3","cross_cats_sorted":["cs.CC","math.CO","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-17T23:52:08Z","title_canon_sha256":"565b9ba35f387d6e29e0a4af4e9929b648d358a3c191ef9660c3827a8fd053cb"},"schema_version":"1.0","source":{"id":"2203.09659","kind":"arxiv","version":4}},"canonical_sha256":"66fd0d2bc6ece2eb413dbeaadaa6937d14174e8547d565910b64220027180aaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66fd0d2bc6ece2eb413dbeaadaa6937d14174e8547d565910b64220027180aaa","first_computed_at":"2026-07-05T09:23:32.460885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:23:32.460885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4hUK9ZEut6fQeVlA8+3UE6fqaXDqfIH9InqOEYciYC9WjFalcgpM6g9mWrk9dLIAQ/d2hGXmJehOnk1LCy8OBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:23:32.461343Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.09659","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3bc0d38d468cc51cee9a8f8babc3948d51c66d41e8210279d8b846810798dca","sha256:d9696e5190f59e88d5a092f786cae9a280a88fa09b517c6b2bf44dcaf1912c84"],"state_sha256":"c1a44eb9b000c739c50edc61ed01e153637b0084aea23e006870c176a79a9ee2"}