{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6BUMCEXGGVU7VXCPL4DWTJ3K3Z","short_pith_number":"pith:6BUMCEXG","schema_version":"1.0","canonical_sha256":"f068c112e63569fadc4f5f0769a76ade50cf37d73c4da846307f755106a51e9e","source":{"kind":"arxiv","id":"1704.03920","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.03920","created_at":"2026-05-18T00:46:25.886504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03920v1","created_at":"2026-05-18T00:46:25.886504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03920","created_at":"2026-05-18T00:46:25.886504+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BUMCEXGGVU7","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BUMCEXGGVU7VXCP","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BUMCEXG","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z","json":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z.json","graph_json":"https://pith.science/api/pith-number/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/graph.json","events_json":"https://pith.science/api/pith-number/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/events.json","paper":"https://pith.science/paper/6BUMCEXG"},"agent_actions":{"view_html":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z","download_json":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z.json","view_paper":"https://pith.science/paper/6BUMCEXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03920&json=true","fetch_graph":"https://pith.science/api/pith-number/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/action/storage_attestation","attest_author":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/action/author_attestation","sign_citation":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/action/citation_signature","submit_replication":"https://pith.science/pith/6BUMCEXGGVU7VXCPL4DWTJ3K3Z/action/replication_record"}},"created_at":"2026-05-18T00:46:25.886504+00:00","updated_at":"2026-05-18T00:46:25.886504+00:00"}