{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VTHRI4F2BCKP4THXPFBIHP4DFJ","short_pith_number":"pith:VTHRI4F2","schema_version":"1.0","canonical_sha256":"accf1470ba0894fe4cf7794283bf832a6c02fce27c65995d4a8e5ede6a538f5d","source":{"kind":"arxiv","id":"2309.10402","version":2},"attestation_state":"computed","paper":{"title":"Minimum width for universal approximation using ReLU networks on compact domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chanho Min, Namjun Kim, Sejun Park","submitted_at":"2023-09-19T08:04:48Z","abstract_excerpt":"It has been shown that deep neural networks of a large enough width are universal approximators but they are not if the width is too small. There were several attempts to characterize the minimum width $w_{\\min}$ enabling the universal approximation property; however, only a few of them found the exact values. In this work, we show that the minimum width for $L^p$ approximation of $L^p$ functions from $[0,1]^{d_x}$ to $\\mathbb R^{d_y}$ is exactly $\\max\\{d_x,d_y,2\\}$ if an activation function is ReLU-Like (e.g., ReLU, GELU, Softplus). Compared to the known result for ReLU networks, $w_{\\min}=\\m"},"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":"2309.10402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-19T08:04:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9419831393f087a7cf3220c6009baacde3b8edb07e422ed655f337df2c1ca911","abstract_canon_sha256":"465fa8e132eaf090e2ad13a972ca726af60fa1fcafc59e4d0fd9568f41b02f42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:12.493412Z","signature_b64":"CHWS68PNY4Z2lH/d5DeU4/qPymfSwsDlhtbxL06PJjxy+1x47JUpl3QVqmyy5mlTxG33zNQ/5hfEOaAO3nUWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"accf1470ba0894fe4cf7794283bf832a6c02fce27c65995d4a8e5ede6a538f5d","last_reissued_at":"2026-07-05T07:52:12.492911Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:12.492911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum width for universal approximation using ReLU networks on compact domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chanho Min, Namjun Kim, Sejun Park","submitted_at":"2023-09-19T08:04:48Z","abstract_excerpt":"It has been shown that deep neural networks of a large enough width are universal approximators but they are not if the width is too small. There were several attempts to characterize the minimum width $w_{\\min}$ enabling the universal approximation property; however, only a few of them found the exact values. In this work, we show that the minimum width for $L^p$ approximation of $L^p$ functions from $[0,1]^{d_x}$ to $\\mathbb R^{d_y}$ is exactly $\\max\\{d_x,d_y,2\\}$ if an activation function is ReLU-Like (e.g., ReLU, GELU, Softplus). Compared to the known result for ReLU networks, $w_{\\min}=\\m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10402","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/2309.10402/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.10402","created_at":"2026-07-05T07:52:12.492964+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.10402v2","created_at":"2026-07-05T07:52:12.492964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10402","created_at":"2026-07-05T07:52:12.492964+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTHRI4F2BCKP","created_at":"2026-07-05T07:52:12.492964+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTHRI4F2BCKP4THX","created_at":"2026-07-05T07:52:12.492964+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTHRI4F2","created_at":"2026-07-05T07:52:12.492964+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07119","citing_title":"Classification Fields: Arbitrarily Fine Recursive Hierarchical Clustering From Few Examples","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VTHRI4F2BCKP4THXPFBIHP4DFJ","json":"https://pith.science/pith/VTHRI4F2BCKP4THXPFBIHP4DFJ.json","graph_json":"https://pith.science/api/pith-number/VTHRI4F2BCKP4THXPFBIHP4DFJ/graph.json","events_json":"https://pith.science/api/pith-number/VTHRI4F2BCKP4THXPFBIHP4DFJ/events.json","paper":"https://pith.science/paper/VTHRI4F2"},"agent_actions":{"view_html":"https://pith.science/pith/VTHRI4F2BCKP4THXPFBIHP4DFJ","download_json":"https://pith.science/pith/VTHRI4F2BCKP4THXPFBIHP4DFJ.json","view_paper":"https://pith.science/paper/VTHRI4F2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.10402&json=true","fetch_graph":"https://pith.science/api/pith-number/VTHRI4F2BCKP4THXPFBIHP4DFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VTHRI4F2BCKP4THXPFBIHP4DFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTHRI4F2BCKP4THXPFBIHP4DFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTHRI4F2BCKP4THXPFBIHP4DFJ/action/storage_attestation","attest_author":"https://pith.science/pith/VTHRI4F2BCKP4THXPFBIHP4DFJ/action/author_attestation","sign_citation":"https://pith.science/pith/VTHRI4F2BCKP4THXPFBIHP4DFJ/action/citation_signature","submit_replication":"https://pith.science/pith/VTHRI4F2BCKP4THXPFBIHP4DFJ/action/replication_record"}},"created_at":"2026-07-05T07:52:12.492964+00:00","updated_at":"2026-07-05T07:52:12.492964+00:00"}