{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QLDHNVDHWOXIEN6PBKPJVBH2AA","short_pith_number":"pith:QLDHNVDH","schema_version":"1.0","canonical_sha256":"82c676d467b3ae8237cf0a9e9a84fa000fff4686263643116ac5f2f4dc001f0f","source":{"kind":"arxiv","id":"2308.03230","version":2},"attestation_state":"computed","paper":{"title":"Tractability of approximation by general shallow networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Hrushikesh Mhaskar, Tong Mao","submitted_at":"2023-08-07T00:14:46Z","abstract_excerpt":"In this paper, we present a sharper version of the results in the paper Dimension independent bounds for general shallow networks; Neural Networks, \\textbf{123} (2020), 142-152. Let $\\mathbb{X}$ and $\\mathbb{Y}$ be compact metric spaces. We consider approximation of functions of the form $ x\\mapsto\\int_{\\mathbb{Y}} G( x, y)d\\tau( y)$, $ x\\in\\mathbb{X}$, by $G$-networks of the form $ x\\mapsto \\sum_{k=1}^n a_kG( x, y_k)$, $ y_1,\\cdots, y_n\\in\\mathbb{Y}$, $a_1,\\cdots, a_n\\in\\mathbb{R}$. Defining the dimensions of $\\mathbb{X}$ and $\\mathbb{Y}$ in terms of covering numbers, we obtain dimension inde"},"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":"2308.03230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-07T00:14:46Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"0a11994ca3f697152344a2acce382d3e3f5ca9e406f69f6019968576e014ea9e","abstract_canon_sha256":"fe9e06f3a3e362109cc4b9361470dd19922703c212b50f15e36f813abbe7c24b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:22:21.893069Z","signature_b64":"dHh/Fw7YPWE/nZZo615kq7aEVDEpP8HnAXhkP2nwEFvPi6EU/bgpKTiqcWIbivAcQ5IWxa+CMvzC0tYpIiUwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82c676d467b3ae8237cf0a9e9a84fa000fff4686263643116ac5f2f4dc001f0f","last_reissued_at":"2026-07-05T07:22:21.892518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:22:21.892518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractability of approximation by general shallow networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Hrushikesh Mhaskar, Tong Mao","submitted_at":"2023-08-07T00:14:46Z","abstract_excerpt":"In this paper, we present a sharper version of the results in the paper Dimension independent bounds for general shallow networks; Neural Networks, \\textbf{123} (2020), 142-152. Let $\\mathbb{X}$ and $\\mathbb{Y}$ be compact metric spaces. We consider approximation of functions of the form $ x\\mapsto\\int_{\\mathbb{Y}} G( x, y)d\\tau( y)$, $ x\\in\\mathbb{X}$, by $G$-networks of the form $ x\\mapsto \\sum_{k=1}^n a_kG( x, y_k)$, $ y_1,\\cdots, y_n\\in\\mathbb{Y}$, $a_1,\\cdots, a_n\\in\\mathbb{R}$. Defining the dimensions of $\\mathbb{X}$ and $\\mathbb{Y}$ in terms of covering numbers, we obtain dimension inde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.03230","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/2308.03230/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":"2308.03230","created_at":"2026-07-05T07:22:21.892585+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.03230v2","created_at":"2026-07-05T07:22:21.892585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.03230","created_at":"2026-07-05T07:22:21.892585+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLDHNVDHWOXI","created_at":"2026-07-05T07:22:21.892585+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLDHNVDHWOXIEN6P","created_at":"2026-07-05T07:22:21.892585+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLDHNVDH","created_at":"2026-07-05T07:22:21.892585+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06687","citing_title":"Optimal Neural Network Approximation via Empirical Least Squares with Deterministic Samples","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QLDHNVDHWOXIEN6PBKPJVBH2AA","json":"https://pith.science/pith/QLDHNVDHWOXIEN6PBKPJVBH2AA.json","graph_json":"https://pith.science/api/pith-number/QLDHNVDHWOXIEN6PBKPJVBH2AA/graph.json","events_json":"https://pith.science/api/pith-number/QLDHNVDHWOXIEN6PBKPJVBH2AA/events.json","paper":"https://pith.science/paper/QLDHNVDH"},"agent_actions":{"view_html":"https://pith.science/pith/QLDHNVDHWOXIEN6PBKPJVBH2AA","download_json":"https://pith.science/pith/QLDHNVDHWOXIEN6PBKPJVBH2AA.json","view_paper":"https://pith.science/paper/QLDHNVDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.03230&json=true","fetch_graph":"https://pith.science/api/pith-number/QLDHNVDHWOXIEN6PBKPJVBH2AA/graph.json","fetch_events":"https://pith.science/api/pith-number/QLDHNVDHWOXIEN6PBKPJVBH2AA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLDHNVDHWOXIEN6PBKPJVBH2AA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLDHNVDHWOXIEN6PBKPJVBH2AA/action/storage_attestation","attest_author":"https://pith.science/pith/QLDHNVDHWOXIEN6PBKPJVBH2AA/action/author_attestation","sign_citation":"https://pith.science/pith/QLDHNVDHWOXIEN6PBKPJVBH2AA/action/citation_signature","submit_replication":"https://pith.science/pith/QLDHNVDHWOXIEN6PBKPJVBH2AA/action/replication_record"}},"created_at":"2026-07-05T07:22:21.892585+00:00","updated_at":"2026-07-05T07:22:21.892585+00:00"}