{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6TKN3KN6HRT2OQEIRJT2RUHVEY","short_pith_number":"pith:6TKN3KN6","schema_version":"1.0","canonical_sha256":"f4d4dda9be3c67a740888a67a8d0f5262c75a3f1ad7a77a8b1f9f6ed6ab9dd1b","source":{"kind":"arxiv","id":"2508.14995","version":1},"attestation_state":"computed","paper":{"title":"Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC","q-fin.CP"],"primary_cat":"cs.LG","authors_text":"Anastasis Kratsios, Ariel Neufeld, Philipp Schmocker","submitted_at":"2025-08-20T18:32:36Z","abstract_excerpt":"Neural operators (NOs) are a class of deep learning models designed to simultaneously solve infinitely many related problems by casting them into an infinite-dimensional space, whereon these NOs operate. A significant gap remains between theory and practice: worst-case parameter bounds from universal approximation theorems suggest that NOs may require an unrealistically large number of parameters to solve most operator learning problems, which stands in direct opposition to a slew of experimental evidence. This paper closes that gap for a specific class of {NOs}, generative {equilibrium operat"},"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":"2508.14995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-20T18:32:36Z","cross_cats_sorted":["cs.NA","math.NA","math.OC","q-fin.CP"],"title_canon_sha256":"b9c5f1f9ff8448efd505a9364b8702224692bfde84b99bb4b211fcabf94907f7","abstract_canon_sha256":"e087db1c43956fb4573bd2a3689a0f102fa96480d6e162f4f13c57769111e78a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:04.717511Z","signature_b64":"+/L/d8oj6ncZFax3+Gqh7rNnmWNdlPWC4dCBYBHjBKahQksBCeMLJmu8r0mLKJYrWBoFouFK/P62DJ7L4Rr7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4d4dda9be3c67a740888a67a8d0f5262c75a3f1ad7a77a8b1f9f6ed6ab9dd1b","last_reissued_at":"2026-07-05T11:57:04.717073Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:04.717073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC","q-fin.CP"],"primary_cat":"cs.LG","authors_text":"Anastasis Kratsios, Ariel Neufeld, Philipp Schmocker","submitted_at":"2025-08-20T18:32:36Z","abstract_excerpt":"Neural operators (NOs) are a class of deep learning models designed to simultaneously solve infinitely many related problems by casting them into an infinite-dimensional space, whereon these NOs operate. A significant gap remains between theory and practice: worst-case parameter bounds from universal approximation theorems suggest that NOs may require an unrealistically large number of parameters to solve most operator learning problems, which stands in direct opposition to a slew of experimental evidence. This paper closes that gap for a specific class of {NOs}, generative {equilibrium operat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14995","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/2508.14995/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":"2508.14995","created_at":"2026-07-05T11:57:04.717134+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14995v1","created_at":"2026-07-05T11:57:04.717134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14995","created_at":"2026-07-05T11:57:04.717134+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TKN3KN6HRT2","created_at":"2026-07-05T11:57:04.717134+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TKN3KN6HRT2OQEI","created_at":"2026-07-05T11:57:04.717134+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TKN3KN6","created_at":"2026-07-05T11:57:04.717134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09820","citing_title":"Weighted universal approximation of differentiable maps on infinite-dimensional manifolds","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09820","citing_title":"Weighted universal approximation of differentiable maps on infinite-dimensional manifolds","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04995","citing_title":"Adaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TKN3KN6HRT2OQEIRJT2RUHVEY","json":"https://pith.science/pith/6TKN3KN6HRT2OQEIRJT2RUHVEY.json","graph_json":"https://pith.science/api/pith-number/6TKN3KN6HRT2OQEIRJT2RUHVEY/graph.json","events_json":"https://pith.science/api/pith-number/6TKN3KN6HRT2OQEIRJT2RUHVEY/events.json","paper":"https://pith.science/paper/6TKN3KN6"},"agent_actions":{"view_html":"https://pith.science/pith/6TKN3KN6HRT2OQEIRJT2RUHVEY","download_json":"https://pith.science/pith/6TKN3KN6HRT2OQEIRJT2RUHVEY.json","view_paper":"https://pith.science/paper/6TKN3KN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14995&json=true","fetch_graph":"https://pith.science/api/pith-number/6TKN3KN6HRT2OQEIRJT2RUHVEY/graph.json","fetch_events":"https://pith.science/api/pith-number/6TKN3KN6HRT2OQEIRJT2RUHVEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TKN3KN6HRT2OQEIRJT2RUHVEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TKN3KN6HRT2OQEIRJT2RUHVEY/action/storage_attestation","attest_author":"https://pith.science/pith/6TKN3KN6HRT2OQEIRJT2RUHVEY/action/author_attestation","sign_citation":"https://pith.science/pith/6TKN3KN6HRT2OQEIRJT2RUHVEY/action/citation_signature","submit_replication":"https://pith.science/pith/6TKN3KN6HRT2OQEIRJT2RUHVEY/action/replication_record"}},"created_at":"2026-07-05T11:57:04.717134+00:00","updated_at":"2026-07-05T11:57:04.717134+00:00"}