{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NETO4J3EVUA3GT2JTSHHWT4LDA","short_pith_number":"pith:NETO4J3E","canonical_record":{"source":{"id":"1812.06369","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T00:10:08Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"a2524cf4a8938c9a9a04a3041c221fb30e7942b28e4f1488836f5c7d4aa5bf74","abstract_canon_sha256":"9d33b0259120f0e90b9fb3a018cfd4264f8e0ddadedd209a4e7965103db16838"},"schema_version":"1.0"},"canonical_sha256":"6926ee2764ad01b34f499c8e7b4f8b1809a6065fd9fd1df79fdee0ed731a725e","source":{"kind":"arxiv","id":"1812.06369","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06369","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06369v2","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06369","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"NETO4J3EVUA3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NETO4J3EVUA3GT2J","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NETO4J3E","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NETO4J3EVUA3GT2JTSHHWT4LDA","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06369","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T00:10:08Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"a2524cf4a8938c9a9a04a3041c221fb30e7942b28e4f1488836f5c7d4aa5bf74","abstract_canon_sha256":"9d33b0259120f0e90b9fb3a018cfd4264f8e0ddadedd209a4e7965103db16838"},"schema_version":"1.0"},"canonical_sha256":"6926ee2764ad01b34f499c8e7b4f8b1809a6065fd9fd1df79fdee0ed731a725e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:35.923812Z","signature_b64":"Y450AKKtJgsYh7lCMSHPC79rVv8UaK/DE6f6DFCGzvZ7vaAImaU0JylH6mJQKtioYkQvP1TX47ZdpthF0bIUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6926ee2764ad01b34f499c8e7b4f8b1809a6065fd9fd1df79fdee0ed731a725e","last_reissued_at":"2026-05-17T23:47:35.923162Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:35.923162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06369","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-05-17T23:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSrr9y4D97IF9jtgDIidHy/BebIXD7ajxDtyq6a9zpPK1VqJ2sMEPmXg+8yOttLmlKoVwbWQL39kJxIch9UxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:44:11.756250Z"},"content_sha256":"e2ff627d0218c3524d93a5ec39f2dc583116181a61ddd8cb04efeaef2ca51df1","schema_version":"1.0","event_id":"sha256:e2ff627d0218c3524d93a5ec39f2dc583116181a61ddd8cb04efeaef2ca51df1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NETO4J3EVUA3GT2JTSHHWT4LDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable limitations of deep learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Colin Sandon, Emmanuel Abbe","submitted_at":"2018-12-16T00:10:08Z","abstract_excerpt":"As the success of deep learning reaches more grounds, one would like to also envision the potential limits of deep learning. This paper gives a first set of results proving that certain deep learning algorithms fail at learning certain efficiently learnable functions. The results put forward a notion of cross-predictability that characterizes when such failures take place. Parity functions provide an extreme example with a cross-predictability that decays exponentially, while a mere super-polynomial decay of the cross-predictability is shown to be sufficient to obtain failures. Examples in com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06369","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":""},"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-17T23:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IGaKCpmwLjhByugq6WceTX6PMqszNYQACpIjgxuhUtnNOuiUW2rqETGNtQoxURd/F4YLxb//VtsqD5OnSgiyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:44:11.756971Z"},"content_sha256":"1d54ecbb111dae7ee988eaab8b7aea72eae2fa87c5bf6078010fbf96f82fa087","schema_version":"1.0","event_id":"sha256:1d54ecbb111dae7ee988eaab8b7aea72eae2fa87c5bf6078010fbf96f82fa087"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NETO4J3EVUA3GT2JTSHHWT4LDA/bundle.json","state_url":"https://pith.science/pith/NETO4J3EVUA3GT2JTSHHWT4LDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NETO4J3EVUA3GT2JTSHHWT4LDA/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-25T15:44:11Z","links":{"resolver":"https://pith.science/pith/NETO4J3EVUA3GT2JTSHHWT4LDA","bundle":"https://pith.science/pith/NETO4J3EVUA3GT2JTSHHWT4LDA/bundle.json","state":"https://pith.science/pith/NETO4J3EVUA3GT2JTSHHWT4LDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NETO4J3EVUA3GT2JTSHHWT4LDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NETO4J3EVUA3GT2JTSHHWT4LDA","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":"9d33b0259120f0e90b9fb3a018cfd4264f8e0ddadedd209a4e7965103db16838","cross_cats_sorted":["cs.CC","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T00:10:08Z","title_canon_sha256":"a2524cf4a8938c9a9a04a3041c221fb30e7942b28e4f1488836f5c7d4aa5bf74"},"schema_version":"1.0","source":{"id":"1812.06369","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06369","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06369v2","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06369","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"NETO4J3EVUA3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NETO4J3EVUA3GT2J","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NETO4J3E","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:1d54ecbb111dae7ee988eaab8b7aea72eae2fa87c5bf6078010fbf96f82fa087","target":"graph","created_at":"2026-05-17T23:47:35Z","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":"As the success of deep learning reaches more grounds, one would like to also envision the potential limits of deep learning. This paper gives a first set of results proving that certain deep learning algorithms fail at learning certain efficiently learnable functions. The results put forward a notion of cross-predictability that characterizes when such failures take place. Parity functions provide an extreme example with a cross-predictability that decays exponentially, while a mere super-polynomial decay of the cross-predictability is shown to be sufficient to obtain failures. Examples in com","authors_text":"Colin Sandon, Emmanuel Abbe","cross_cats":["cs.CC","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T00:10:08Z","title":"Provable limitations of deep learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06369","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:e2ff627d0218c3524d93a5ec39f2dc583116181a61ddd8cb04efeaef2ca51df1","target":"record","created_at":"2026-05-17T23:47:35Z","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":"9d33b0259120f0e90b9fb3a018cfd4264f8e0ddadedd209a4e7965103db16838","cross_cats_sorted":["cs.CC","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-16T00:10:08Z","title_canon_sha256":"a2524cf4a8938c9a9a04a3041c221fb30e7942b28e4f1488836f5c7d4aa5bf74"},"schema_version":"1.0","source":{"id":"1812.06369","kind":"arxiv","version":2}},"canonical_sha256":"6926ee2764ad01b34f499c8e7b4f8b1809a6065fd9fd1df79fdee0ed731a725e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6926ee2764ad01b34f499c8e7b4f8b1809a6065fd9fd1df79fdee0ed731a725e","first_computed_at":"2026-05-17T23:47:35.923162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:35.923162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y450AKKtJgsYh7lCMSHPC79rVv8UaK/DE6f6DFCGzvZ7vaAImaU0JylH6mJQKtioYkQvP1TX47ZdpthF0bIUDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:35.923812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06369","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2ff627d0218c3524d93a5ec39f2dc583116181a61ddd8cb04efeaef2ca51df1","sha256:1d54ecbb111dae7ee988eaab8b7aea72eae2fa87c5bf6078010fbf96f82fa087"],"state_sha256":"8087274a48b917bd24f503311636c7ed4ec25bc352348c840463a38b79fc85e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X/iOSrg4LEOTSa+/1gEteZ6L9COp7oM62E+7NhEZvMEs8Vnw5Fx2o5byszODtptNy/YUqkKgFYG7dV4SwAMxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:44:11.761358Z","bundle_sha256":"bf4c5a52dba363801efbb49dc7e45377da2308e248a7fc5c3e42eb8a0aab3426"}}