{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VM4NST3MIQBA4Q4KPCHG5BP2SU","short_pith_number":"pith:VM4NST3M","canonical_record":{"source":{"id":"2006.12011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-22T05:15:06Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"bd22f385b7609d2dc1ab354fea76a3800b9d4ebfa5fa7b6251200f829fc9a036","abstract_canon_sha256":"d97556d48574c86568d7b7181e1d08949ef9cf1619587a8702c95e486fea1b61"},"schema_version":"1.0"},"canonical_sha256":"ab38d94f6c44020e438a788e6e85fa950d6649ac52ab2b9525683d9fb4871954","source":{"kind":"arxiv","id":"2006.12011","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.12011","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"arxiv_version","alias_value":"2006.12011v2","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.12011","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"pith_short_12","alias_value":"VM4NST3MIQBA","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"pith_short_16","alias_value":"VM4NST3MIQBA4Q4K","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"pith_short_8","alias_value":"VM4NST3M","created_at":"2026-07-05T01:45:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VM4NST3MIQBA4Q4KPCHG5BP2SU","target":"record","payload":{"canonical_record":{"source":{"id":"2006.12011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-22T05:15:06Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"bd22f385b7609d2dc1ab354fea76a3800b9d4ebfa5fa7b6251200f829fc9a036","abstract_canon_sha256":"d97556d48574c86568d7b7181e1d08949ef9cf1619587a8702c95e486fea1b61"},"schema_version":"1.0"},"canonical_sha256":"ab38d94f6c44020e438a788e6e85fa950d6649ac52ab2b9525683d9fb4871954","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:28.196724Z","signature_b64":"tcqG4NvVRoMg0tCFOu2xXLofAEt8wgZlH2yMbKNUfggi4I4OFeyZALPY7wRcECB6/3Afws3NR2mVMazbRA+LCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab38d94f6c44020e438a788e6e85fa950d6649ac52ab2b9525683d9fb4871954","last_reissued_at":"2026-07-05T01:45:28.196238Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:28.196238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.12011","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:45:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WL9R710gor4kVRwVfmt2sSFRp52dGiDim0FIgWLpjyLE4JdKVlIzA+kAZ6HkxBK5JYwzkBqzo+x61XZ8md8ODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:46:23.610446Z"},"content_sha256":"db36bcc6e8cdcfced11558a78cb8696ee8101a52048ee0baca485dc4a6c67c3b","schema_version":"1.0","event_id":"sha256:db36bcc6e8cdcfced11558a78cb8696ee8101a52048ee0baca485dc4a6c67c3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VM4NST3MIQBA4Q4KPCHG5BP2SU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Klivans, Aravind Gollakota, Surbhi Goel, Sushrut Karmalkar, Zhihan Jin","submitted_at":"2020-06-22T05:15:06Z","abstract_excerpt":"We prove the first superpolynomial lower bounds for learning one-layer neural networks with respect to the Gaussian distribution using gradient descent. We show that any classifier trained using gradient descent with respect to square-loss will fail to achieve small test error in polynomial time given access to samples labeled by a one-layer neural network. For classification, we give a stronger result, namely that any statistical query (SQ) algorithm (including gradient descent) will fail to achieve small test error in polynomial time. Prior work held only for gradient descent run with small "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.12011","kind":"arxiv","version":2},"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/2006.12011/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:45:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbZ6y+CXcKFrSl3rq2JAApdlNGRZ1bp+gYwKaP80mPlNTbpLHAPK5cZAWcZyXWFBh2HUxXxDMuhpPTXe/o1LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:46:23.610951Z"},"content_sha256":"67c141834ae9a21d479d425b09bab37be922a49e7315bb92b73fa45a2d814ded","schema_version":"1.0","event_id":"sha256:67c141834ae9a21d479d425b09bab37be922a49e7315bb92b73fa45a2d814ded"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VM4NST3MIQBA4Q4KPCHG5BP2SU/bundle.json","state_url":"https://pith.science/pith/VM4NST3MIQBA4Q4KPCHG5BP2SU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VM4NST3MIQBA4Q4KPCHG5BP2SU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T18:46:23Z","links":{"resolver":"https://pith.science/pith/VM4NST3MIQBA4Q4KPCHG5BP2SU","bundle":"https://pith.science/pith/VM4NST3MIQBA4Q4KPCHG5BP2SU/bundle.json","state":"https://pith.science/pith/VM4NST3MIQBA4Q4KPCHG5BP2SU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VM4NST3MIQBA4Q4KPCHG5BP2SU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VM4NST3MIQBA4Q4KPCHG5BP2SU","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":"d97556d48574c86568d7b7181e1d08949ef9cf1619587a8702c95e486fea1b61","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-22T05:15:06Z","title_canon_sha256":"bd22f385b7609d2dc1ab354fea76a3800b9d4ebfa5fa7b6251200f829fc9a036"},"schema_version":"1.0","source":{"id":"2006.12011","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.12011","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"arxiv_version","alias_value":"2006.12011v2","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.12011","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"pith_short_12","alias_value":"VM4NST3MIQBA","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"pith_short_16","alias_value":"VM4NST3MIQBA4Q4K","created_at":"2026-07-05T01:45:28Z"},{"alias_kind":"pith_short_8","alias_value":"VM4NST3M","created_at":"2026-07-05T01:45:28Z"}],"graph_snapshots":[{"event_id":"sha256:67c141834ae9a21d479d425b09bab37be922a49e7315bb92b73fa45a2d814ded","target":"graph","created_at":"2026-07-05T01:45:28Z","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.12011/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove the first superpolynomial lower bounds for learning one-layer neural networks with respect to the Gaussian distribution using gradient descent. We show that any classifier trained using gradient descent with respect to square-loss will fail to achieve small test error in polynomial time given access to samples labeled by a one-layer neural network. For classification, we give a stronger result, namely that any statistical query (SQ) algorithm (including gradient descent) will fail to achieve small test error in polynomial time. Prior work held only for gradient descent run with small ","authors_text":"Adam Klivans, Aravind Gollakota, Surbhi Goel, Sushrut Karmalkar, Zhihan Jin","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-22T05:15:06Z","title":"Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.12011","kind":"arxiv","version":2},"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:db36bcc6e8cdcfced11558a78cb8696ee8101a52048ee0baca485dc4a6c67c3b","target":"record","created_at":"2026-07-05T01:45:28Z","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":"d97556d48574c86568d7b7181e1d08949ef9cf1619587a8702c95e486fea1b61","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-22T05:15:06Z","title_canon_sha256":"bd22f385b7609d2dc1ab354fea76a3800b9d4ebfa5fa7b6251200f829fc9a036"},"schema_version":"1.0","source":{"id":"2006.12011","kind":"arxiv","version":2}},"canonical_sha256":"ab38d94f6c44020e438a788e6e85fa950d6649ac52ab2b9525683d9fb4871954","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab38d94f6c44020e438a788e6e85fa950d6649ac52ab2b9525683d9fb4871954","first_computed_at":"2026-07-05T01:45:28.196238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:45:28.196238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tcqG4NvVRoMg0tCFOu2xXLofAEt8wgZlH2yMbKNUfggi4I4OFeyZALPY7wRcECB6/3Afws3NR2mVMazbRA+LCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:45:28.196724Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.12011","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db36bcc6e8cdcfced11558a78cb8696ee8101a52048ee0baca485dc4a6c67c3b","sha256:67c141834ae9a21d479d425b09bab37be922a49e7315bb92b73fa45a2d814ded"],"state_sha256":"d032e477a9bc0b054ec52ed77814b70a56aaa01e6bae1b62225074b86be49a21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A40/yYs5GIoleymso7RFWFVLeNHjPNpach9q88p6JLLZhKdae7A6rK6IgTVMVAHQNqt+7qGYmpXDsaalElrFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T18:46:23.614644Z","bundle_sha256":"8d30049e573dc235c0b1e9966659d5212175b79b123fa5ed288efeccd2fdb9de"}}