{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G4MDBAWUKDLEXWD6TKAH4KV5TW","short_pith_number":"pith:G4MDBAWU","schema_version":"1.0","canonical_sha256":"37183082d450d64bd87e9a807e2abd9da206aa63229564b2a152b40a4111f125","source":{"kind":"arxiv","id":"2410.23440","version":3},"attestation_state":"computed","paper":{"title":"The Sample Complexity of Learning Lipschitz Operators with respect to Gaussian Measures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Ben Adcock, Gregor Maier, Michael Griebel","submitted_at":"2024-10-30T20:32:30Z","abstract_excerpt":"Operator learning, the approximation of mappings between infinite-dimensional function spaces using machine learning, has gained increasing research attention in recent years. Approximate operators, learned from data, can serve as efficient surrogate models for problems in computational science and engineering, complementing traditional methods. However, despite their empirical success, our understanding of the underlying mathematical theory is in large part still incomplete. In this paper, we study the approximation of Lipschitz operators with respect to Gaussian measures. We prove higher Gau"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2410.23440","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-30T20:32:30Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"2688fc830f00c0aaf61e0a0fdd6490f4f05a489109dfa6f81e1e21d12bbe7cf9","abstract_canon_sha256":"6b7f9a739ffa937e9bdee7d97fae03dd731a0701f46a55761cbffb65da080cf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:21.296812Z","signature_b64":"AHedVFIoRsQCeIsBCyC3NmVZ6UBP//gkcSVbLRaD3twcjdwipMqDrnGRMpVNFWUnXc4TnjSzgMBPK7fn+5MeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37183082d450d64bd87e9a807e2abd9da206aa63229564b2a152b40a4111f125","last_reissued_at":"2026-07-05T11:27:21.296378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:21.296378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Sample Complexity of Learning Lipschitz Operators with respect to Gaussian Measures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Ben Adcock, Gregor Maier, Michael Griebel","submitted_at":"2024-10-30T20:32:30Z","abstract_excerpt":"Operator learning, the approximation of mappings between infinite-dimensional function spaces using machine learning, has gained increasing research attention in recent years. Approximate operators, learned from data, can serve as efficient surrogate models for problems in computational science and engineering, complementing traditional methods. However, despite their empirical success, our understanding of the underlying mathematical theory is in large part still incomplete. In this paper, we study the approximation of Lipschitz operators with respect to Gaussian measures. We prove higher Gau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23440","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.23440/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.23440","created_at":"2026-07-05T11:27:21.296435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23440v3","created_at":"2026-07-05T11:27:21.296435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23440","created_at":"2026-07-05T11:27:21.296435+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4MDBAWUKDLE","created_at":"2026-07-05T11:27:21.296435+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4MDBAWUKDLEXWD6","created_at":"2026-07-05T11:27:21.296435+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4MDBAWU","created_at":"2026-07-05T11:27:21.296435+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00320","citing_title":"From Spectral Methods to Sample Complexity Bounds for Fourier Neural Operators","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01335","citing_title":"Transpose-free linear algebra","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01244","citing_title":"Efficient Approximation for Encoder--Decoder Neural Operators via Variation Spaces","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00937","citing_title":"Cellular Sheaf Neural Operators for Structure-Preserving Surrogate Modeling of Constrained PDEs","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2603.09742","citing_title":"Upper Generalization Bounds for Neural Oscillators","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07660","citing_title":"Universal, sample-optimal algorithms for recovery of anisotropic functions from i.i.d. samples","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4MDBAWUKDLEXWD6TKAH4KV5TW","json":"https://pith.science/pith/G4MDBAWUKDLEXWD6TKAH4KV5TW.json","graph_json":"https://pith.science/api/pith-number/G4MDBAWUKDLEXWD6TKAH4KV5TW/graph.json","events_json":"https://pith.science/api/pith-number/G4MDBAWUKDLEXWD6TKAH4KV5TW/events.json","paper":"https://pith.science/paper/G4MDBAWU"},"agent_actions":{"view_html":"https://pith.science/pith/G4MDBAWUKDLEXWD6TKAH4KV5TW","download_json":"https://pith.science/pith/G4MDBAWUKDLEXWD6TKAH4KV5TW.json","view_paper":"https://pith.science/paper/G4MDBAWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23440&json=true","fetch_graph":"https://pith.science/api/pith-number/G4MDBAWUKDLEXWD6TKAH4KV5TW/graph.json","fetch_events":"https://pith.science/api/pith-number/G4MDBAWUKDLEXWD6TKAH4KV5TW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4MDBAWUKDLEXWD6TKAH4KV5TW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4MDBAWUKDLEXWD6TKAH4KV5TW/action/storage_attestation","attest_author":"https://pith.science/pith/G4MDBAWUKDLEXWD6TKAH4KV5TW/action/author_attestation","sign_citation":"https://pith.science/pith/G4MDBAWUKDLEXWD6TKAH4KV5TW/action/citation_signature","submit_replication":"https://pith.science/pith/G4MDBAWUKDLEXWD6TKAH4KV5TW/action/replication_record"}},"created_at":"2026-07-05T11:27:21.296435+00:00","updated_at":"2026-07-05T11:27:21.296435+00:00"}