{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6BUMCEXGGVU7VXCPL4DWTJ3K3Z","short_pith_number":"pith:6BUMCEXG","canonical_record":{"source":{"id":"1704.03920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-12T20:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"7d07ca1fafa0dd45df62798e624e06f53ead72983b57e808a3bae4eaa55814bd","abstract_canon_sha256":"12b4b803be4449d83c79906e9fe9eaf97d11b20319f3f8dcb69992b56f168416"},"schema_version":"1.0"},"canonical_sha256":"f068c112e63569fadc4f5f0769a76ade50cf37d73c4da846307f755106a51e9e","source":{"kind":"arxiv","id":"1704.03920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03920","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03920v1","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03920","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"6BUMCEXGGVU7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6BUMCEXGGVU7VXCP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6BUMCEXG","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6BUMCEXGGVU7VXCPL4DWTJ3K3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-12T20:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"7d07ca1fafa0dd45df62798e624e06f53ead72983b57e808a3bae4eaa55814bd","abstract_canon_sha256":"12b4b803be4449d83c79906e9fe9eaf97d11b20319f3f8dcb69992b56f168416"},"schema_version":"1.0"},"canonical_sha256":"f068c112e63569fadc4f5f0769a76ade50cf37d73c4da846307f755106a51e9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:25.887103Z","signature_b64":"K8gWzF5BmZ9Fb44U3QCWwbTOd35eg0CHV2291OoetkfVdExoH06PxNcwPnBvGzLgEF+XYlK02hDC127Sc4OGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f068c112e63569fadc4f5f0769a76ade50cf37d73c4da846307f755106a51e9e","last_reissued_at":"2026-05-18T00:46:25.886402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:25.886402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03920","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-05-18T00:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XiEkTk6rxjl8fy45SNqowM4EF96CdO7HuacLesnRrS89EnEEGAPJBIA+qp/wBk7MprpE77TFBKU/p9HAyf39Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:56:01.190020Z"},"content_sha256":"83b198707c13c3be44a1f08a1188af97e7f277b736630148e157eac8a6fedc64","schema_version":"1.0","event_id":"sha256:83b198707c13c3be44a1f08a1188af97e7f277b736630148e157eac8a6fedc64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6BUMCEXGGVU7VXCPL4DWTJ3K3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fengqiao Luo, Sanjay Mehrotra","submitted_at":"2017-04-12T20:29:12Z","abstract_excerpt":"We study distributionally robust optimization (DRO) problems where the ambiguity set is defined using the Wasserstein metric. We show that this class of DRO problems can be reformulated as semi-infinite programs. We give an exchange method to solve the reformulated problem for the general nonlinear model, and a central cutting-surface method for the convex case, assuming that we have a separation oracle. We used a distributionally robust generalization of the logistic regression model to test our algorithm. Numerical experiments on the distributionally robust logistic regression models show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03920","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":""},"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-05-18T00:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7o6hdboN2HIsrZlFoIAxgiL0WM1X21RLUDt3gRU9aHBuY97LhacOTab81DJ1+XRGjupyrbyvaNE3nLYnYoqYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:56:01.190393Z"},"content_sha256":"0ad3c0626c05953a891a9d125d8d93b503c04b10aaf026875f9e3ba6d23c768d","schema_version":"1.0","event_id":"sha256:0ad3c0626c05953a891a9d125d8d93b503c04b10aaf026875f9e3ba6d23c768d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/bundle.json","state_url":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/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-06-04T15:56:01Z","links":{"resolver":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z","bundle":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/bundle.json","state":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6BUMCEXGGVU7VXCPL4DWTJ3K3Z","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":"12b4b803be4449d83c79906e9fe9eaf97d11b20319f3f8dcb69992b56f168416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-12T20:29:12Z","title_canon_sha256":"7d07ca1fafa0dd45df62798e624e06f53ead72983b57e808a3bae4eaa55814bd"},"schema_version":"1.0","source":{"id":"1704.03920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03920","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03920v1","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03920","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"6BUMCEXGGVU7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6BUMCEXGGVU7VXCP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6BUMCEXG","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:0ad3c0626c05953a891a9d125d8d93b503c04b10aaf026875f9e3ba6d23c768d","target":"graph","created_at":"2026-05-18T00:46:25Z","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"},"paper":{"abstract_excerpt":"We study distributionally robust optimization (DRO) problems where the ambiguity set is defined using the Wasserstein metric. We show that this class of DRO problems can be reformulated as semi-infinite programs. We give an exchange method to solve the reformulated problem for the general nonlinear model, and a central cutting-surface method for the convex case, assuming that we have a separation oracle. We used a distributionally robust generalization of the logistic regression model to test our algorithm. Numerical experiments on the distributionally robust logistic regression models show th","authors_text":"Fengqiao Luo, Sanjay Mehrotra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-12T20:29:12Z","title":"Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03920","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:83b198707c13c3be44a1f08a1188af97e7f277b736630148e157eac8a6fedc64","target":"record","created_at":"2026-05-18T00:46:25Z","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":"12b4b803be4449d83c79906e9fe9eaf97d11b20319f3f8dcb69992b56f168416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-12T20:29:12Z","title_canon_sha256":"7d07ca1fafa0dd45df62798e624e06f53ead72983b57e808a3bae4eaa55814bd"},"schema_version":"1.0","source":{"id":"1704.03920","kind":"arxiv","version":1}},"canonical_sha256":"f068c112e63569fadc4f5f0769a76ade50cf37d73c4da846307f755106a51e9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f068c112e63569fadc4f5f0769a76ade50cf37d73c4da846307f755106a51e9e","first_computed_at":"2026-05-18T00:46:25.886402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:25.886402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K8gWzF5BmZ9Fb44U3QCWwbTOd35eg0CHV2291OoetkfVdExoH06PxNcwPnBvGzLgEF+XYlK02hDC127Sc4OGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:25.887103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83b198707c13c3be44a1f08a1188af97e7f277b736630148e157eac8a6fedc64","sha256:0ad3c0626c05953a891a9d125d8d93b503c04b10aaf026875f9e3ba6d23c768d"],"state_sha256":"14c878c87ac5ad1e93ad51d25713c5ea662f971df73b466527bd43be3f1e3a51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frKZ3V/vgIg1A9rpE8FGCkfPwlLyGgwkEtxdFrtB7RcUiijOlg/TMaQMTjhTosLZbuOMX5JrxM+wanmEC0kvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:56:01.192695Z","bundle_sha256":"a8788dae821a48ec34753db9ac06fb08425642cef3661c4b2d10701be10a0730"}}