{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ORN4I7KKEXTO4QW3SGQBPHSG2L","short_pith_number":"pith:ORN4I7KK","schema_version":"1.0","canonical_sha256":"745bc47d4a25e6ee42db91a0179e46d2eff5ec385dae9507a7161e9e5d0d6e2c","source":{"kind":"arxiv","id":"2312.05973","version":1},"attestation_state":"computed","paper":{"title":"Risk measures based on weak optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.RM"],"primary_cat":"q-fin.MF","authors_text":"Alessandro Sgarabottolo, Max Nendel, Michael Kupper","submitted_at":"2023-12-10T19:18:42Z","abstract_excerpt":"In this paper, we study convex risk measures with weak optimal transport penalties. In a first step, we show that these risk measures allow for an explicit representation via a nonlinear transform of the loss function. In a second step, we discuss computational aspects related to the nonlinear transform as well as approximations of the risk measures using, for example, neural networks. Our setup comprises a variety of examples, such as classical optimal transport penalties, parametric families of models, uncertainty on path spaces, moment constrains, and martingale constraints. In a last step,"},"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":"2312.05973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.MF","submitted_at":"2023-12-10T19:18:42Z","cross_cats_sorted":["q-fin.RM"],"title_canon_sha256":"66b860b5619513bc28f0bc5db4bd58271c773bbb7cb9f189abb57a54471a5f20","abstract_canon_sha256":"357456b9bd48f5902c695f1f40694b66fb361befb1a0835ceb4d9077e3721bcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:22:35.902959Z","signature_b64":"6i60HRZJnyW5u1yBHa/LhqsAKNN/n2Ke+Znao8oF99JVJupIL6Wd8Pe/RT9drVnVKyuSvCIIZTGa2SDArWx8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"745bc47d4a25e6ee42db91a0179e46d2eff5ec385dae9507a7161e9e5d0d6e2c","last_reissued_at":"2026-07-05T07:22:35.902560Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:22:35.902560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Risk measures based on weak optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.RM"],"primary_cat":"q-fin.MF","authors_text":"Alessandro Sgarabottolo, Max Nendel, Michael Kupper","submitted_at":"2023-12-10T19:18:42Z","abstract_excerpt":"In this paper, we study convex risk measures with weak optimal transport penalties. In a first step, we show that these risk measures allow for an explicit representation via a nonlinear transform of the loss function. In a second step, we discuss computational aspects related to the nonlinear transform as well as approximations of the risk measures using, for example, neural networks. Our setup comprises a variety of examples, such as classical optimal transport penalties, parametric families of models, uncertainty on path spaces, moment constrains, and martingale constraints. In a last step,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05973","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/2312.05973/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":"2312.05973","created_at":"2026-07-05T07:22:35.902619+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.05973v1","created_at":"2026-07-05T07:22:35.902619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05973","created_at":"2026-07-05T07:22:35.902619+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORN4I7KKEXTO","created_at":"2026-07-05T07:22:35.902619+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORN4I7KKEXTO4QW3","created_at":"2026-07-05T07:22:35.902619+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORN4I7KK","created_at":"2026-07-05T07:22:35.902619+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2403.09532","citing_title":"Robust SGLD algorithm for solving non-convex distributionally robust optimisation problems","ref_index":72,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ORN4I7KKEXTO4QW3SGQBPHSG2L","json":"https://pith.science/pith/ORN4I7KKEXTO4QW3SGQBPHSG2L.json","graph_json":"https://pith.science/api/pith-number/ORN4I7KKEXTO4QW3SGQBPHSG2L/graph.json","events_json":"https://pith.science/api/pith-number/ORN4I7KKEXTO4QW3SGQBPHSG2L/events.json","paper":"https://pith.science/paper/ORN4I7KK"},"agent_actions":{"view_html":"https://pith.science/pith/ORN4I7KKEXTO4QW3SGQBPHSG2L","download_json":"https://pith.science/pith/ORN4I7KKEXTO4QW3SGQBPHSG2L.json","view_paper":"https://pith.science/paper/ORN4I7KK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.05973&json=true","fetch_graph":"https://pith.science/api/pith-number/ORN4I7KKEXTO4QW3SGQBPHSG2L/graph.json","fetch_events":"https://pith.science/api/pith-number/ORN4I7KKEXTO4QW3SGQBPHSG2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORN4I7KKEXTO4QW3SGQBPHSG2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORN4I7KKEXTO4QW3SGQBPHSG2L/action/storage_attestation","attest_author":"https://pith.science/pith/ORN4I7KKEXTO4QW3SGQBPHSG2L/action/author_attestation","sign_citation":"https://pith.science/pith/ORN4I7KKEXTO4QW3SGQBPHSG2L/action/citation_signature","submit_replication":"https://pith.science/pith/ORN4I7KKEXTO4QW3SGQBPHSG2L/action/replication_record"}},"created_at":"2026-07-05T07:22:35.902619+00:00","updated_at":"2026-07-05T07:22:35.902619+00:00"}