{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JR4BAMOZ3XHLTNIBH5G33FM2QE","short_pith_number":"pith:JR4BAMOZ","schema_version":"1.0","canonical_sha256":"4c781031d9ddceb9b5013f4dbd959a813a660a2e01679a2062756e4d599dee7d","source":{"kind":"arxiv","id":"2303.03971","version":1},"attestation_state":"computed","paper":{"title":"Decision-dependent Distributionally Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Diego Fonseca, Mauricio Junca","submitted_at":"2023-03-07T15:14:47Z","abstract_excerpt":"This work presents a new Distributionally Robust Optimization approach, using $p$-Wasserstein metrics, to analyze a stochastic program in a general context. The ambiguity set in this approach depends on the decision variable and is represented as a ball where both the center and the radius depend on the decision variable. We show that, under Lipschitz's assumptions for the objective function, our approach can be reformulated as a finite-dimensional optimization problem, which is sometimes convex. In addition, we numerically compare our proposed approach with the standard formulation of distrib"},"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":"2303.03971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-07T15:14:47Z","cross_cats_sorted":[],"title_canon_sha256":"062d9072aa36441df8d3b9ae9e430452cbad23370878b2d42886d4a26b016f7f","abstract_canon_sha256":"2d21dfe0219b0fbefdbb7d4a9e88c97226ce78b48e0744687f197334101fa2c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:01.772096Z","signature_b64":"fhSBDTcW0QrMCxKiztRMgI9aJWSkk1eZqtILp/UOO5sTp5N+WjiUrNOhkzqaMyVeUlei+1V/JInmb2WY8SEJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c781031d9ddceb9b5013f4dbd959a813a660a2e01679a2062756e4d599dee7d","last_reissued_at":"2026-07-05T05:49:01.771658Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:01.771658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decision-dependent Distributionally Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Diego Fonseca, Mauricio Junca","submitted_at":"2023-03-07T15:14:47Z","abstract_excerpt":"This work presents a new Distributionally Robust Optimization approach, using $p$-Wasserstein metrics, to analyze a stochastic program in a general context. The ambiguity set in this approach depends on the decision variable and is represented as a ball where both the center and the radius depend on the decision variable. We show that, under Lipschitz's assumptions for the objective function, our approach can be reformulated as a finite-dimensional optimization problem, which is sometimes convex. In addition, we numerically compare our proposed approach with the standard formulation of distrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.03971","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/2303.03971/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":"2303.03971","created_at":"2026-07-05T05:49:01.771716+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.03971v1","created_at":"2026-07-05T05:49:01.771716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.03971","created_at":"2026-07-05T05:49:01.771716+00:00"},{"alias_kind":"pith_short_12","alias_value":"JR4BAMOZ3XHL","created_at":"2026-07-05T05:49:01.771716+00:00"},{"alias_kind":"pith_short_16","alias_value":"JR4BAMOZ3XHLTNIB","created_at":"2026-07-05T05:49:01.771716+00:00"},{"alias_kind":"pith_short_8","alias_value":"JR4BAMOZ","created_at":"2026-07-05T05:49:01.771716+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2406.20004","citing_title":"Residuals-Based Contextual Distributionally Robust Optimization with Decision-Dependent Uncertainty: Theoretical Guarantees and Decomposition Algorithm","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JR4BAMOZ3XHLTNIBH5G33FM2QE","json":"https://pith.science/pith/JR4BAMOZ3XHLTNIBH5G33FM2QE.json","graph_json":"https://pith.science/api/pith-number/JR4BAMOZ3XHLTNIBH5G33FM2QE/graph.json","events_json":"https://pith.science/api/pith-number/JR4BAMOZ3XHLTNIBH5G33FM2QE/events.json","paper":"https://pith.science/paper/JR4BAMOZ"},"agent_actions":{"view_html":"https://pith.science/pith/JR4BAMOZ3XHLTNIBH5G33FM2QE","download_json":"https://pith.science/pith/JR4BAMOZ3XHLTNIBH5G33FM2QE.json","view_paper":"https://pith.science/paper/JR4BAMOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.03971&json=true","fetch_graph":"https://pith.science/api/pith-number/JR4BAMOZ3XHLTNIBH5G33FM2QE/graph.json","fetch_events":"https://pith.science/api/pith-number/JR4BAMOZ3XHLTNIBH5G33FM2QE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JR4BAMOZ3XHLTNIBH5G33FM2QE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JR4BAMOZ3XHLTNIBH5G33FM2QE/action/storage_attestation","attest_author":"https://pith.science/pith/JR4BAMOZ3XHLTNIBH5G33FM2QE/action/author_attestation","sign_citation":"https://pith.science/pith/JR4BAMOZ3XHLTNIBH5G33FM2QE/action/citation_signature","submit_replication":"https://pith.science/pith/JR4BAMOZ3XHLTNIBH5G33FM2QE/action/replication_record"}},"created_at":"2026-07-05T05:49:01.771716+00:00","updated_at":"2026-07-05T05:49:01.771716+00:00"}