{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HVDMKQWVCYIBTUVOKEWIBKGGSW","short_pith_number":"pith:HVDMKQWV","schema_version":"1.0","canonical_sha256":"3d46c542d5161019d2ae512c80a8c6959fef405fbe32b67740d1edb8a38669bb","source":{"kind":"arxiv","id":"1610.04161","version":2},"attestation_state":"computed","paper":{"title":"Why Deep Neural Networks for Function Approximation?","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"R. Srikant, Shiyu Liang","submitted_at":"2016-10-13T16:34:30Z","abstract_excerpt":"Recently there has been much interest in understanding why deep neural networks are preferred to shallow networks. We show that, for a large class of piecewise smooth functions, the number of neurons needed by a shallow network to approximate a function is exponentially larger than the corresponding number of neurons needed by a deep network for a given degree of function approximation. First, we consider univariate functions on a bounded interval and require a neural network to achieve an approximation error of $\\varepsilon$ uniformly over the interval. We show that shallow networks (i.e., ne"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1610.04161","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-13T16:34:30Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"6181a9743297cd5be3b34a4d45416e141482126ee8b9da675ba02571ccbc1431","abstract_canon_sha256":"b825a5ba7ff603bdb1a6305499a31bd18cbbd4709dd200616a0e2c978439ce6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:31.986624Z","signature_b64":"1i4Tqr6SQAJ1x5FUq6yY+U5bVlnKAqODNp0B8lbWWHNnqQPB8n7b2fAJ9ElSbiOpYfXdX6YYv7o4VLVgDzCaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d46c542d5161019d2ae512c80a8c6959fef405fbe32b67740d1edb8a38669bb","last_reissued_at":"2026-05-18T00:49:31.986073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:31.986073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Why Deep Neural Networks for Function Approximation?","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"R. Srikant, Shiyu Liang","submitted_at":"2016-10-13T16:34:30Z","abstract_excerpt":"Recently there has been much interest in understanding why deep neural networks are preferred to shallow networks. We show that, for a large class of piecewise smooth functions, the number of neurons needed by a shallow network to approximate a function is exponentially larger than the corresponding number of neurons needed by a deep network for a given degree of function approximation. First, we consider univariate functions on a bounded interval and require a neural network to achieve an approximation error of $\\varepsilon$ uniformly over the interval. We show that shallow networks (i.e., ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04161","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.04161","created_at":"2026-05-18T00:49:31.986151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04161v2","created_at":"2026-05-18T00:49:31.986151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04161","created_at":"2026-05-18T00:49:31.986151+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVDMKQWVCYIB","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVDMKQWVCYIBTUVO","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVDMKQWV","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2511.17578","citing_title":"Implicit Neural Field-Based Process Planning for Multi-Axis Manufacturing: Direct Control over Collision Avoidance and Toolpath Geometry","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2512.13751","citing_title":"MIDUS: Memory-Infused Depth Up-Scaling","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HVDMKQWVCYIBTUVOKEWIBKGGSW","json":"https://pith.science/pith/HVDMKQWVCYIBTUVOKEWIBKGGSW.json","graph_json":"https://pith.science/api/pith-number/HVDMKQWVCYIBTUVOKEWIBKGGSW/graph.json","events_json":"https://pith.science/api/pith-number/HVDMKQWVCYIBTUVOKEWIBKGGSW/events.json","paper":"https://pith.science/paper/HVDMKQWV"},"agent_actions":{"view_html":"https://pith.science/pith/HVDMKQWVCYIBTUVOKEWIBKGGSW","download_json":"https://pith.science/pith/HVDMKQWVCYIBTUVOKEWIBKGGSW.json","view_paper":"https://pith.science/paper/HVDMKQWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04161&json=true","fetch_graph":"https://pith.science/api/pith-number/HVDMKQWVCYIBTUVOKEWIBKGGSW/graph.json","fetch_events":"https://pith.science/api/pith-number/HVDMKQWVCYIBTUVOKEWIBKGGSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVDMKQWVCYIBTUVOKEWIBKGGSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVDMKQWVCYIBTUVOKEWIBKGGSW/action/storage_attestation","attest_author":"https://pith.science/pith/HVDMKQWVCYIBTUVOKEWIBKGGSW/action/author_attestation","sign_citation":"https://pith.science/pith/HVDMKQWVCYIBTUVOKEWIBKGGSW/action/citation_signature","submit_replication":"https://pith.science/pith/HVDMKQWVCYIBTUVOKEWIBKGGSW/action/replication_record"}},"created_at":"2026-05-18T00:49:31.986151+00:00","updated_at":"2026-05-18T00:49:31.986151+00:00"}