{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3A3UENZ2IWKZD64B3PQSNELB3V","short_pith_number":"pith:3A3UENZ2","schema_version":"1.0","canonical_sha256":"d83742373a459591fb81dbe1269161dd644639303653b6842682d33f7f911e8a","source":{"kind":"arxiv","id":"2412.20708","version":1},"attestation_state":"computed","paper":{"title":"Two-Stage Distributionally Robust Optimization: Intuitive Understanding and Algorithm Development from the Primal Perspective","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Bo Zeng, Zhengsong Lu","submitted_at":"2024-12-30T04:55:58Z","abstract_excerpt":"In this paper, we study the two-stage distributionally robust optimization (DRO) problem from the primal perspective. Unlike existing approaches, this perspective allows us to build a deeper and more intuitive understanding on DRO, to leverage classical and well-established solution methods and to develop a general and fast decomposition algorithm (and its variants), and to address a couple of unsolved issues that are critical for modeling and computation. Theoretical analyses regarding the strength, convergence, and iteration complexity of the developed algorithm are also presented. A numeric"},"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":"2412.20708","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-30T04:55:58Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ba7c1ed857ada6bf3db1489c9fcf41e96de5a46da6a0394186f018207cdce4c0","abstract_canon_sha256":"015f041bb4e162f54294ad86e38d5d5044c9491fc4bd1d1342d97fa9b506ef62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:21.123446Z","signature_b64":"LNqz/hs7xmOD25EDGHiVE3hzK8K2OLbVCUEduGHURm7l6/E0RbMsGWNGL+tRWa/ozTzHuQuPQSvhRaA8yav/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d83742373a459591fb81dbe1269161dd644639303653b6842682d33f7f911e8a","last_reissued_at":"2026-07-05T09:55:21.122974Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:21.122974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Stage Distributionally Robust Optimization: Intuitive Understanding and Algorithm Development from the Primal Perspective","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Bo Zeng, Zhengsong Lu","submitted_at":"2024-12-30T04:55:58Z","abstract_excerpt":"In this paper, we study the two-stage distributionally robust optimization (DRO) problem from the primal perspective. Unlike existing approaches, this perspective allows us to build a deeper and more intuitive understanding on DRO, to leverage classical and well-established solution methods and to develop a general and fast decomposition algorithm (and its variants), and to address a couple of unsolved issues that are critical for modeling and computation. Theoretical analyses regarding the strength, convergence, and iteration complexity of the developed algorithm are also presented. A numeric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20708","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/2412.20708/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":"2412.20708","created_at":"2026-07-05T09:55:21.123030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.20708v1","created_at":"2026-07-05T09:55:21.123030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20708","created_at":"2026-07-05T09:55:21.123030+00:00"},{"alias_kind":"pith_short_12","alias_value":"3A3UENZ2IWKZ","created_at":"2026-07-05T09:55:21.123030+00:00"},{"alias_kind":"pith_short_16","alias_value":"3A3UENZ2IWKZD64B","created_at":"2026-07-05T09:55:21.123030+00:00"},{"alias_kind":"pith_short_8","alias_value":"3A3UENZ2","created_at":"2026-07-05T09:55:21.123030+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02331","citing_title":"Hallucination-Aware Diffusion Sampling for Inverse Problems via Robust Prior Updates","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23140","citing_title":"Green Manufacturing Capacity Planning by Integrating Distributionally Robust Optimization and Generative AI","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3A3UENZ2IWKZD64B3PQSNELB3V","json":"https://pith.science/pith/3A3UENZ2IWKZD64B3PQSNELB3V.json","graph_json":"https://pith.science/api/pith-number/3A3UENZ2IWKZD64B3PQSNELB3V/graph.json","events_json":"https://pith.science/api/pith-number/3A3UENZ2IWKZD64B3PQSNELB3V/events.json","paper":"https://pith.science/paper/3A3UENZ2"},"agent_actions":{"view_html":"https://pith.science/pith/3A3UENZ2IWKZD64B3PQSNELB3V","download_json":"https://pith.science/pith/3A3UENZ2IWKZD64B3PQSNELB3V.json","view_paper":"https://pith.science/paper/3A3UENZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.20708&json=true","fetch_graph":"https://pith.science/api/pith-number/3A3UENZ2IWKZD64B3PQSNELB3V/graph.json","fetch_events":"https://pith.science/api/pith-number/3A3UENZ2IWKZD64B3PQSNELB3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3A3UENZ2IWKZD64B3PQSNELB3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3A3UENZ2IWKZD64B3PQSNELB3V/action/storage_attestation","attest_author":"https://pith.science/pith/3A3UENZ2IWKZD64B3PQSNELB3V/action/author_attestation","sign_citation":"https://pith.science/pith/3A3UENZ2IWKZD64B3PQSNELB3V/action/citation_signature","submit_replication":"https://pith.science/pith/3A3UENZ2IWKZD64B3PQSNELB3V/action/replication_record"}},"created_at":"2026-07-05T09:55:21.123030+00:00","updated_at":"2026-07-05T09:55:21.123030+00:00"}