{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:OZ65VJUGAVMBA4WS2S4IVUMI3F","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":"e2eec43601a8be4ae133bccf856712911b1c9cf7a15458f238615bb9fb6c13ed","cross_cats_sorted":["cs.CC","cs.DS","math.AG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-14T18:14:08Z","title_canon_sha256":"3a2c26823e086be04c389f6bc191abd8aaf91b640fc5039a31f7732a0eb124fb"},"schema_version":"1.0","source":{"id":"2012.07774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.07774","created_at":"2026-07-05T01:59:24Z"},{"alias_kind":"arxiv_version","alias_value":"2012.07774v1","created_at":"2026-07-05T01:59:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.07774","created_at":"2026-07-05T01:59:24Z"},{"alias_kind":"pith_short_12","alias_value":"OZ65VJUGAVMB","created_at":"2026-07-05T01:59:24Z"},{"alias_kind":"pith_short_16","alias_value":"OZ65VJUGAVMBA4WS","created_at":"2026-07-05T01:59:24Z"},{"alias_kind":"pith_short_8","alias_value":"OZ65VJUG","created_at":"2026-07-05T01:59:24Z"}],"graph_snapshots":[{"event_id":"sha256:f67594209dff5fa1b85dbf33923d7f6ff0009a9e612b4817650ea500045c92aa","target":"graph","created_at":"2026-07-05T01:59:24Z","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/2012.07774/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $V$ be any vector space of multivariate degree-$d$ homogeneous polynomials with co-dimension at most $k$, and $S$ be the set of points where all polynomials in $V$ {\\em nearly} vanish. We establish a qualitatively optimal upper bound on the size of $\\epsilon$-covers for $S$, in the $\\ell_2$-norm. Roughly speaking, we show that there exists an $\\epsilon$-cover for $S$ of cardinality $M = (k/\\epsilon)^{O_d(k^{1/d})}$. Our result is constructive yielding an algorithm to compute such an $\\epsilon$-cover that runs in time $\\mathrm{poly}(M)$.\n  Building on our structural result, we obtain signif","authors_text":"Daniel M. Kane, Ilias Diakonikolas","cross_cats":["cs.CC","cs.DS","math.AG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-14T18:14:08Z","title":"Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.07774","kind":"arxiv","version":1},"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:497a8a6e4a49c9b37f22842b9cb09f6793ac72f1c08ab376893b50b299a163c3","target":"record","created_at":"2026-07-05T01:59:24Z","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":"e2eec43601a8be4ae133bccf856712911b1c9cf7a15458f238615bb9fb6c13ed","cross_cats_sorted":["cs.CC","cs.DS","math.AG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-14T18:14:08Z","title_canon_sha256":"3a2c26823e086be04c389f6bc191abd8aaf91b640fc5039a31f7732a0eb124fb"},"schema_version":"1.0","source":{"id":"2012.07774","kind":"arxiv","version":1}},"canonical_sha256":"767ddaa68605581072d2d4b88ad188d95d11267dd355f20193324bebf78f431e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"767ddaa68605581072d2d4b88ad188d95d11267dd355f20193324bebf78f431e","first_computed_at":"2026-07-05T01:59:24.031105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:59:24.031105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ReMv5vSBxsk6YACZKXcpPfixlYcJ452+bB+MoUATo6JxwEEX2flfvPFoRvwfh0u3elsfFyhs9yOpWyUOlkhCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:59:24.031516Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.07774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:497a8a6e4a49c9b37f22842b9cb09f6793ac72f1c08ab376893b50b299a163c3","sha256:f67594209dff5fa1b85dbf33923d7f6ff0009a9e612b4817650ea500045c92aa"],"state_sha256":"2feea879863480c83a2e5379d33bf5bdece466b73c029e9752a039770b198189"}