{"as_of":"2026-08-14T07:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:235aa343d41fbb18684657c0888f6f76e8e7cbe2bd7af8cd7210e2765ab37b1e","coverage":[{"denominator":118,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:12:59.251659Z","state":"measured"},{"denominator":101,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":101,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T17:00:37.250246Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T17:51:09.277513Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"cited_work":{"arxiv_id":"2509.00924","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.00924","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"S., and Roy, D.Beyond universal approximation theorems: Algorithmic uniform approximation by neural networks trained with noisy data.arXiv preprint arXiv:2509.00924 (2025)","venue":null,"work_id":"559db760-d0e3-4c43-bc7d-39c2c5e00271","year":2025},"citing_paper":{"arxiv_id":"2605.04995","last_updated":"2026-05-06T14:53:55Z","snapshot_observed_at":"2026-08-11T13:31:05.753478Z","submitted_at":"2026-05-06T14:53:55Z","title":"Adaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-08T17:00:37.250246Z"},"links":{"cited_paper":"/paper/2509.00924","citing_paper":"/paper/2605.04995"},"observation_digest":"sha256:fab1b463d23e9401373a6e227db37147953943bbddc7679dbfe58cff7990c73c","observation_id":"7e366cca-b399-4407-baee-d38416946eec","resolution":{"observed_at":"2026-05-11T17:51:09.280151Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.00924/citation-record","integrity":"/paper/2509.00924/integrity","json":"/paper/2509.00924/citation-record.json","paper":"/paper/2509.00924"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.04108","last_updated":"2024-11-06T18:36:21Z","snapshot_observed_at":"2026-08-14T07:07:40.146431Z","submitted_at":"2024-11-06T18:36:21Z","title":"Weighted Sobolev Approximation Rates for Neural Networks on Unbounded Domains","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04108","snapshot_observed_at":"2026-08-05T13:12:58.943544Z","title":"Weighted Sobolev Approximation Rates for Neural Networks on Unbounded Domains","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.943544Z"},"links":{"cited_paper":"/paper/2411.04108","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:22bb6ada3fc8c0b836f4f4d562d7a292655345e176cdf9272837d7c3b9d5a369","observation_id":"13fe236c-a871-4062-a42c-c1e19afe1423","resolution":{"observed_at":"2026-08-05T13:12:58.943544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.947678Z","title":"Designing universal causal deep learning models: The geometric (hyper) transformer.Mathematical Finance, 34(2):671–735, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.947678Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:3983476dafa3b5891636fa7065e498e3eade7a275ea6f4570668398f9f3ee131","observation_id":"0fee83e8-6e2f-4d2b-b96f-79e4eb36515e","resolution":{"observed_at":"2026-08-05T13:12:58.947678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.951412Z","title":"Slic superpixels compared to state-of-the-art superpixel methods.IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(11):2274–2282, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.951412Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:e8c27a1e26a8be581c95ec07c3396d91c45afcf77f148f6bf2b8290cd61b4476","observation_id":"2577e5f0-5dd0-4d64-93cd-c1ec28d35279","resolution":{"observed_at":"2026-08-05T13:12:58.951412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.06081","last_updated":"2021-03-05T00:48:51Z","snapshot_observed_at":"2026-08-13T20:47:57.215830Z","submitted_at":"2020-12-11T02:02:14Z","title":"Deep Neural Networks Are Effective At Learning High-Dimensional Hilbert-Valued Functions From Limited Data","version":2},"cited_work":{"arxiv_id":"2012.06081","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.06081","snapshot_observed_at":"2026-08-05T13:12:59.530887Z","title":"Deep Neural Networks Are Effective At Learning High-Dimensional Hilbert-Valued Functions From Limited Data","venue":"cs.LG","work_id":"de457a94-938b-4f3a-91a2-e2e12ba3af59","year":2020},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.954990Z"},"links":{"cited_paper":"/paper/2012.06081","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:f12dbdbfe3dce7b58dcfdeedc862079369710f4bb478cdf61f42a86f5556335c","observation_id":"f68249b5-e37a-4b45-9e83-a1891d057ece","resolution":{"observed_at":"2026-08-05T13:12:59.534657Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.958739Z","title":"Scale-sensitive dimensions, uniform convergence, and learnability.Journal of the ACM (JACM), 44(4):615–631, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.958739Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:a2218b2b3379dfa1679c398b9b55bb724d0f714840f24569727169f3ea8c6bea","observation_id":"d676167e-5c20-4b1b-9161-f507071c05cc","resolution":{"observed_at":"2026-08-05T13:12:58.958739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.961990Z","title":"Scale-sensitive dimensions, uniform convergence, and learnability.J","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.961990Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:e260a33d42873dd67c09aa6af6310bd59f486f6fffe8caa4e8f28cbb401812ad","observation_id":"c52172c9-c3b7-401e-9263-716b5e4b7416","resolution":{"observed_at":"2026-08-05T13:12:58.961990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.965456Z","title":"On the properties of variational approximations of gibbs posteriors","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.965456Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:aeed0277a87f6a4790e26b7b854f2575c56198d8ecabc68cbdb64d4728791633","observation_id":"24e18548-b1e2-4c4e-badd-cb96c4912082","resolution":{"observed_at":"2026-08-05T13:12:58.965456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.968313Z","title":"Some fine properties of sets of finite perimeter in ahlfors regular metric measure spaces","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.968313Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:ded2cf7da3289e25ec8f662802197a982e4faa6c90fa1692fb040478bdb36871","observation_id":"d0cce83a-f696-4d87-9ce5-2e5cdba9af80","resolution":{"observed_at":"2026-08-05T13:12:58.968313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.971231Z","title":"On a theory of learning with similarity functions","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.971231Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:c170bdbd1855d6839e8c5fe9189e8b742a3fbab13514e18d22d88f81b71f373f","observation_id":"b6127dc7-8669-4c0e-aff4-0256f7c57fa0","resolution":{"observed_at":"2026-08-05T13:12:58.971231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.974354Z","title":"Universal approximation bounds for superpositions of a sigmoidal function","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.974354Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:f91a15eb5047be237ae47f2bf056806793f866d3697fc4edb8a4cd33f9c1616f","observation_id":"7304e325-7f9f-42aa-9ef4-f316f9e83516","resolution":{"observed_at":"2026-08-05T13:12:58.974354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.977481Z","title":"Spectrally-normalized margin bounds for neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.977481Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:4ed0508b38ba035d99234e1dd078439b7df07d2d8dd85a07eb90bdc23ffcb68d","observation_id":"cbc4e23a-1ca9-460a-9bc6-46ac28c57f85","resolution":{"observed_at":"2026-08-05T13:12:58.977481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.980885Z","title":"Nearly-tight vc-dimension and pseudodimension bounds for piecewise linear neural networks.Journal of MachineLearning Research, 20(63):1– 17, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.980885Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:9212dcd8fc003fdd83414228c5046605c56929f8e56935c1dc932d40f2540418","observation_id":"4e861d54-1e10-4539-9b40-8f8bc193f5c3","resolution":{"observed_at":"2026-08-05T13:12:58.980885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.983895Z","title":"Vapnik-chervonenkis dimension of neural nets.The handbook of brain theory and neural networks, pages 1188–1192, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.983895Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:126eea1e69de54028042e87dcd5b2d1b82d8ac1fdce7344de9f11fb941c27286","observation_id":"5ff09a1f-13c1-42af-99aa-ec6bd0db3274","resolution":{"observed_at":"2026-08-05T13:12:58.983895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.986618Z","title":"On numerical computation for the distribution of the convolution ofN independent rectified Gaussian variables.J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.986618Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:1dedc79a802838f552d693fd2cfb72aa6c4799c71bb4eb69dcfd7b2024426fc0","observation_id":"a205771d-b87e-4d4f-a9b3-3d2cee7721d5","resolution":{"observed_at":"2026-08-05T13:12:58.986618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.989888Z","title":"Learnability and the vapnik-chervonenkis dimension.Journal of the ACM (JACM), 36(4):929–965, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.989888Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:7a2c789defee5eb4ad4c4572c351d46ecab3091ed45a040408c73ac1b0c19a87","observation_id":"0ac7064e-abdf-4064-917d-71a62f3354ac","resolution":{"observed_at":"2026-08-05T13:12:58.989888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.992443Z","title":"Optimal approximation with sparsely connected deep neural networks.SIAM Journal on Mathematics of Data Science, 1(1):8–45, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.992443Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:81f205c36ac6cb69a88a1911e18f4805a0fe9636d6f00b04db5d071021eed78a","observation_id":"cbbe501b-5dd6-4cf5-a633-3e4a3cc179fd","resolution":{"observed_at":"2026-08-05T13:12:58.992443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:58.995132Z","title":"Practical existence theorems for deep learning approximation in high dimensions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.995132Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:5660498ddd6d7d7fa2aa500717f16bfcc85c3c4fb83e4356a3747568df0eb328","observation_id":"2f6b2482-f72b-449c-aee3-66d174bd9c97","resolution":{"observed_at":"2026-08-05T13:12:58.995132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2406.01539","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.509970Z","title":"Physics-informed deep learning and compressive collocation for high-dimensional diffusion-reaction equations: practical existence theory and numerics","venue":null,"work_id":"42b42b0d-8a40-4d0f-a02d-662ef3719892","year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:58.998432Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:989a78125663914b24309789a6a348bc053152316496850a3f5c3d54a13fceae","observation_id":"cba87364-3241-422b-ab26-297d84e0e616","resolution":{"observed_at":"2026-08-05T13:12:59.516228Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.001778Z","title":"Physics-informed neural networks (pinns) for fluid mechanics: A review.Acta Mechanica Sinica, 37(12):1727–1738, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.001778Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:ecb798c0355e6d9e9cdfc99388a29efb7e9d254e099e09eb5372165ed7542716","observation_id":"72404f47-b882-4603-b8e2-d20b87283036","resolution":{"observed_at":"2026-08-05T13:12:59.001778Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.005021Z","title":"Dimension-free log-sobolev inequalities for mixture distributions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.005021Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:68bc39b32c237f733de2ff851595fc4fe4ec61b43efacad3b343b09bfcd42c08","observation_id":"436a3680-a451-4c07-aab9-6f4983f8ed6c","resolution":{"observed_at":"2026-08-05T13:12:59.005021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.008128Z","title":"Characterizing overfitting in kernel ridgeless regression through the eigenspectrum","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.008128Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:f6149024ef5a013f7f42ce6e08803453e8519593b17b92228ef565dc14bb819f","observation_id":"8d156383-6769-4ac1-bd77-a1e30b0a0576","resolution":{"observed_at":"2026-08-05T13:12:59.008128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.011106Z","title":"A comprehensive analysis on the learning curve in kernel ridge regression.Advancesin Neural Information Processing Systems, 37:24659–24723, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.011106Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:f0def18627b071a8c8bc6b5a1513f61bbb9a29f6fff243f14e10e7b9be6a2be4","observation_id":"d632b125-9cac-4be8-8872-821a1dc865f8","resolution":{"observed_at":"2026-08-05T13:12:59.011106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.014183Z","title":"A theoretical analysis of the test error of finite-rank kernel ridge regression","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.014183Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:4316063a5c0ef760c2d93fbedddda01b769801a2800eb0e6e9f95debd0a120a8","observation_id":"ac7f57df-f598-4dcf-b3b5-c923bb2fad95","resolution":{"observed_at":"2026-08-05T13:12:59.014183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.017510Z","title":"Efficient approximation of high-dimensional functions with neural networks.IEEE Transactions on Neural Networks and Learning Systems, 33(7):3079– 3093, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.017510Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:cb4b2ed61d96ec692257877a5a4977627f13b353ed0ba0ce585c362fc3e86e0e","observation_id":"285a296e-2c36-485d-9f58-84e86e4c39ec","resolution":{"observed_at":"2026-08-05T13:12:59.017510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.020516Z","title":"Optimal stable nonlinear approximation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.020516Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:e58020bd09e1eec2ff76a810a691be034e36c3bc67c39c30fe700feed16bcc6e","observation_id":"2a6daafd-c40b-4ea1-ae52-01b1df6420d6","resolution":{"observed_at":"2026-08-05T13:12:59.020516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.023556Z","title":"An improved uniform convergence bound with fat-shattering dimension","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.023556Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:2dac0f1eafa770fc23079814318bf98f0ff308b4909e77fa392e77d6a720b47b","observation_id":"58f9f023-b057-4a09-9c20-a51efdc8d37d","resolution":{"observed_at":"2026-08-05T13:12:59.023556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.026735Z","title":"Scientific machine learning through physics–informed neural networks: Where we are and what’s next","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.026735Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:ad155d0659e653027149c1404a8dd8e4051367baa2bb100e4c8e7f92489c98f7","observation_id":"0e799f20-35ca-4e09-8d4e-1d41f7109eaf","resolution":{"observed_at":"2026-08-05T13:12:59.026735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.030015Z","title":"Approximation by superpositions of a sigmoidal function.Mathematics of Control, Signals and Systems, 2(4):303–314, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.030015Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:1b72349d866a84ecaf344d43492de1ca43e766d492a353715a4f0cdce71d4a36","observation_id":"67310d2b-505a-4eb0-8a7e-336300263a0f","resolution":{"observed_at":"2026-08-05T13:12:59.030015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.033092Z","title":"Nonlinear approxima- tion and (deep) relu networks.Constructive Approximation, 55(1):127–172, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.033092Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:de4f3551cecb9946d065aace3bb68fb59665c1cb28a5f6020dc0afc3586cd829","observation_id":"f52cc146-0b67-4e24-8c00-a0eabd6b6003","resolution":{"observed_at":"2026-08-05T13:12:59.033092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.035996Z","title":"Rogue waves and large deviations in deep sea","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.035996Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:85b518c395124042802069861643e62a13d0d181caa408fdbcae9c443ec23881","observation_id":"24114f97-7106-4387-92e7-4aeb6a8334b6","resolution":{"observed_at":"2026-08-05T13:12:59.035996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.038939Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.038939Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:b04290a092f679df32bc0a36feb44063cbb161f5dc1162e70251ef5dd1729cc2","observation_id":"4aebdae8-24ab-4f21-88d2-c2ddda60e82d","resolution":{"observed_at":"2026-08-05T13:12:59.038939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.041686Z","title":"Wavelet compression and nonlinear n-widths","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.041686Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:06d3ce504783ac0ccc0b16d1f49aaa0aa147b8eef7d6f00415c0b39619f43478","observation_id":"cc13991b-8f30-44ee-ac7e-c1e9d685925a","resolution":{"observed_at":"2026-08-05T13:12:59.041686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.045049Z","title":"Learning multivariate log-concave distributions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.045049Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:e5e1a74b2b9457800c29c1bea140f5f0f4c0f327de82c135b3283e2b4a6c9f19","observation_id":"ac034326-5f99-4e49-9988-e7d5636342e8","resolution":{"observed_at":"2026-08-05T13:12:59.045049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.048013Z","title":"Memorization with neural nets: Going beyond the worst case","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.048013Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:87b29c64bed22136131c1516cc91c3ef0629fda4b390649487f315d6205a9c74","observation_id":"9060280e-0d96-4d60-ae05-e36f5bd9a47b","resolution":{"observed_at":"2026-08-05T13:12:59.048013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.11008","last_updated":"2017-10-19T03:39:56Z","snapshot_observed_at":"2026-08-12T18:04:44.769799Z","submitted_at":"2017-03-31T17:56:41Z","title":"Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.11008","snapshot_observed_at":"2026-08-05T13:12:59.051449Z","title":"Computing nonvacuous generalization bounds for deep (stochastic) neural networks with many more parameters than training data.arXiv preprint arXiv:1703.11008, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.051449Z"},"links":{"cited_paper":"/paper/1703.11008","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:2ba875a122c354408ecfb42c087a0164faf01321842c9a8aea6e8d0f6b49b050","observation_id":"e9e4f37f-4da6-4f9e-abe6-13fdd7af4e62","resolution":{"observed_at":"2026-08-05T13:12:59.051449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.054961Z","title":"Vc dimension of graph neural networks with pfaffian activation functions.Neural Networks, 182:106924, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.054961Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:33c7a54f93184f2a30f70d5dccdb7af151c2659b4153293757db89b988228cb7","observation_id":"4c75714e-c378-430a-a60e-db34d7653857","resolution":{"observed_at":"2026-08-05T13:12:59.054961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.058379Z","title":"On the efficiency of erm in feature learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.058379Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:bcd7309131ceb43f54337d6fb647ed2e5fc20b73492631f781b44e34e6871b8c","observation_id":"096939c5-976d-48b0-a51f-be10e6429db5","resolution":{"observed_at":"2026-08-05T13:12:59.058379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.061498Z","title":"Springer, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.061498Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:e2518596f16d81d3a02f3e81d87bd3abccf4124a85ec7afe3255534b5cd145df","observation_id":"4d2470b8-43e1-4b21-9a04-7e6cb00600d4","resolution":{"observed_at":"2026-08-05T13:12:59.061498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.064317Z","title":"Benefits of additive noise in composing classes with bounded capacity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.064317Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:0c56b43b402be7827c2a82fdd66dd6959e2ee3e254ac598ea790a8aa6b3fccf6","observation_id":"947af7e8-690a-46fd-980f-80230c689ddc","resolution":{"observed_at":"2026-08-05T13:12:59.064317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.067270Z","title":"Sum-of-squares proofs of logarithmic sobolev inequalities on finite markov chains","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.067270Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:7c07642f1192751fbb7840ef242eb81baf20fdb4ef2d76462de5537a0fabd5b0","observation_id":"66f5a519-e1c8-4937-952f-746b9b7a15cd","resolution":{"observed_at":"2026-08-05T13:12:59.067270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.070228Z","title":"Efficient graph-based image segmentation.International Journal of Computer Vision, 59(2):167–181, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.070228Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:ebaf6a9f6f2d40a403ba0d8c98232ec691afb1bdea0e7cb7f3d22a5920887620","observation_id":"71f3fa5d-502b-4dc7-9304-d685574325db","resolution":{"observed_at":"2026-08-05T13:12:59.070228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.073094Z","title":"Sample compression, learnability, and the vapnik-chervonenkis dimension","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.073094Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:2f9f3e9daf744168ad312c10dd0c461dc8081141d4269764e6922d72d9a2a7b2","observation_id":"3784bf5c-19ac-4aa4-8151-51819bf2b53d","resolution":{"observed_at":"2026-08-05T13:12:59.073094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.306872Z","title":"A practical existence theorem for reduced order models based on convolutional autoencoders.Foundations of Data Science, 7(1):72–98, 2025","venue":null,"work_id":"db09a1cc-34a5-4349-a9db-8cba1a30a15f","year":2025},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.076557Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:6f25213249cd336cda5d4a3c4ab9e46dda4c2f3eddf160d3a6e95bf0c263ae4c","observation_id":"257efec6-902b-43a7-b6b2-d0e8fe6186a6","resolution":{"observed_at":"2026-08-05T13:13:00.310689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.294241Z","title":"Benign overfitting without linearity: Neural network classifiers trained by gradient descent for noisy linear data","venue":null,"work_id":"9309a5f2-b645-404b-984e-e5d02244f951","year":2022},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.079580Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:3bfbf04ccca9f1b4781dc17a8c4e274c235130872c556a7991e80585f20f5a92","observation_id":"026dd872-161a-4278-a995-0a98b385c809","resolution":{"observed_at":"2026-08-05T13:13:00.298753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.282967Z","title":"On the approximate realization of continuous mappings by neural networks.Neural networks, 2(3):183–192, 1989","venue":null,"work_id":"d4f624bd-80d8-448f-93be-c8c57c631d41","year":1989},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.082455Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:44f8a88864a8700c3be7ac07eeb8cff9a7839b8b6428784e8bc2749e6b1910aa","observation_id":"2ce89b83-8b00-4725-9ab6-2f79e360e3e9","resolution":{"observed_at":"2026-08-05T13:13:00.286480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.271389Z","title":"Scaling description of generalization with number of parameters in deep learning","venue":null,"work_id":"9bca2b5d-6bb3-4c95-a8ef-f5d23740be90","year":2020},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.085258Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:5e47db220603ba7ff5f5ce101aa605876777144e86722fe75fe6e57e94f9cfb7","observation_id":"df8b1230-0488-4559-bb42-c957c305a12b","resolution":{"observed_at":"2026-08-05T13:13:00.274984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.258716Z","title":"Random feature neural networks learn black-scholes type pdes without curse of dimensionality","venue":null,"work_id":"e6a19ba6-8ed8-4c70-b017-6468547b3d97","year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.088149Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:736485bc9edc210e8789e75f96049b1fa88d375e4136b29caf0c335f77ac910d","observation_id":"f06a432a-192f-4afb-bc03-39cda905eb2f","resolution":{"observed_at":"2026-08-05T13:13:00.263034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.246360Z","title":"Risk bounds for reservoir computing.Journal of Machine Learning Research, 21(240):1–61, 2020","venue":null,"work_id":"0ebc27fd-f749-488d-8103-9e136b985b74","year":2020},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.090865Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:4dc98fba90321dfb577e6f40d3a1d7da3b0ea06ef1d1059f892d33f00b38c8b6","observation_id":"1b758a22-ea81-4ba1-9d80-5960b993bb1a","resolution":{"observed_at":"2026-08-05T13:13:00.250116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.234658Z","title":"A new proof of szemerédi’s theorem.Geometric & Functional Analysis GAFA, 11(3):465– 588, 2001","venue":null,"work_id":"e8b65fa4-d1cd-46f6-9a65-b27003db5bfc","year":2001},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.093524Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:63e9d7a5c1f521e86b5c29f90bbc8a129ba618333130b0ff9b34adee7a78da1f","observation_id":"10ea82f1-372c-4249-9da4-1581a0b0a31e","resolution":{"observed_at":"2026-08-05T13:13:00.238332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.222235Z","title":"Universal function approximation by deep neural nets with bounded width and relu activations","venue":null,"work_id":"a7d77916-1f94-4e62-8703-411fe114f538","year":2019},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.096244Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:b4506c1b3923022c2397abf3c289173ced7992ede323f3d6c61dea3f59802999","observation_id":"b1e9f30e-709f-4185-8e0a-2b2b0b0094b6","resolution":{"observed_at":"2026-08-05T13:13:00.225949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.210872Z","title":"Probability inequalities for sums of bounded random variables.J","venue":null,"work_id":"6658e50d-59c8-4fe2-9202-0419ecea6c69","year":1963},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.099372Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:d2134847a971746b44194f3d4b2b18076aab462e3f20dcde658abe7aca49a449","observation_id":"746e2942-bd0b-43f4-a09a-fdc5ab73d076","resolution":{"observed_at":"2026-08-05T13:13:00.214546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12335","last_updated":"2025-06-26T04:08:57Z","snapshot_observed_at":"2026-08-12T22:42:09.012751Z","submitted_at":"2024-09-18T22:05:07Z","title":"Bridging the Gap Between Approximation and Learning via Optimal Approximation by ReLU MLPs of Maximal Regularity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12335","snapshot_observed_at":"2026-08-05T13:12:59.102611Z","title":"Bridging the gap between approximation and learning via optimal approximation by relu mlps of maximal regularity.arXiv preprint arXiv:2409.12335, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.102611Z"},"links":{"cited_paper":"/paper/2409.12335","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:5de1f287277101f44f2eb2964f3f8726eeff38ebac86a35e864871adb26a7b65","observation_id":"08cfef2c-51c7-41e7-82e3-a3ae0305dd92","resolution":{"observed_at":"2026-08-05T13:12:59.102611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.199594Z","title":"Horn and Charles R","venue":null,"work_id":"999bb787-217c-4903-82db-cff3d895d4b6","year":2013},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.106339Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:018497abb8f1df9a93f7e17e059604b7b11ef946e2d0038b51517105429dc7e9","observation_id":"158e3600-77b1-4f40-8ed8-6e88ba9992d1","resolution":{"observed_at":"2026-08-05T13:13:00.202989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.109136Z","title":"Multilayer feedforward networks are universal approximators","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.109136Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:08fdac0d8ef763ca74c9477a295c945e03a0e6266e3bd010adeab5a01fada3f4","observation_id":"f77593e1-e5f7-4b5a-8c45-ab169f382f95","resolution":{"observed_at":"2026-08-05T13:12:59.109136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.112083Z","title":"Universal approximation of an unknown mapping and its derivatives using multilayer feedforward networks.Neural networks, 3(5):551–560, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.112083Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:f163cab070148c1892c1bd12ebf532d4e5bf413167a83f38289a2043036ac473","observation_id":"997a6988-a872-421a-a3e4-14a68d44b62c","resolution":{"observed_at":"2026-08-05T13:12:59.112083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.171873Z","title":"Instance-dependent generalization bounds via optimal transport.Journal of Machine Learning Research, 24(349):1–51, 2023","venue":null,"work_id":"72248930-3eec-432f-940b-d6efc1cad8a8","year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.115015Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:83142dcf43f67222acdc20cff318cf521b166cfd05238e61f9564cf1b2ce8c21","observation_id":"e7552dd5-ba2d-4c61-88fb-b62f8add477c","resolution":{"observed_at":"2026-08-05T13:13:00.176332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.159194Z","title":"Learning image priors through patch-based diffusion models for solving inverse problems.Advancesin Neural Information Processing Systems, 37:1625–1660, 2024","venue":null,"work_id":"45b3e48f-4b9b-4327-9acf-d883a13869ca","year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.117900Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:a99fa4156f3b0c374cbd8c9701b9a9a57615b0836d8d66b964b5a1c81da5ad89","observation_id":"d969f136-a2dd-4206-b512-655e62077d4f","resolution":{"observed_at":"2026-08-05T13:13:00.163463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.147158Z","title":"Neural tangent kernel: Convergence and generalization in neural networks","venue":null,"work_id":"5314936d-4489-47de-a84a-dd557c6ae88f","year":2018},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.120942Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:5506a255f67845c54461fb85aadd1de6833e595577f486aa2e2b4c190c78b46a","observation_id":"e0be3bad-c53f-4622-9812-aa9046628b05","resolution":{"observed_at":"2026-08-05T13:13:00.151002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.133481Z","title":"Deep neural networks with relu-sine-exponential activations break curse of dimensionality in approximation on hölder class","venue":null,"work_id":"e365b19b-99a1-47b0-8e38-68e2acdf637e","year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.124379Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:f96533cc0a47bc212c01855300fed7cb548024b30caa3d7f193a79e48647a6b1","observation_id":"e83c85af-11ec-4608-9ac0-2b71d11d29e0","resolution":{"observed_at":"2026-08-05T13:13:00.138190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.122031Z","title":"Universal approximation with deep narrow networks","venue":null,"work_id":"cfc8328f-2370-424d-8c3f-57ac3c116fa9","year":2020},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.127724Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:4e7c91ccdf28b7c5d0fcf070b54c536fdc4101cb981754d5ba59d658b6b95de5","observation_id":"dc72d492-8e24-496a-85df-af7b031fe64b","resolution":{"observed_at":"2026-08-05T13:13:00.125790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.109995Z","title":"Provable memorization capacity of transformers","venue":null,"work_id":"e519609c-28d0-46c3-97df-157f02d4dab9","year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.130581Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:301cf752a27e5b71d4b4860fa5196f5923251579a4b6337f97c5333d96e41e7f","observation_id":"bcdab113-170f-4eac-a76b-2a2064ca52ff","resolution":{"observed_at":"2026-08-05T13:13:00.113526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.098135Z","title":"Benignoverfittingintwo-layerreluconvolutional neural networks","venue":null,"work_id":"d67b93f0-15e0-4f5a-9e9c-61e28f414a11","year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.133691Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:07f123be019bdd19194314db9b0c83ea2da1812b45e925aa57a731ecd4e72ff0","observation_id":"8e27d569-e0ae-4d24-a828-38a98b7f22df","resolution":{"observed_at":"2026-08-05T13:13:00.102069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.136527Z","title":"Neural operator: Learning maps between function spaces with applications to pdes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.136527Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:5aeae8888f55dd98181141b18ff98681e095c5684d1dcec903342afd57987d90","observation_id":"86addfbe-3a60-4943-8ce0-ee385054a6fc","resolution":{"observed_at":"2026-08-05T13:12:59.136527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.078302Z","title":"Small transformers compute universal metric embeddings","venue":null,"work_id":"45baadee-e464-4158-8e38-637c441f2e67","year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.139621Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:5bb39cd2d5ba3d7af03bcce11abbabd2237772ab3d7bfd1ca88aed68dc5e3153","observation_id":"a56e90ec-ced0-42a2-a087-3fcc4d7f77a1","resolution":{"observed_at":"2026-08-05T13:13:00.082419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03327","last_updated":"2025-02-05T16:22:46Z","snapshot_observed_at":"2026-08-10T19:53:21.566495Z","submitted_at":"2025-02-05T16:22:46Z","title":"Is In-Context Universality Enough? MLPs are Also Universal In-Context","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03327","snapshot_observed_at":"2026-08-05T13:12:59.142441Z","title":"Is in-context universality enough? mlps are also universal in-context","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.142441Z"},"links":{"cited_paper":"/paper/2502.03327","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:72fded919e9dbde2a35bbe944681f19902fe097406a30e7fa8a6119bfba9fa9e","observation_id":"176dbf16-26da-40ad-8009-8b4d397fc23b","resolution":{"observed_at":"2026-08-05T13:12:59.142441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.065585Z","title":"Universal approximation theorems for differentiable geometric deep learning","venue":null,"work_id":"3322d230-c87f-4d9b-9fc2-695ec44aaae1","year":2022},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.145708Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:458190608696a92abf702c6bff065e8433373405ed492000c6c1ba5f1369dc74","observation_id":"81bb2d03-3475-46d6-be2c-21695f9105d6","resolution":{"observed_at":"2026-08-05T13:13:00.070137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.053582Z","title":"Sur l’intégration des fonctions discontinues","venue":null,"work_id":"396f4601-d4be-4441-88b2-de5693e44e77","year":1910},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.149361Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:fb2ae848e7a01a864f7dbf48c25000f10cf908784b2cebfddeebf91b09ed90dd","observation_id":"30540c55-3a27-450b-96cf-d5c45d04c6ab","resolution":{"observed_at":"2026-08-05T13:13:00.057526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.040507Z","title":"Oracle inequalities for high-dimensional prediction.Bernoulli, 25(2):1225–1255, 2019","venue":null,"work_id":"12cec582-cbbe-4305-9aa7-640925c5b010","year":2019},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.152316Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:14816f30a2fb4fa59b15e58da31c91d11d037943798e082f79942eb03540d3f0","observation_id":"dddf0e92-6330-421b-978c-c8e37317f49c","resolution":{"observed_at":"2026-08-05T13:13:00.044688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.027720Z","title":"Springer-Verlag, Berlin, 1991","venue":null,"work_id":"1f6ca849-e415-474b-ab41-218017547d90","year":1991},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.155320Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:78c3b157aecec39bb99eb28722a2694071818450b62c0b76596042aa1f7c9de8","observation_id":"63e7e358-402e-445f-b4f4-a824904f7b44","resolution":{"observed_at":"2026-08-05T13:13:00.031713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:13:00.011554Z","title":"Lower bounds on the vc-dimension of smoothly parametrized function classes","venue":null,"work_id":"7a8505eb-59c6-4084-b90c-50d3747eda6c","year":1994},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.158270Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:7ebad0fd14a2d08a68e20a69f84bcedac594b4fedc8072ee275ebcff7ea202ab","observation_id":"2a1fb042-7d99-498a-a3a6-1714f0057f71","resolution":{"observed_at":"2026-08-05T13:13:00.016177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16563","last_updated":"2025-02-06T12:02:36Z","snapshot_observed_at":"2026-08-12T23:57:46.644111Z","submitted_at":"2024-05-26T13:19:32Z","title":"Higher-Order Transformer Derivative Estimates for Explicit Pathwise Learning Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16563","snapshot_observed_at":"2026-08-05T13:12:59.161173Z","title":"Higher-order transformer derivative estimates for explicit pathwise learning guarantees.arXiv preprint arXiv:2405.16563, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.161173Z"},"links":{"cited_paper":"/paper/2405.16563","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:593869e22c2470c57c1819e3a1bd9395928b35d88c73edec201b280895bce968","observation_id":"7c873cfe-aec8-48eb-9b9e-cbf4a8df8148","resolution":{"observed_at":"2026-08-05T13:12:59.161173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.4400","last_updated":"2014-03-04T05:15:42Z","snapshot_observed_at":"2026-08-12T20:56:45.556724Z","submitted_at":"2013-12-16T15:34:13Z","title":"Network In Network","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.4400","snapshot_observed_at":"2026-08-05T13:12:59.164642Z","title":"Network in network.arXiv preprint arXiv:1312.4400, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.164642Z"},"links":{"cited_paper":"/paper/1312.4400","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:1de91b9765bce0f46df5bcbc7180b7d00e481bd28c1e71d97070f379464cd78d","observation_id":"0088cf96-b902-4ff6-8e9a-75492ff46040","resolution":{"observed_at":"2026-08-05T13:12:59.164642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.994600Z","title":"Relating data compression and learnability, 1986","venue":null,"work_id":"f4d87097-da8c-47de-894c-bb2934fca0da","year":1986},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.167848Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:8674c21b31a84834e07142a1c2fc5ba049daa8420f15d5da1fba63cd7e84ac4c","observation_id":"6fc56a7f-4828-4f3a-8fa4-559ef720c079","resolution":{"observed_at":"2026-08-05T13:12:59.998305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.981951Z","title":"Citeseer, 1996","venue":null,"work_id":"8f1fd5fb-3ff5-4307-8f8e-9a1fb1cbf97a","year":1996},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.170895Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:a9d70101b53a2f1a714c8866aec45b03a32454b529f99eb62aa8b7de7c61d535","observation_id":"6c96bace-4dd9-488c-928e-9e0afc152a84","resolution":{"observed_at":"2026-08-05T13:12:59.986249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.969136Z","title":"Deep network approximation for smooth functions","venue":null,"work_id":"938083f3-0766-425d-b669-4ea60d5a0db3","year":2021},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.173947Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:79a08b38d1fcb298ea66345f083766616d17fba98f2d941b9c078c69fbf08019","observation_id":"1b38a275-b6d7-49ec-9627-47cddf6234f7","resolution":{"observed_at":"2026-08-05T13:12:59.973285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.957162Z","title":"Learning nonlinear operators via deeponet based on the universal approximation theorem of operators.Nature machineintelligence, 3(3):218–229, 2021","venue":null,"work_id":"961ecbd0-0cd5-4002-b5f3-888210433abb","year":2021},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.176907Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:e64e597f4b1da78750f8da60a74f0d4e68197b7cf83459109c7093caaa835f93","observation_id":"4b30f3b3-ad1a-481b-8dc4-d397bb0cf661","resolution":{"observed_at":"2026-08-05T13:12:59.961050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.945190Z","title":"Superpixel-based image segmentation using convex optimization","venue":null,"work_id":"7a4bbf12-fe1e-46c5-aa5b-52c1052604f0","year":2089},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.179779Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:1114bd130d0164bd9aa3dc64b1bf4d1d4c82462938371613d4282c26dde896bd","observation_id":"9ae10ef9-8649-4c51-8e1c-c38b68ee8561","resolution":{"observed_at":"2026-08-05T13:12:59.949037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.932495Z","title":"Memory capacity of two layer neural networks with smooth activations","venue":null,"work_id":"edb4d556-f094-4e76-b9d9-a37397a14eb1","year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.182714Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:8b45c50cfa3024867bdb9a29d654f0a9ae8e024608b3a407df9b36fbd1ae26e2","observation_id":"573f25b5-449c-48f0-85e9-b486fa14e952","resolution":{"observed_at":"2026-08-05T13:12:59.936535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.922573Z","title":"Concentration Inequalities and Model Selection","venue":null,"work_id":"ebe842ec-533f-44e1-8988-ee194d02d8fd","year":2007},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.185419Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:3766cc86f33507e3e9a1780f902c979e1ca5f3090efd25d5d62f7ba19c67df63","observation_id":"fba0bc47-90d7-4a48-af6a-fa2f433139cd","resolution":{"observed_at":"2026-08-05T13:12:59.925859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.188688Z","title":"The generalization error of random features regression: Precise asymptotics and the double descent curve.Communications on Pure and Applied Mathematics, 75(4):667–766, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.188688Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:f03c22db3ff37bbbf9207c1f7aa8c3b1fc84aacefbf2b5871670d56df473b9fa","observation_id":"48950d9c-bfd4-4772-bdf7-d9932b9f7a2d","resolution":{"observed_at":"2026-08-05T13:12:59.188688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.905752Z","title":"Understanding the dynamics of the frequency bias in neural networks, 2024","venue":null,"work_id":"dd6a4ccb-39a2-4477-a2a8-2de61f319d97","year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.192248Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:869a53a38d6fc9ba0bc1c19fff68b3b2ef7ff8e7613f54dcb5a9eb05ffe1faaa","observation_id":"78b784e5-f09c-4db3-8528-86710a652234","resolution":{"observed_at":"2026-08-05T13:12:59.909295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.894536Z","title":"Sample compression schemes for vc classes.Journal of the ACM (JACM), 63(3):1–10, 2016","venue":null,"work_id":"92b387da-b48f-4981-bf2e-2bb860834d1a","year":2016},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.194967Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:394afb1ef08a1580eaf5f7f0ae399176c1356683c46cb379bfc661f34a878fcb","observation_id":"cca3c2e9-b0a8-487c-aaf3-3d7161527c3c","resolution":{"observed_at":"2026-08-05T13:12:59.897932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.884227Z","title":"Simplicity bias in 1-hidden layer neural networks","venue":null,"work_id":"04c9c0c5-2b6f-4bbe-b225-f0c8a61a5071","year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.198185Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:19df8280b5a8ea8afb8e7f4a4cc623766b91b6133e5383273bd864b51c8c3156","observation_id":"522d6279-3232-45db-850f-b6709127a134","resolution":{"observed_at":"2026-08-05T13:12:59.888012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.873071Z","title":"Robust feature learning for multi-index models in high dimensions","venue":null,"work_id":"e3bd261f-c579-4b3f-9f4d-61dffa1f7069","year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.201179Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:3e057ba65f44604423fd5ae096e41bc6a83c934c0851eceadb426a99fc030143","observation_id":"b63d93bc-16b8-4ecc-a58c-d357512a98f2","resolution":{"observed_at":"2026-08-05T13:12:59.877108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.08410","last_updated":"2026-04-27T14:17:09Z","snapshot_observed_at":"2026-08-13T13:15:43.978530Z","submitted_at":"2023-12-13T11:27:15Z","title":"Universal approximation property of Banach space-valued random feature models including random neural networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.08410","snapshot_observed_at":"2026-08-05T13:12:59.203986Z","title":"Universal approximation property of random neural networks.arXiv preprint arXiv:2312.08410, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.203986Z"},"links":{"cited_paper":"/paper/2312.08410","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:878ecf0f402f9b36b145d4c52c15faa24d3c5734d36cc9ef0894f25383e0c741","observation_id":"ce33b782-8c76-4f5f-8bb2-30939a58d50e","resolution":{"observed_at":"2026-08-05T13:12:59.203986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.862032Z","title":"A PAC-bayesian approach to spectrally- normalized margin bounds for neural networks","venue":null,"work_id":"644e5135-4d0a-4816-a7d3-209ba25c16fd","year":2018},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.207348Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:3747902235981e0394b685b299a7f60be5c0bf8d0ce0aba3dc1c0ac814155712","observation_id":"b6619cc1-933b-4a46-8e0a-d1023c0888c3","resolution":{"observed_at":"2026-08-05T13:12:59.865692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.850529Z","title":"Fast samplers for inverse problems in iterative refinement models","venue":null,"work_id":"a8dfdbb2-3901-40b8-8361-9f291cbdaf45","year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.210527Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:7b818b4889f0652cd50a17590ce845b7bd15aa7d3bff7ba2a1bf65e1babcb450","observation_id":"b4726d83-07a3-448c-9c65-505922e8074b","resolution":{"observed_at":"2026-08-05T13:12:59.853931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.213464Z","title":"Optimal approximation of piecewise smooth functions using deep relu neural networks.Neural Networks, 108:296–330, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.213464Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:d3e8376abc5354dde381fd4f3f99d2c1be91f1a780ba49a9303b4bba066c0adb","observation_id":"a5df71a5-201a-4d21-8009-7a05bdc98ae3","resolution":{"observed_at":"2026-08-05T13:12:59.213464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.833019Z","title":"Mathematical theory of deep learning.arXiv preprint, 2024","venue":null,"work_id":"6061a5b6-283a-4b8f-94ee-d1adb1f703b1","year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.216416Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:d1030788d2d06a1cc6059f0d3aaf6583ada35be5b43471e831ae8b25555a9c11","observation_id":"fbea8ccc-c40d-4ad7-9ccd-e4c20acb5a28","resolution":{"observed_at":"2026-08-05T13:12:59.836506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.822435Z","title":"Lipschitz widths.ConstructiveApproximation, 57(2):759–805, 2023","venue":null,"work_id":"be3af59e-1720-46a9-9228-2bb721969d39","year":2023},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.219580Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:819cc36d58891fba3c540c5186667d78d3488e24f1a0651360c3d5feeae6f66e","observation_id":"06c9aeba-d301-4036-afda-7f04b227ce05","resolution":{"observed_at":"2026-08-05T13:12:59.825899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.812177Z","title":"n-widths in approximation theory, volume 7 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)]","venue":null,"work_id":"b46c86a1-72db-4bd3-bc57-cefea9d8dc25","year":1985},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.222956Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:d74d5f9fcff10b04d8ef2d04e64946d4c31d56ed866ba79a6f651e17b3c50b1a","observation_id":"4f1983e7-3f2a-4dcd-bb93-6f05752812b8","resolution":{"observed_at":"2026-08-05T13:12:59.815676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.802089Z","title":"I-theory on depth vs width: hierarchical function composition","venue":null,"work_id":"62c9f5b2-0694-4bd2-ad3c-037547615bb6","year":2015},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.226163Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:56f4e0ab652f1d153ef3403c1d4de8dc1da312198d5f00e0ee3f0c238978f641","observation_id":"57d04c48-57fa-495f-b466-108435c80b6f","resolution":{"observed_at":"2026-08-05T13:12:59.805870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.791987Z","title":"Compositional sparsity of learnable functions.Bulletin of the American Mathematical Society, 61(3):438–456, 2024","venue":null,"work_id":"82986584-471d-41f7-accf-203d95b971bd","year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.229724Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:0fd6af7579abb0471493867fd35a0b84eb34660d91e65a6580bff7a07eb07749","observation_id":"0a7aeb68-2b29-4e77-9bba-96edff00503b","resolution":{"observed_at":"2026-08-05T13:12:59.795377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.232612Z","title":"Random features for large-scale kernel machines","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.232612Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:7195fa078f5b84b25732aa6de162677bbf3ee7a1be29e642f06464b0123e8314","observation_id":"51cf89b3-2748-4482-89e1-b22c9807a7d2","resolution":{"observed_at":"2026-08-05T13:12:59.232612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.774873Z","title":"Learning a classification model for segmentation","venue":null,"work_id":"aca21bfc-91b5-4c00-95e0-26a009778edd","year":2003},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.235629Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:1a53a5e41a9b1a08b9a9d9e99ff60688529e6294864c48e3d5c33bb4f84affb8","observation_id":"3278677a-5582-4c3b-b1bf-31c44acc3a80","resolution":{"observed_at":"2026-08-05T13:12:59.778453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.05109","last_updated":"2026-06-19T12:24:49Z","snapshot_observed_at":"2026-08-11T20:47:54.145329Z","submitted_at":"2024-12-06T15:10:04Z","title":"Generating Rectifiable Measures through Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.05109","snapshot_observed_at":"2026-08-05T13:12:59.238677Z","title":"Generating rectifiable measures through neural networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.238677Z"},"links":{"cited_paper":"/paper/2412.05109","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:80107b9efdce3918bf20cfca9ef8c24b1e761b8757396e854e08b210a054748a","observation_id":"3ba7776b-be07-48b9-a56e-1d5d51613b9c","resolution":{"observed_at":"2026-08-05T13:12:59.238677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.764941Z","title":"Nonparametric regression via deep neural networks.The Annals of Statistics, 48(4):1875–1897, 2020","venue":null,"work_id":"edfd24d8-f892-4dd8-b290-49957bec5570","year":2020},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.242520Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:8d9719cad9e227aa590a1b3f302401dcd8b0b3e3e354c7d7713bb299dc06752a","observation_id":"9158be5c-d05b-4781-b4df-74ae4a796f10","resolution":{"observed_at":"2026-08-05T13:12:59.768606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04847","last_updated":"2025-04-07T09:00:22Z","snapshot_observed_at":"2026-08-07T16:08:03.724152Z","submitted_at":"2025-04-07T09:00:22Z","title":"Nonlocal techniques for the analysis of deep ReLU neural network approximations","version":1},"cited_work":{"arxiv_id":"2504.04847","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.04847","snapshot_observed_at":"2026-08-05T13:12:59.338659Z","title":"Nonlocal techniques for the analysis of deep ReLU neural network approximations","venue":"cs.LG","work_id":"b6a89d80-2676-4058-a08d-8c7fcf60fe7e","year":2025},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.245464Z"},"links":{"cited_paper":"/paper/2504.04847","citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:22a9daba20130538041892fda0533fe087ae11ea3db10883245beae51232a556","observation_id":"3644dd05-d54a-4f3b-acde-722ae91dac93","resolution":{"observed_at":"2026-08-05T13:12:59.343986Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.753961Z","title":"A multivariate Riesz basis of ReLU neural networks.Appl","venue":null,"work_id":"3b882386-7515-49d6-aeda-af86733c38db","year":2024},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.248700Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:069f7f37b94a227a80855ad7277c46abc00fa2db77ab683d79dfe22082202cd1","observation_id":"6c35d260-12c5-4c72-9dab-c835f7fb3ef3","resolution":{"observed_at":"2026-08-05T13:12:59.757792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:12:59.741619Z","title":"Pac-bayesian generalisation error bounds for gaussian process classification","venue":null,"work_id":"0b12fd31-2bad-4e02-8622-9651b21f080e","year":2002},"citing_paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-05T13:12:59.251659Z"},"links":{"citing_paper":"/paper/2509.00924"},"observation_digest":"sha256:ac7bf327f6aa94b7e6ab993e26cf61bf9bfe5350858f18ea4ea33a2f4cd379d0","observation_id":"73412c9b-aee9-453d-9656-283be00b3030","resolution":{"observed_at":"2026-08-05T13:12:59.744932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.00924","last_updated":"2025-08-31T16:20:27Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-12T20:49:31.107071Z","submitted_at":"2025-08-31T16:20:27Z","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":3,"verified_fuzzy":45},"total_outbound_references":118},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 100 of 118 outbound references and 1 inbound Pith citation observation for arXiv:2509.00924."}