{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5I72H3INAO6XFH43V2LDHYISZE","short_pith_number":"pith:5I72H3IN","schema_version":"1.0","canonical_sha256":"ea3fa3ed0d03bd729f9bae9633e112c9211487c5f40eef8ceafcf1b3950d9478","source":{"kind":"arxiv","id":"2408.17109","version":2},"attestation_state":"computed","paper":{"title":"Sensitivity of causal distributionally robust optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Jan Obloj, Yifan Jiang","submitted_at":"2024-08-30T08:50:39Z","abstract_excerpt":"We study the causal distributionally robust optimization (DRO) in both discrete- and continuous- time settings. The framework captures model uncertainty, with potential models penalized in function of their adapted Wasserstein distance to a given reference model. Strength of the penalty is controlled using a real-valued parameter which, in the special case of an indicator penalty, is simply the radius of the uncertainty ball. Our main results derive the first-order sensitivity of the value of causal DRO with respect to the penalization parameter, i.e., we compute the sensitivity to model uncer"},"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":"2408.17109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-08-30T08:50:39Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4beaa0a921a8028bc35e4392dde3e05ee0e34e03f31c4a3c38b7aa3e888164d2","abstract_canon_sha256":"52cb6d2f53bfa5cb71a4a513e74ab4c2b32a949203466040eac7197fdf99ace5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:47.207882Z","signature_b64":"i7Bj9pxuOkTUEk+FDcBxV6cEYM3zgJNNhpcWVNFHFgBnJfT+ce4ngcnbOjEa9VJoB9RS/P/L48Ngdd376vqsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea3fa3ed0d03bd729f9bae9633e112c9211487c5f40eef8ceafcf1b3950d9478","last_reissued_at":"2026-07-05T11:10:47.207344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:47.207344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sensitivity of causal distributionally robust optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Jan Obloj, Yifan Jiang","submitted_at":"2024-08-30T08:50:39Z","abstract_excerpt":"We study the causal distributionally robust optimization (DRO) in both discrete- and continuous- time settings. The framework captures model uncertainty, with potential models penalized in function of their adapted Wasserstein distance to a given reference model. Strength of the penalty is controlled using a real-valued parameter which, in the special case of an indicator penalty, is simply the radius of the uncertainty ball. Our main results derive the first-order sensitivity of the value of causal DRO with respect to the penalization parameter, i.e., we compute the sensitivity to model uncer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.17109","kind":"arxiv","version":2},"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/2408.17109/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":"2408.17109","created_at":"2026-07-05T11:10:47.207411+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.17109v2","created_at":"2026-07-05T11:10:47.207411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.17109","created_at":"2026-07-05T11:10:47.207411+00:00"},{"alias_kind":"pith_short_12","alias_value":"5I72H3INAO6X","created_at":"2026-07-05T11:10:47.207411+00:00"},{"alias_kind":"pith_short_16","alias_value":"5I72H3INAO6XFH43","created_at":"2026-07-05T11:10:47.207411+00:00"},{"alias_kind":"pith_short_8","alias_value":"5I72H3IN","created_at":"2026-07-05T11:10:47.207411+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30560","citing_title":"Projected McKean--Vlasov Dynamics for Entropic Weak Optimal Transport","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2403.09532","citing_title":"Robust SGLD algorithm for solving non-convex distributionally robust optimisation problems","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19978","citing_title":"Analytical Approach to Continuous-Time Causal Optimal Transport","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5I72H3INAO6XFH43V2LDHYISZE","json":"https://pith.science/pith/5I72H3INAO6XFH43V2LDHYISZE.json","graph_json":"https://pith.science/api/pith-number/5I72H3INAO6XFH43V2LDHYISZE/graph.json","events_json":"https://pith.science/api/pith-number/5I72H3INAO6XFH43V2LDHYISZE/events.json","paper":"https://pith.science/paper/5I72H3IN"},"agent_actions":{"view_html":"https://pith.science/pith/5I72H3INAO6XFH43V2LDHYISZE","download_json":"https://pith.science/pith/5I72H3INAO6XFH43V2LDHYISZE.json","view_paper":"https://pith.science/paper/5I72H3IN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.17109&json=true","fetch_graph":"https://pith.science/api/pith-number/5I72H3INAO6XFH43V2LDHYISZE/graph.json","fetch_events":"https://pith.science/api/pith-number/5I72H3INAO6XFH43V2LDHYISZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5I72H3INAO6XFH43V2LDHYISZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5I72H3INAO6XFH43V2LDHYISZE/action/storage_attestation","attest_author":"https://pith.science/pith/5I72H3INAO6XFH43V2LDHYISZE/action/author_attestation","sign_citation":"https://pith.science/pith/5I72H3INAO6XFH43V2LDHYISZE/action/citation_signature","submit_replication":"https://pith.science/pith/5I72H3INAO6XFH43V2LDHYISZE/action/replication_record"}},"created_at":"2026-07-05T11:10:47.207411+00:00","updated_at":"2026-07-05T11:10:47.207411+00:00"}