{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DNVJQY6A35ZUBVLWP4V3ESQRYS","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":"95e1d9a3a0273a518acab96319bad7bf25a447a38b63aa447425ab95045991c9","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-22T17:53:54Z","title_canon_sha256":"076d0abaeadd0993ef74ff790ff61c49e7bf1a8177991221a8e7ea59b1e3f9a0"},"schema_version":"1.0","source":{"id":"2006.12476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.12476","created_at":"2026-07-05T01:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"2006.12476v1","created_at":"2026-07-05T01:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.12476","created_at":"2026-07-05T01:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"DNVJQY6A35ZU","created_at":"2026-07-05T01:12:00Z"},{"alias_kind":"pith_short_16","alias_value":"DNVJQY6A35ZUBVLW","created_at":"2026-07-05T01:12:00Z"},{"alias_kind":"pith_short_8","alias_value":"DNVJQY6A","created_at":"2026-07-05T01:12:00Z"}],"graph_snapshots":[{"event_id":"sha256:1b453a74a14dfcccda2d2e4ff66748d8911c0d38d5904961fe1bc848f3a0c15d","target":"graph","created_at":"2026-07-05T01:12:00Z","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/2006.12476/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of PAC learning one-hidden-layer ReLU networks with $k$ hidden units on $\\mathbb{R}^d$ under Gaussian marginals in the presence of additive label noise. For the case of positive coefficients, we give the first polynomial-time algorithm for this learning problem for $k$ up to $\\tilde{O}(\\sqrt{\\log d})$. Previously, no polynomial time algorithm was known, even for $k=3$. This answers an open question posed by~\\cite{Kliv17}. Importantly, our algorithm does not require any assumptions about the rank of the weight matrix and its complexity is independent of its condition number","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Nikos Zarifis, Vasilis Kontonis","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-22T17:53:54Z","title":"Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.12476","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:54e7e677314a10332f9d98b76f0ee545ecbcb2c94dff7ac433883de13e807eff","target":"record","created_at":"2026-07-05T01:12:00Z","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":"95e1d9a3a0273a518acab96319bad7bf25a447a38b63aa447425ab95045991c9","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-22T17:53:54Z","title_canon_sha256":"076d0abaeadd0993ef74ff790ff61c49e7bf1a8177991221a8e7ea59b1e3f9a0"},"schema_version":"1.0","source":{"id":"2006.12476","kind":"arxiv","version":1}},"canonical_sha256":"1b6a9863c0df7340d5767f2bb24a11c4915ca51ce4cf3d38151f707ccd504ab6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b6a9863c0df7340d5767f2bb24a11c4915ca51ce4cf3d38151f707ccd504ab6","first_computed_at":"2026-07-05T01:12:00.875733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:12:00.875733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"deQTpZl77qFo4KPiEzCaZD6Jtn/kQ5U6ldbmpPfW9gy4mNYzGzBwuzCXu1m1QYTskJ8FZvnrI4mmxHr4JOt4Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:12:00.876190Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.12476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54e7e677314a10332f9d98b76f0ee545ecbcb2c94dff7ac433883de13e807eff","sha256:1b453a74a14dfcccda2d2e4ff66748d8911c0d38d5904961fe1bc848f3a0c15d"],"state_sha256":"af4538b788339f98fc1b96cedf0bce35cf81171df1fd8a72636c5fea37509f5b"}