{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DV5JSGR2ICEKKBTT56VHDLIKNC","short_pith_number":"pith:DV5JSGR2","schema_version":"1.0","canonical_sha256":"1d7a991a3a4088a50673efaa71ad0a689a781c1171ca23a6c4f770c0666af422","source":{"kind":"arxiv","id":"2605.22724","version":1},"attestation_state":"computed","paper":{"title":"Multiple Neural Operators Achieve Near-Optimal Rates for Multi-Task Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrien Weihs, Hayden Schaeffer","submitted_at":"2026-05-21T16:57:33Z","abstract_excerpt":"We study the approximation and statistical complexity of learning collections of operators in a shared multi-task setting, with a focus on the Multiple Neural Operators (MNO) architecture. For broad classes of Lipschitz multiple operator maps, we derive near-optimal upper bounds for approximation and statistical generalization. On the lower-bound side, we establish a curse of parametric complexity and prove corresponding minimax rates. Together, these results show that shared representations across tasks do not increase the overall cost: multi-task operator learning follows the same scaling la"},"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":"2605.22724","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-21T16:57:33Z","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"title_canon_sha256":"7767bcc5476d19e0e2c273db73eab76b47c7b0c58ab2e0ef39e137506400b7a3","abstract_canon_sha256":"79eef1d802f2b15f93cc656d5a06a4d350e9a5dd37bda1bdfbc7c94292c2d946"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:52.044010Z","signature_b64":"av8ddQoTVzLJHKIyqkLP7EokmwxkLu0ft+gr4kh/p18Sy5vcfe830gYW4krdnAWY6AVT1968O/wfp9f/xdZoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d7a991a3a4088a50673efaa71ad0a689a781c1171ca23a6c4f770c0666af422","last_reissued_at":"2026-05-22T02:04:52.043411Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:52.043411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple Neural Operators Achieve Near-Optimal Rates for Multi-Task Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrien Weihs, Hayden Schaeffer","submitted_at":"2026-05-21T16:57:33Z","abstract_excerpt":"We study the approximation and statistical complexity of learning collections of operators in a shared multi-task setting, with a focus on the Multiple Neural Operators (MNO) architecture. For broad classes of Lipschitz multiple operator maps, we derive near-optimal upper bounds for approximation and statistical generalization. On the lower-bound side, we establish a curse of parametric complexity and prove corresponding minimax rates. Together, these results show that shared representations across tasks do not increase the overall cost: multi-task operator learning follows the same scaling la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22724","kind":"arxiv","version":1},"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/2605.22724/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":"2605.22724","created_at":"2026-05-22T02:04:52.043515+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22724v1","created_at":"2026-05-22T02:04:52.043515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22724","created_at":"2026-05-22T02:04:52.043515+00:00"},{"alias_kind":"pith_short_12","alias_value":"DV5JSGR2ICEK","created_at":"2026-05-22T02:04:52.043515+00:00"},{"alias_kind":"pith_short_16","alias_value":"DV5JSGR2ICEKKBTT","created_at":"2026-05-22T02:04:52.043515+00:00"},{"alias_kind":"pith_short_8","alias_value":"DV5JSGR2","created_at":"2026-05-22T02:04:52.043515+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DV5JSGR2ICEKKBTT56VHDLIKNC","json":"https://pith.science/pith/DV5JSGR2ICEKKBTT56VHDLIKNC.json","graph_json":"https://pith.science/api/pith-number/DV5JSGR2ICEKKBTT56VHDLIKNC/graph.json","events_json":"https://pith.science/api/pith-number/DV5JSGR2ICEKKBTT56VHDLIKNC/events.json","paper":"https://pith.science/paper/DV5JSGR2"},"agent_actions":{"view_html":"https://pith.science/pith/DV5JSGR2ICEKKBTT56VHDLIKNC","download_json":"https://pith.science/pith/DV5JSGR2ICEKKBTT56VHDLIKNC.json","view_paper":"https://pith.science/paper/DV5JSGR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22724&json=true","fetch_graph":"https://pith.science/api/pith-number/DV5JSGR2ICEKKBTT56VHDLIKNC/graph.json","fetch_events":"https://pith.science/api/pith-number/DV5JSGR2ICEKKBTT56VHDLIKNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DV5JSGR2ICEKKBTT56VHDLIKNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DV5JSGR2ICEKKBTT56VHDLIKNC/action/storage_attestation","attest_author":"https://pith.science/pith/DV5JSGR2ICEKKBTT56VHDLIKNC/action/author_attestation","sign_citation":"https://pith.science/pith/DV5JSGR2ICEKKBTT56VHDLIKNC/action/citation_signature","submit_replication":"https://pith.science/pith/DV5JSGR2ICEKKBTT56VHDLIKNC/action/replication_record"}},"created_at":"2026-05-22T02:04:52.043515+00:00","updated_at":"2026-05-22T02:04:52.043515+00:00"}