{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U2C7ADBDAEULL42OJXHQA5LPK6","short_pith_number":"pith:U2C7ADBD","schema_version":"1.0","canonical_sha256":"a685f00c230128b5f34e4dcf00756f578e234ef112336b1df2e627925cc31c93","source":{"kind":"arxiv","id":"2210.13300","version":3},"attestation_state":"computed","paper":{"title":"Designing Universal Causal Deep Learning Models: The Case of Infinite-Dimensional Dynamical Systems from Stochastic Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-fin.CP"],"primary_cat":"math.DS","authors_text":"Anastasis Kratsios, Giulia Livieri, Luca Galimberti","submitted_at":"2022-10-24T14:43:03Z","abstract_excerpt":"Several non-linear operators in stochastic analysis, such as solution maps to stochastic differential equations, depend on a temporal structure which is not leveraged by contemporary neural operators designed to approximate general maps between Banach space. This paper therefore proposes an operator learning solution to this open problem by introducing a deep learning model-design framework that takes suitable infinite-dimensional linear metric spaces, e.g. Banach spaces, as inputs and returns a universal \\textit{sequential} deep learning model adapted to these linear geometries specialized fo"},"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":"2210.13300","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2022-10-24T14:43:03Z","cross_cats_sorted":["cs.LG","q-fin.CP"],"title_canon_sha256":"fcc8db2e26679360759d5f4e7f51c7c5625d286c7f7dc02d17b9df0ca7078c4e","abstract_canon_sha256":"9720879886d50ae0985ca5b643f94c610ba613a9556d851f9f241ecda6543d34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:51.960502Z","signature_b64":"NfG9JQcm8ZFJCHUrVDWHtKytVcAR4zJQ9VMt2dncIzDTL4eGI6SsYOw9FbfaXypKIS65Rp6fHMyjyFeDOTGEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a685f00c230128b5f34e4dcf00756f578e234ef112336b1df2e627925cc31c93","last_reissued_at":"2026-07-05T10:46:51.959982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:51.959982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing Universal Causal Deep Learning Models: The Case of Infinite-Dimensional Dynamical Systems from Stochastic Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-fin.CP"],"primary_cat":"math.DS","authors_text":"Anastasis Kratsios, Giulia Livieri, Luca Galimberti","submitted_at":"2022-10-24T14:43:03Z","abstract_excerpt":"Several non-linear operators in stochastic analysis, such as solution maps to stochastic differential equations, depend on a temporal structure which is not leveraged by contemporary neural operators designed to approximate general maps between Banach space. This paper therefore proposes an operator learning solution to this open problem by introducing a deep learning model-design framework that takes suitable infinite-dimensional linear metric spaces, e.g. Banach spaces, as inputs and returns a universal \\textit{sequential} deep learning model adapted to these linear geometries specialized fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.13300","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/2210.13300/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":"2210.13300","created_at":"2026-07-05T10:46:51.960048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.13300v3","created_at":"2026-07-05T10:46:51.960048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.13300","created_at":"2026-07-05T10:46:51.960048+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2C7ADBDAEUL","created_at":"2026-07-05T10:46:51.960048+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2C7ADBDAEULL42O","created_at":"2026-07-05T10:46:51.960048+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2C7ADBD","created_at":"2026-07-05T10:46:51.960048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.05576","citing_title":"Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces","ref_index":71,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U2C7ADBDAEULL42OJXHQA5LPK6","json":"https://pith.science/pith/U2C7ADBDAEULL42OJXHQA5LPK6.json","graph_json":"https://pith.science/api/pith-number/U2C7ADBDAEULL42OJXHQA5LPK6/graph.json","events_json":"https://pith.science/api/pith-number/U2C7ADBDAEULL42OJXHQA5LPK6/events.json","paper":"https://pith.science/paper/U2C7ADBD"},"agent_actions":{"view_html":"https://pith.science/pith/U2C7ADBDAEULL42OJXHQA5LPK6","download_json":"https://pith.science/pith/U2C7ADBDAEULL42OJXHQA5LPK6.json","view_paper":"https://pith.science/paper/U2C7ADBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.13300&json=true","fetch_graph":"https://pith.science/api/pith-number/U2C7ADBDAEULL42OJXHQA5LPK6/graph.json","fetch_events":"https://pith.science/api/pith-number/U2C7ADBDAEULL42OJXHQA5LPK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2C7ADBDAEULL42OJXHQA5LPK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2C7ADBDAEULL42OJXHQA5LPK6/action/storage_attestation","attest_author":"https://pith.science/pith/U2C7ADBDAEULL42OJXHQA5LPK6/action/author_attestation","sign_citation":"https://pith.science/pith/U2C7ADBDAEULL42OJXHQA5LPK6/action/citation_signature","submit_replication":"https://pith.science/pith/U2C7ADBDAEULL42OJXHQA5LPK6/action/replication_record"}},"created_at":"2026-07-05T10:46:51.960048+00:00","updated_at":"2026-07-05T10:46:51.960048+00:00"}