{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HJWNQ3OFNSJOZOX2I5R2MIWMIU","short_pith_number":"pith:HJWNQ3OF","schema_version":"1.0","canonical_sha256":"3a6cd86dc56c92ecbafa4763a622cc4522aa2b8027a41ceaa1915612564a0ae7","source":{"kind":"arxiv","id":"2205.14421","version":4},"attestation_state":"computed","paper":{"title":"Approximation of Functionals by Neural Network without Curse of Dimensionality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Yahong Yang, Yang Xiang","submitted_at":"2022-05-28T13:09:43Z","abstract_excerpt":"In this paper, we establish a neural network to approximate functionals, which are maps from infinite dimensional spaces to finite dimensional spaces. The approximation error of the neural network is $O(1/\\sqrt{m})$ where $m$ is the size of networks, which overcomes the curse of dimensionality. The key idea of the approximation is to define a Barron spectral space of functionals."},"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":"2205.14421","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-05-28T13:09:43Z","cross_cats_sorted":["cs.LG","cs.NA","math.OC"],"title_canon_sha256":"e24d7d870f23ad4ee9d7ecbe69c22b670cb45e18a35d94df5158315bb86d1b11","abstract_canon_sha256":"710cf182483ef3423dfb6453680f6e9d7b68db14a8ce751ac28c07cb2a82e513"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:18.533597Z","signature_b64":"b58OK0UMct7+kX9fV9NMKcRw7FO1dgcBRy7u2zTMiQpiDiu1gzArtyUatrBCMsjKBpFrV3McgOJU3yXsJq6vAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a6cd86dc56c92ecbafa4763a622cc4522aa2b8027a41ceaa1915612564a0ae7","last_reissued_at":"2026-07-05T05:29:18.533247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:18.533247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation of Functionals by Neural Network without Curse of Dimensionality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Yahong Yang, Yang Xiang","submitted_at":"2022-05-28T13:09:43Z","abstract_excerpt":"In this paper, we establish a neural network to approximate functionals, which are maps from infinite dimensional spaces to finite dimensional spaces. The approximation error of the neural network is $O(1/\\sqrt{m})$ where $m$ is the size of networks, which overcomes the curse of dimensionality. The key idea of the approximation is to define a Barron spectral space of functionals."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14421","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.14421/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":"2205.14421","created_at":"2026-07-05T05:29:18.533300+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.14421v4","created_at":"2026-07-05T05:29:18.533300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14421","created_at":"2026-07-05T05:29:18.533300+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJWNQ3OFNSJO","created_at":"2026-07-05T05:29:18.533300+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJWNQ3OFNSJOZOX2","created_at":"2026-07-05T05:29:18.533300+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJWNQ3OF","created_at":"2026-07-05T05:29:18.533300+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.04256","citing_title":"Error analysis for learning the time-stepping operator of evolutionary PDEs","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HJWNQ3OFNSJOZOX2I5R2MIWMIU","json":"https://pith.science/pith/HJWNQ3OFNSJOZOX2I5R2MIWMIU.json","graph_json":"https://pith.science/api/pith-number/HJWNQ3OFNSJOZOX2I5R2MIWMIU/graph.json","events_json":"https://pith.science/api/pith-number/HJWNQ3OFNSJOZOX2I5R2MIWMIU/events.json","paper":"https://pith.science/paper/HJWNQ3OF"},"agent_actions":{"view_html":"https://pith.science/pith/HJWNQ3OFNSJOZOX2I5R2MIWMIU","download_json":"https://pith.science/pith/HJWNQ3OFNSJOZOX2I5R2MIWMIU.json","view_paper":"https://pith.science/paper/HJWNQ3OF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.14421&json=true","fetch_graph":"https://pith.science/api/pith-number/HJWNQ3OFNSJOZOX2I5R2MIWMIU/graph.json","fetch_events":"https://pith.science/api/pith-number/HJWNQ3OFNSJOZOX2I5R2MIWMIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJWNQ3OFNSJOZOX2I5R2MIWMIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJWNQ3OFNSJOZOX2I5R2MIWMIU/action/storage_attestation","attest_author":"https://pith.science/pith/HJWNQ3OFNSJOZOX2I5R2MIWMIU/action/author_attestation","sign_citation":"https://pith.science/pith/HJWNQ3OFNSJOZOX2I5R2MIWMIU/action/citation_signature","submit_replication":"https://pith.science/pith/HJWNQ3OFNSJOZOX2I5R2MIWMIU/action/replication_record"}},"created_at":"2026-07-05T05:29:18.533300+00:00","updated_at":"2026-07-05T05:29:18.533300+00:00"}