{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ILUQZ63P5E5EWFP35LY7PY646H","short_pith_number":"pith:ILUQZ63P","canonical_record":{"source":{"id":"1708.03708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-11T21:26:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8405bddbd7ade2686715b60cc2123d9e6d3dbf43930088ec737b6aa3e104916d","abstract_canon_sha256":"81c909cd01bbc9bf6b2be6ad70c5ffda32f7db1055a927c6c3f072055b410a35"},"schema_version":"1.0"},"canonical_sha256":"42e90cfb6fe93a4b15fbeaf1f7e3dcf1c891b83e8e4c2be2668760867a78fec6","source":{"kind":"arxiv","id":"1708.03708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03708","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03708v1","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03708","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"ILUQZ63P5E5E","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"ILUQZ63P5E5EWFP3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"ILUQZ63P","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ILUQZ63P5E5EWFP35LY7PY646H","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-11T21:26:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8405bddbd7ade2686715b60cc2123d9e6d3dbf43930088ec737b6aa3e104916d","abstract_canon_sha256":"81c909cd01bbc9bf6b2be6ad70c5ffda32f7db1055a927c6c3f072055b410a35"},"schema_version":"1.0"},"canonical_sha256":"42e90cfb6fe93a4b15fbeaf1f7e3dcf1c891b83e8e4c2be2668760867a78fec6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:08.089744Z","signature_b64":"po/V8zKuycayrdQx2EY2D+90I5ka4moVv+Tw4twSoKZJvXPPKA2QjY2TboebX5K9xdSMGtm6nLzPBUO09CjmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42e90cfb6fe93a4b15fbeaf1f7e3dcf1c891b83e8e4c2be2668760867a78fec6","last_reissued_at":"2026-05-18T00:38:08.089290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:08.089290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03708","source_version":1,"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-05-18T00:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XzJ2wKmZDtbDi6APDLPC8QVpvUqgC2Wb/SI2UxcYZeU7jpGd0eO361gW8gAHtEiL6IJuvg3YATyFMdRb4VJRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:22:07.222600Z"},"content_sha256":"1739f4267dd3d4d525e8b23fe11963af9d4169f861acb1caa58a33022b716860","schema_version":"1.0","event_id":"sha256:1739f4267dd3d4d525e8b23fe11963af9d4169f861acb1caa58a33022b716860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ILUQZ63P5E5EWFP35LY7PY646H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Eigenvalue Decay Implies Polynomial-Time Learnability for Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Adam Klivans, Surbhi Goel","submitted_at":"2017-08-11T21:26:05Z","abstract_excerpt":"We consider the problem of learning function classes computed by neural networks with various activations (e.g. ReLU or Sigmoid), a task believed to be computationally intractable in the worst-case. A major open problem is to understand the minimal assumptions under which these classes admit provably efficient algorithms. In this work we show that a natural distributional assumption corresponding to {\\em eigenvalue decay} of the Gram matrix yields polynomial-time algorithms in the non-realizable setting for expressive classes of networks (e.g. feed-forward networks of ReLUs). We make no assump"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03708","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":""},"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-05-18T00:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUecpSvziviAzomSAPRbBnSoiybT8cSaUtn9AKx/mqinsxRQIiIzVqkA4mTpMRIPCKPumYlh5IdzsYv48A0uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:22:07.223259Z"},"content_sha256":"119c1d3ae6023b1fdf115e102eaa1448a8aaba88349d4ba21310a382271f1993","schema_version":"1.0","event_id":"sha256:119c1d3ae6023b1fdf115e102eaa1448a8aaba88349d4ba21310a382271f1993"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILUQZ63P5E5EWFP35LY7PY646H/bundle.json","state_url":"https://pith.science/pith/ILUQZ63P5E5EWFP35LY7PY646H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILUQZ63P5E5EWFP35LY7PY646H/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-05-29T21:22:07Z","links":{"resolver":"https://pith.science/pith/ILUQZ63P5E5EWFP35LY7PY646H","bundle":"https://pith.science/pith/ILUQZ63P5E5EWFP35LY7PY646H/bundle.json","state":"https://pith.science/pith/ILUQZ63P5E5EWFP35LY7PY646H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILUQZ63P5E5EWFP35LY7PY646H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ILUQZ63P5E5EWFP35LY7PY646H","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":"81c909cd01bbc9bf6b2be6ad70c5ffda32f7db1055a927c6c3f072055b410a35","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-11T21:26:05Z","title_canon_sha256":"8405bddbd7ade2686715b60cc2123d9e6d3dbf43930088ec737b6aa3e104916d"},"schema_version":"1.0","source":{"id":"1708.03708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03708","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03708v1","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03708","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"ILUQZ63P5E5E","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"ILUQZ63P5E5EWFP3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"ILUQZ63P","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:119c1d3ae6023b1fdf115e102eaa1448a8aaba88349d4ba21310a382271f1993","target":"graph","created_at":"2026-05-18T00:38:08Z","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"},"paper":{"abstract_excerpt":"We consider the problem of learning function classes computed by neural networks with various activations (e.g. ReLU or Sigmoid), a task believed to be computationally intractable in the worst-case. A major open problem is to understand the minimal assumptions under which these classes admit provably efficient algorithms. In this work we show that a natural distributional assumption corresponding to {\\em eigenvalue decay} of the Gram matrix yields polynomial-time algorithms in the non-realizable setting for expressive classes of networks (e.g. feed-forward networks of ReLUs). We make no assump","authors_text":"Adam Klivans, Surbhi Goel","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-11T21:26:05Z","title":"Eigenvalue Decay Implies Polynomial-Time Learnability for Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03708","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:1739f4267dd3d4d525e8b23fe11963af9d4169f861acb1caa58a33022b716860","target":"record","created_at":"2026-05-18T00:38:08Z","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":"81c909cd01bbc9bf6b2be6ad70c5ffda32f7db1055a927c6c3f072055b410a35","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-11T21:26:05Z","title_canon_sha256":"8405bddbd7ade2686715b60cc2123d9e6d3dbf43930088ec737b6aa3e104916d"},"schema_version":"1.0","source":{"id":"1708.03708","kind":"arxiv","version":1}},"canonical_sha256":"42e90cfb6fe93a4b15fbeaf1f7e3dcf1c891b83e8e4c2be2668760867a78fec6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42e90cfb6fe93a4b15fbeaf1f7e3dcf1c891b83e8e4c2be2668760867a78fec6","first_computed_at":"2026-05-18T00:38:08.089290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:08.089290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"po/V8zKuycayrdQx2EY2D+90I5ka4moVv+Tw4twSoKZJvXPPKA2QjY2TboebX5K9xdSMGtm6nLzPBUO09CjmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:08.089744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1739f4267dd3d4d525e8b23fe11963af9d4169f861acb1caa58a33022b716860","sha256:119c1d3ae6023b1fdf115e102eaa1448a8aaba88349d4ba21310a382271f1993"],"state_sha256":"859f1a26c6debde49bc2bef9f37a6cf7a6f57f31c428fc77f188bc465fe660bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/J0hzBG9Bt9VbMaWwHQi1Z52TJWbmWQ3lHLorWC6pegA9FtIceIoix9QfWrcc3jyqz8iBuRh6JkwBAj2E1m/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:22:07.226841Z","bundle_sha256":"82911ad51f01c322f8fa5019e015c9f1a21bc248174310d87687dd12b62873e6"}}