{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BC6BBPJ25EZR2LWYXL5XMJGE3U","short_pith_number":"pith:BC6BBPJ2","schema_version":"1.0","canonical_sha256":"08bc10bd3ae9331d2ed8bafb7624c4dd14804f86fb0d548e12993a2f51c3b082","source":{"kind":"arxiv","id":"2110.03673","version":2},"attestation_state":"computed","paper":{"title":"Tighter Sparse Approximation Bounds for ReLU Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Carles Domingo-Enrich, Youssef Mroueh","submitted_at":"2021-10-07T17:57:20Z","abstract_excerpt":"A well-known line of work (Barron, 1993; Breiman, 1993; Klusowski & Barron, 2018) provides bounds on the width $n$ of a ReLU two-layer neural network needed to approximate a function $f$ over the ball $\\mathcal{B}_R(\\mathbb{R}^d)$ up to error $\\epsilon$, when the Fourier based quantity $C_f = \\frac{1}{(2\\pi)^{d/2}} \\int_{\\mathbb{R}^d} \\|\\xi\\|^2 |\\hat{f}(\\xi)| \\ d\\xi$ is finite. More recently Ongie et al. (2019) used the Radon transform as a tool for analysis of infinite-width ReLU two-layer networks. In particular, they introduce the concept of Radon-based $\\mathcal{R}$-norms and show that a f"},"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":"2110.03673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-10-07T17:57:20Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"cda364094dd94d9bcce8fcc1d4a4b03fe4c511e76b16e29d0d45ba078b1ebf86","abstract_canon_sha256":"2ef973da7863884c62a54b8c7b6657be295b6b6dc9fff08876c8faa3a0aede67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:13.399932Z","signature_b64":"whNziCmucxmAU3vbmc0anvHAyO8Lg4q6mG7vEcDrn7T/EpFe/b7t2GLZ9afHdYcIvRMDfYxjHn7ImImzAVYxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08bc10bd3ae9331d2ed8bafb7624c4dd14804f86fb0d548e12993a2f51c3b082","last_reissued_at":"2026-07-05T03:35:13.399440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:13.399440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tighter Sparse Approximation Bounds for ReLU Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Carles Domingo-Enrich, Youssef Mroueh","submitted_at":"2021-10-07T17:57:20Z","abstract_excerpt":"A well-known line of work (Barron, 1993; Breiman, 1993; Klusowski & Barron, 2018) provides bounds on the width $n$ of a ReLU two-layer neural network needed to approximate a function $f$ over the ball $\\mathcal{B}_R(\\mathbb{R}^d)$ up to error $\\epsilon$, when the Fourier based quantity $C_f = \\frac{1}{(2\\pi)^{d/2}} \\int_{\\mathbb{R}^d} \\|\\xi\\|^2 |\\hat{f}(\\xi)| \\ d\\xi$ is finite. More recently Ongie et al. (2019) used the Radon transform as a tool for analysis of infinite-width ReLU two-layer networks. In particular, they introduce the concept of Radon-based $\\mathcal{R}$-norms and show that a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03673","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/2110.03673/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":"2110.03673","created_at":"2026-07-05T03:35:13.399500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.03673v2","created_at":"2026-07-05T03:35:13.399500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03673","created_at":"2026-07-05T03:35:13.399500+00:00"},{"alias_kind":"pith_short_12","alias_value":"BC6BBPJ25EZR","created_at":"2026-07-05T03:35:13.399500+00:00"},{"alias_kind":"pith_short_16","alias_value":"BC6BBPJ25EZR2LWY","created_at":"2026-07-05T03:35:13.399500+00:00"},{"alias_kind":"pith_short_8","alias_value":"BC6BBPJ2","created_at":"2026-07-05T03:35:13.399500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.02791","citing_title":"Orthogonal greedy algorithm for linear operator learning with shallow neural network","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BC6BBPJ25EZR2LWYXL5XMJGE3U","json":"https://pith.science/pith/BC6BBPJ25EZR2LWYXL5XMJGE3U.json","graph_json":"https://pith.science/api/pith-number/BC6BBPJ25EZR2LWYXL5XMJGE3U/graph.json","events_json":"https://pith.science/api/pith-number/BC6BBPJ25EZR2LWYXL5XMJGE3U/events.json","paper":"https://pith.science/paper/BC6BBPJ2"},"agent_actions":{"view_html":"https://pith.science/pith/BC6BBPJ25EZR2LWYXL5XMJGE3U","download_json":"https://pith.science/pith/BC6BBPJ25EZR2LWYXL5XMJGE3U.json","view_paper":"https://pith.science/paper/BC6BBPJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.03673&json=true","fetch_graph":"https://pith.science/api/pith-number/BC6BBPJ25EZR2LWYXL5XMJGE3U/graph.json","fetch_events":"https://pith.science/api/pith-number/BC6BBPJ25EZR2LWYXL5XMJGE3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BC6BBPJ25EZR2LWYXL5XMJGE3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BC6BBPJ25EZR2LWYXL5XMJGE3U/action/storage_attestation","attest_author":"https://pith.science/pith/BC6BBPJ25EZR2LWYXL5XMJGE3U/action/author_attestation","sign_citation":"https://pith.science/pith/BC6BBPJ25EZR2LWYXL5XMJGE3U/action/citation_signature","submit_replication":"https://pith.science/pith/BC6BBPJ25EZR2LWYXL5XMJGE3U/action/replication_record"}},"created_at":"2026-07-05T03:35:13.399500+00:00","updated_at":"2026-07-05T03:35:13.399500+00:00"}