{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MHTEB3C4AVHJDXJDJFF3KU5FHC","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":"71d5ed566b3ffdb9e5af006fea9dccd321428060416150c0ecaefcbf2590f7e8","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-12-29T19:31:23Z","title_canon_sha256":"b062016aabf10984e503dadc2bab302dc6fa9c4ca30b32a3b5efd8a768cbc9f3"},"schema_version":"1.0","source":{"id":"2412.20556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.20556","created_at":"2026-07-05T09:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"2412.20556v1","created_at":"2026-07-05T09:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20556","created_at":"2026-07-05T09:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"MHTEB3C4AVHJ","created_at":"2026-07-05T09:55:18Z"},{"alias_kind":"pith_short_16","alias_value":"MHTEB3C4AVHJDXJD","created_at":"2026-07-05T09:55:18Z"},{"alias_kind":"pith_short_8","alias_value":"MHTEB3C4","created_at":"2026-07-05T09:55:18Z"}],"graph_snapshots":[{"event_id":"sha256:9da0c0145797d0f62a07eafa5baa4460963eaa882cd9d1d1d607c14f42fec087","target":"graph","created_at":"2026-07-05T09:55:18Z","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/2412.20556/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a minimax problem motivated by distributionally robust optimization (DRO) when the worst-case distribution is continuous, leading to significant computational challenges due to the infinite-dimensional nature of the optimization problem. Recent research has explored learning the worst-case distribution using neural network-based generative models to address these computational challenges but lacks algorithmic convergence guarantees. This paper bridges this theoretical gap by presenting an iterative algorithm to solve such a minimax problem, achieving global convergence under mild a","authors_text":"Linglingzhi Zhu, Yao Xie","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-12-29T19:31:23Z","title":"Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20556","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:3ababa4e602089a3de6d12d8ff036ea73a588771582287a14b7666a1ed7f5e28","target":"record","created_at":"2026-07-05T09:55:18Z","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":"71d5ed566b3ffdb9e5af006fea9dccd321428060416150c0ecaefcbf2590f7e8","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-12-29T19:31:23Z","title_canon_sha256":"b062016aabf10984e503dadc2bab302dc6fa9c4ca30b32a3b5efd8a768cbc9f3"},"schema_version":"1.0","source":{"id":"2412.20556","kind":"arxiv","version":1}},"canonical_sha256":"61e640ec5c054e91dd23494bb553a538bce912e282fcaf243804b90f5001f0a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61e640ec5c054e91dd23494bb553a538bce912e282fcaf243804b90f5001f0a0","first_computed_at":"2026-07-05T09:55:18.907717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:18.907717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F5KOiPX7pCBzV2s4IIGq1mhFWnYyIE7k1dN6NJ5VPUV3yWh2UqiIisW//8cOx2VLPuKpgKekfULMvBXtYbFMBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:18.908165Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.20556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ababa4e602089a3de6d12d8ff036ea73a588771582287a14b7666a1ed7f5e28","sha256:9da0c0145797d0f62a07eafa5baa4460963eaa882cd9d1d1d607c14f42fec087"],"state_sha256":"b3c1a6a591f16be8a16bc16566238d2592b6b2fade159664e32f770385c20d23"}