{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:APMC4X36ZKNF5QLIPLSIOIGAAG","short_pith_number":"pith:APMC4X36","canonical_record":{"source":{"id":"1705.01714","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-04T06:45:06Z","cross_cats_sorted":["cs.IT","math.FA","math.IT"],"title_canon_sha256":"e9d9fc7331c21a258dad7bf298f611525a7ead963bba3068d952b4a9198005ba","abstract_canon_sha256":"667bada4cbbed87854f902e0a593ea088442203a87c3025f54573bb2add644ae"},"schema_version":"1.0"},"canonical_sha256":"03d82e5f7eca9a5ec1687ae48720c001a19bfbffb1cdc2220ea02ee7205ef080","source":{"kind":"arxiv","id":"1705.01714","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01714","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01714v4","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01714","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"APMC4X36ZKNF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"APMC4X36ZKNF5QLI","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"APMC4X36","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:APMC4X36ZKNF5QLIPLSIOIGAAG","target":"record","payload":{"canonical_record":{"source":{"id":"1705.01714","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-04T06:45:06Z","cross_cats_sorted":["cs.IT","math.FA","math.IT"],"title_canon_sha256":"e9d9fc7331c21a258dad7bf298f611525a7ead963bba3068d952b4a9198005ba","abstract_canon_sha256":"667bada4cbbed87854f902e0a593ea088442203a87c3025f54573bb2add644ae"},"schema_version":"1.0"},"canonical_sha256":"03d82e5f7eca9a5ec1687ae48720c001a19bfbffb1cdc2220ea02ee7205ef080","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:52.589170Z","signature_b64":"fObc67xA2Fq8r1MBJ3y7qPUhoapnGjX0eFfZYRnxmrrM09zISSrqwFBm2kU3izEtSnUBK9AmfRbX0tzriPhrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03d82e5f7eca9a5ec1687ae48720c001a19bfbffb1cdc2220ea02ee7205ef080","last_reissued_at":"2026-05-18T00:15:52.588526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:52.588526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.01714","source_version":4,"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:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nE6mO8bjK3FlxOrNzf8W8vyEHmTYlS0lOxw+z8rZ9FJcRVdGQu/4jIl3obk+cVc2b4s+uTv53GyERnodXWhyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:28:25.557446Z"},"content_sha256":"1b4291d76dcd71229daef6fa9847a09f025237d4ae9bca6504aa8b494276a608","schema_version":"1.0","event_id":"sha256:1b4291d76dcd71229daef6fa9847a09f025237d4ae9bca6504aa8b494276a608"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:APMC4X36ZKNF5QLIPLSIOIGAAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Approximation with Sparsely Connected Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.FA","math.IT"],"primary_cat":"cs.LG","authors_text":"Gitta Kutyniok, Helmut B\\\"olcskei, Philipp Grohs, Philipp Petersen","submitted_at":"2017-05-04T06:45:06Z","abstract_excerpt":"We derive fundamental lower bounds on the connectivity and the memory requirements of deep neural networks guaranteeing uniform approximation rates for arbitrary function classes in $L^2(\\mathbb R^d)$. In other words, we establish a connection between the complexity of a function class and the complexity of deep neural networks approximating functions from this class to within a prescribed accuracy. Additionally, we prove that our lower bounds are achievable for a broad family of function classes. Specifically, all function classes that are optimally approximated by a general class of represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01714","kind":"arxiv","version":4},"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:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ze+/qDQJmFNyqNzLBdDC5DfegY3irB4kab8kQc9P3OuTwDxzDp08+POAhe7bQ+54aT3fJqEocmnvCDptgymfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:28:25.558165Z"},"content_sha256":"302701d5c2895ba20e0a67eca07a4a9696c4d514f5484d9d820d19f57569690b","schema_version":"1.0","event_id":"sha256:302701d5c2895ba20e0a67eca07a4a9696c4d514f5484d9d820d19f57569690b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APMC4X36ZKNF5QLIPLSIOIGAAG/bundle.json","state_url":"https://pith.science/pith/APMC4X36ZKNF5QLIPLSIOIGAAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APMC4X36ZKNF5QLIPLSIOIGAAG/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-27T16:28:25Z","links":{"resolver":"https://pith.science/pith/APMC4X36ZKNF5QLIPLSIOIGAAG","bundle":"https://pith.science/pith/APMC4X36ZKNF5QLIPLSIOIGAAG/bundle.json","state":"https://pith.science/pith/APMC4X36ZKNF5QLIPLSIOIGAAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APMC4X36ZKNF5QLIPLSIOIGAAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:APMC4X36ZKNF5QLIPLSIOIGAAG","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":"667bada4cbbed87854f902e0a593ea088442203a87c3025f54573bb2add644ae","cross_cats_sorted":["cs.IT","math.FA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-04T06:45:06Z","title_canon_sha256":"e9d9fc7331c21a258dad7bf298f611525a7ead963bba3068d952b4a9198005ba"},"schema_version":"1.0","source":{"id":"1705.01714","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01714","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01714v4","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01714","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"APMC4X36ZKNF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"APMC4X36ZKNF5QLI","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"APMC4X36","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:302701d5c2895ba20e0a67eca07a4a9696c4d514f5484d9d820d19f57569690b","target":"graph","created_at":"2026-05-18T00:15:52Z","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 derive fundamental lower bounds on the connectivity and the memory requirements of deep neural networks guaranteeing uniform approximation rates for arbitrary function classes in $L^2(\\mathbb R^d)$. In other words, we establish a connection between the complexity of a function class and the complexity of deep neural networks approximating functions from this class to within a prescribed accuracy. Additionally, we prove that our lower bounds are achievable for a broad family of function classes. Specifically, all function classes that are optimally approximated by a general class of represen","authors_text":"Gitta Kutyniok, Helmut B\\\"olcskei, Philipp Grohs, Philipp Petersen","cross_cats":["cs.IT","math.FA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-04T06:45:06Z","title":"Optimal Approximation with Sparsely Connected Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01714","kind":"arxiv","version":4},"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:1b4291d76dcd71229daef6fa9847a09f025237d4ae9bca6504aa8b494276a608","target":"record","created_at":"2026-05-18T00:15:52Z","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":"667bada4cbbed87854f902e0a593ea088442203a87c3025f54573bb2add644ae","cross_cats_sorted":["cs.IT","math.FA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-04T06:45:06Z","title_canon_sha256":"e9d9fc7331c21a258dad7bf298f611525a7ead963bba3068d952b4a9198005ba"},"schema_version":"1.0","source":{"id":"1705.01714","kind":"arxiv","version":4}},"canonical_sha256":"03d82e5f7eca9a5ec1687ae48720c001a19bfbffb1cdc2220ea02ee7205ef080","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03d82e5f7eca9a5ec1687ae48720c001a19bfbffb1cdc2220ea02ee7205ef080","first_computed_at":"2026-05-18T00:15:52.588526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:52.588526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fObc67xA2Fq8r1MBJ3y7qPUhoapnGjX0eFfZYRnxmrrM09zISSrqwFBm2kU3izEtSnUBK9AmfRbX0tzriPhrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:52.589170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01714","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b4291d76dcd71229daef6fa9847a09f025237d4ae9bca6504aa8b494276a608","sha256:302701d5c2895ba20e0a67eca07a4a9696c4d514f5484d9d820d19f57569690b"],"state_sha256":"ea9dd726f7814a6de4ded51a0e984122348c1d209fc95d87042ec9006b40c783"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXlMMoVMLKcYQNABmjc5TYqmD5ZdxdbAx9c01vWkTbdHVkM8OXrh3jADwyjyFfKArjBtvX+3xAeaK3yMZmspDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:28:25.561986Z","bundle_sha256":"9b7bdcf42c211c6e25884d54963fe41f02b172e257e498cce8bead988eeffc01"}}