{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D2ZMRA6R5OBKL5TLNV4KFRXD2K","short_pith_number":"pith:D2ZMRA6R","schema_version":"1.0","canonical_sha256":"1eb2c883d1eb82a5f66b6d78a2c6e3d2bf1cd80efa27a7240c4de7d87b8eaee4","source":{"kind":"arxiv","id":"2407.12895","version":1},"attestation_state":"computed","paper":{"title":"A Survey on Universal Approximation Theorems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Midhun T Augustine","submitted_at":"2024-07-17T13:21:53Z","abstract_excerpt":"This paper discusses various theorems on the approximation capabilities of neural networks (NNs), which are known as universal approximation theorems (UATs). The paper gives a systematic overview of UATs starting from the preliminary results on function approximation, such as Taylor's theorem, Fourier's theorem, Weierstrass approximation theorem, Kolmogorov - Arnold representation theorem, etc. Theoretical and numerical aspects of UATs are covered from both arbitrary width and depth."},"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":"2407.12895","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-17T13:21:53Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"e084363496860cfd501ba33fffb3dd16d653b15582e86fa8d687105860480e23","abstract_canon_sha256":"21d501435dd9c9120c698f371d52e71e6a72eb09eca38e8f85b7d5cef5911dc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:45:13.296055Z","signature_b64":"SilwHvS8V7SeCpkVKYr0D1Y4APNz21rKN5UHguNrtpLITlGLBiNRaxNonmDBPq38yBTsLDK7Q22ftG6bZRz7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eb2c883d1eb82a5f66b6d78a2c6e3d2bf1cd80efa27a7240c4de7d87b8eaee4","last_reissued_at":"2026-07-05T08:45:13.295592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:45:13.295592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on Universal Approximation Theorems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Midhun T Augustine","submitted_at":"2024-07-17T13:21:53Z","abstract_excerpt":"This paper discusses various theorems on the approximation capabilities of neural networks (NNs), which are known as universal approximation theorems (UATs). The paper gives a systematic overview of UATs starting from the preliminary results on function approximation, such as Taylor's theorem, Fourier's theorem, Weierstrass approximation theorem, Kolmogorov - Arnold representation theorem, etc. Theoretical and numerical aspects of UATs are covered from both arbitrary width and depth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.12895","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.12895/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":"2407.12895","created_at":"2026-07-05T08:45:13.295651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.12895v1","created_at":"2026-07-05T08:45:13.295651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12895","created_at":"2026-07-05T08:45:13.295651+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2ZMRA6R5OBK","created_at":"2026-07-05T08:45:13.295651+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2ZMRA6R5OBKL5TL","created_at":"2026-07-05T08:45:13.295651+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2ZMRA6R","created_at":"2026-07-05T08:45:13.295651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06976","citing_title":"Hybrid Least Squares/Gradient Descent Methods for MIONets","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2606.10023","citing_title":"Learning the Universe: Posterior Reliability of Neural Generative Models in High-Dimensional Field-Level Inference of Cosmic Initial Conditions","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16570","citing_title":"A Cubing Strategy for Identifying Stable Hyperparameter Regions for Uncertainty Quantification in Spatial Deep Learning","ref_index":245,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D2ZMRA6R5OBKL5TLNV4KFRXD2K","json":"https://pith.science/pith/D2ZMRA6R5OBKL5TLNV4KFRXD2K.json","graph_json":"https://pith.science/api/pith-number/D2ZMRA6R5OBKL5TLNV4KFRXD2K/graph.json","events_json":"https://pith.science/api/pith-number/D2ZMRA6R5OBKL5TLNV4KFRXD2K/events.json","paper":"https://pith.science/paper/D2ZMRA6R"},"agent_actions":{"view_html":"https://pith.science/pith/D2ZMRA6R5OBKL5TLNV4KFRXD2K","download_json":"https://pith.science/pith/D2ZMRA6R5OBKL5TLNV4KFRXD2K.json","view_paper":"https://pith.science/paper/D2ZMRA6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.12895&json=true","fetch_graph":"https://pith.science/api/pith-number/D2ZMRA6R5OBKL5TLNV4KFRXD2K/graph.json","fetch_events":"https://pith.science/api/pith-number/D2ZMRA6R5OBKL5TLNV4KFRXD2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2ZMRA6R5OBKL5TLNV4KFRXD2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2ZMRA6R5OBKL5TLNV4KFRXD2K/action/storage_attestation","attest_author":"https://pith.science/pith/D2ZMRA6R5OBKL5TLNV4KFRXD2K/action/author_attestation","sign_citation":"https://pith.science/pith/D2ZMRA6R5OBKL5TLNV4KFRXD2K/action/citation_signature","submit_replication":"https://pith.science/pith/D2ZMRA6R5OBKL5TLNV4KFRXD2K/action/replication_record"}},"created_at":"2026-07-05T08:45:13.295651+00:00","updated_at":"2026-07-05T08:45:13.295651+00:00"}