{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XMLBP4UHOI5O5YQZXSNHMWW56D","short_pith_number":"pith:XMLBP4UH","canonical_record":{"source":{"id":"2607.11460","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T12:09:01Z","cross_cats_sorted":[],"title_canon_sha256":"92f8c6d62bf6a8df609666b91e91cfa415b73992b890f7d97c41027d637df5b2","abstract_canon_sha256":"41e2741898cd0854a48d9b8cc7edf34ab7fef4df92cee54c5dd81b92c6865e3a"},"schema_version":"1.0"},"canonical_sha256":"bb1617f287723aeee219bc9a765addf0ec0056f71a257c4111e1f55d61c6053e","source":{"kind":"arxiv","id":"2607.11460","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11460","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11460v1","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11460","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"XMLBP4UHOI5O","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"pith_short_16","alias_value":"XMLBP4UHOI5O5YQZ","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"pith_short_8","alias_value":"XMLBP4UH","created_at":"2026-07-14T02:22:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XMLBP4UHOI5O5YQZXSNHMWW56D","target":"record","payload":{"canonical_record":{"source":{"id":"2607.11460","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T12:09:01Z","cross_cats_sorted":[],"title_canon_sha256":"92f8c6d62bf6a8df609666b91e91cfa415b73992b890f7d97c41027d637df5b2","abstract_canon_sha256":"41e2741898cd0854a48d9b8cc7edf34ab7fef4df92cee54c5dd81b92c6865e3a"},"schema_version":"1.0"},"canonical_sha256":"bb1617f287723aeee219bc9a765addf0ec0056f71a257c4111e1f55d61c6053e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T02:22:04.324486Z","signature_b64":"V8hx+kErCo4obpKPZllko8cJU0PfXeVM5bcWHgedHuZCo4Sihpvmop53ROIVAwtxuz86/vZL/kfqFKV3MS++AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb1617f287723aeee219bc9a765addf0ec0056f71a257c4111e1f55d61c6053e","last_reissued_at":"2026-07-14T02:22:04.323636Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T02:22:04.323636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.11460","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T02:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bS7F8oitaar5hiAGXShTDj5nXx1TgH3jm8b5IsVER1GW5ubW0ShydK/CWnSzOlQwJPmJdD2odZr/cDR8BzDsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:44:21.019895Z"},"content_sha256":"dfed0b866b396637b3ff2c76d24962d7cf8572112089bb60df4a51e2d8b7c2e8","schema_version":"1.0","event_id":"sha256:dfed0b866b396637b3ff2c76d24962d7cf8572112089bb60df4a51e2d8b7c2e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XMLBP4UHOI5O5YQZXSNHMWW56D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Order Methods for Distributionally Robust Constrained Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hubert Villuendas, J\\'er\\^ome Malick, Mathieu Besan\\c{c}on","submitted_at":"2026-07-13T12:09:01Z","abstract_excerpt":"We consider constrained optimization problems in which input data are affected by estimation errors. In such settings, Wasserstein distributionally robust optimization provides a principled framework to mitigate model risk by optimizing against worst-case distributions within Wasserstein ambiguity sets. However, the numerical resolution of the resulting problems remains challenging, especially in constrained and combinatorial settings. In this paper, we propose a tractable stochastic approach based on two key ingredients: (i) an entropic regularization of the distributionally robust value func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11460","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/2607.11460/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T02:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBA+t4eW2iAchmhzR5DYzxVC8q4Ed+CJ1onxc4UCofGH5ZHUZVcuIGIZ8kkU5IS8zYUgD8u8cihsrJqP0SloAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:44:21.020751Z"},"content_sha256":"0e6824a5c165d4209cb30b01725c05868347948a44706f5fbcbbae12841ab509","schema_version":"1.0","event_id":"sha256:0e6824a5c165d4209cb30b01725c05868347948a44706f5fbcbbae12841ab509"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMLBP4UHOI5O5YQZXSNHMWW56D/bundle.json","state_url":"https://pith.science/pith/XMLBP4UHOI5O5YQZXSNHMWW56D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMLBP4UHOI5O5YQZXSNHMWW56D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T22:44:21Z","links":{"resolver":"https://pith.science/pith/XMLBP4UHOI5O5YQZXSNHMWW56D","bundle":"https://pith.science/pith/XMLBP4UHOI5O5YQZXSNHMWW56D/bundle.json","state":"https://pith.science/pith/XMLBP4UHOI5O5YQZXSNHMWW56D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMLBP4UHOI5O5YQZXSNHMWW56D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XMLBP4UHOI5O5YQZXSNHMWW56D","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"41e2741898cd0854a48d9b8cc7edf34ab7fef4df92cee54c5dd81b92c6865e3a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T12:09:01Z","title_canon_sha256":"92f8c6d62bf6a8df609666b91e91cfa415b73992b890f7d97c41027d637df5b2"},"schema_version":"1.0","source":{"id":"2607.11460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11460","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11460v1","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11460","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"XMLBP4UHOI5O","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"pith_short_16","alias_value":"XMLBP4UHOI5O5YQZ","created_at":"2026-07-14T02:22:04Z"},{"alias_kind":"pith_short_8","alias_value":"XMLBP4UH","created_at":"2026-07-14T02:22:04Z"}],"graph_snapshots":[{"event_id":"sha256:0e6824a5c165d4209cb30b01725c05868347948a44706f5fbcbbae12841ab509","target":"graph","created_at":"2026-07-14T02:22:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.11460/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider constrained optimization problems in which input data are affected by estimation errors. In such settings, Wasserstein distributionally robust optimization provides a principled framework to mitigate model risk by optimizing against worst-case distributions within Wasserstein ambiguity sets. However, the numerical resolution of the resulting problems remains challenging, especially in constrained and combinatorial settings. In this paper, we propose a tractable stochastic approach based on two key ingredients: (i) an entropic regularization of the distributionally robust value func","authors_text":"Hubert Villuendas, J\\'er\\^ome Malick, Mathieu Besan\\c{c}on","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T12:09:01Z","title":"First-Order Methods for Distributionally Robust Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11460","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dfed0b866b396637b3ff2c76d24962d7cf8572112089bb60df4a51e2d8b7c2e8","target":"record","created_at":"2026-07-14T02:22:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"41e2741898cd0854a48d9b8cc7edf34ab7fef4df92cee54c5dd81b92c6865e3a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T12:09:01Z","title_canon_sha256":"92f8c6d62bf6a8df609666b91e91cfa415b73992b890f7d97c41027d637df5b2"},"schema_version":"1.0","source":{"id":"2607.11460","kind":"arxiv","version":1}},"canonical_sha256":"bb1617f287723aeee219bc9a765addf0ec0056f71a257c4111e1f55d61c6053e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb1617f287723aeee219bc9a765addf0ec0056f71a257c4111e1f55d61c6053e","first_computed_at":"2026-07-14T02:22:04.323636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T02:22:04.323636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V8hx+kErCo4obpKPZllko8cJU0PfXeVM5bcWHgedHuZCo4Sihpvmop53ROIVAwtxuz86/vZL/kfqFKV3MS++AA==","signature_status":"signed_v1","signed_at":"2026-07-14T02:22:04.324486Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.11460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfed0b866b396637b3ff2c76d24962d7cf8572112089bb60df4a51e2d8b7c2e8","sha256:0e6824a5c165d4209cb30b01725c05868347948a44706f5fbcbbae12841ab509"],"state_sha256":"321ed887c5f04ac31a98e0df1bd02beb0f0009147084079ba7e9330e895b46a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7sOjWS8D4Bd+5xumV+YiZi0RfNqkntGnAgnSnDG16FMI6s8iLoUacBhRp6NPgl6Gs1r1vk7RW9GodVfHUBgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T22:44:21.027660Z","bundle_sha256":"1543e1be8d20b37c2d5625580f50f0c094bfe7f70e9e18801070deebfdce49b8"}}