{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MF2ORV3NSA2AVJGVVB33Z2QLG6","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":"4ab769a9a0ef70767e17263fe598a9eccf1ebbe7e04299b7edaae1263ce499ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2020-11-17T02:32:10Z","title_canon_sha256":"acce150f0c5d3623a5c93a2e4b429cd1d42a484e2c1fa8c99c91fbd836d1aae4"},"schema_version":"1.0","source":{"id":"2011.08376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.08376","created_at":"2026-07-05T01:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"2011.08376v1","created_at":"2026-07-05T01:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.08376","created_at":"2026-07-05T01:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"MF2ORV3NSA2A","created_at":"2026-07-05T01:52:04Z"},{"alias_kind":"pith_short_16","alias_value":"MF2ORV3NSA2AVJGV","created_at":"2026-07-05T01:52:04Z"},{"alias_kind":"pith_short_8","alias_value":"MF2ORV3N","created_at":"2026-07-05T01:52:04Z"}],"graph_snapshots":[{"event_id":"sha256:3e96f59cd2286060eeb7e619568b2615732f5bc17d71f9c59f4d9be5d90481b9","target":"graph","created_at":"2026-07-05T01:52:04Z","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/2011.08376/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present a sequential sampling-based algorithm for the two-stage distributionally robust linear programming (2-DRLP) models. The 2-DRLP models are defined over a general class of ambiguity sets with discrete or continuous probability distributions. The algorithm is a distributionally robust version of the well-known stochastic decomposition algorithm of Higle and Sen (Math. of OR 16(3), 650-669, 1991) for a two-stage stochastic linear program. We refer to the algorithm as the distributionally robust stochastic decomposition (DRSD) method. The key features of the algorithm incl","authors_text":"Harsha Gangammanavar, Manish Bansal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2020-11-17T02:32:10Z","title":"Stochastic Decomposition Method for Two-Stage Distributionally Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.08376","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:a0e0a734ff34aafdca8ade8601fb9c592107cac703d7aca1b3bc623cbf4a865e","target":"record","created_at":"2026-07-05T01:52:04Z","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":"4ab769a9a0ef70767e17263fe598a9eccf1ebbe7e04299b7edaae1263ce499ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2020-11-17T02:32:10Z","title_canon_sha256":"acce150f0c5d3623a5c93a2e4b429cd1d42a484e2c1fa8c99c91fbd836d1aae4"},"schema_version":"1.0","source":{"id":"2011.08376","kind":"arxiv","version":1}},"canonical_sha256":"6174e8d76d90340aa4d5a877bcea0b37affa47fc081037416f041059e10f0f45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6174e8d76d90340aa4d5a877bcea0b37affa47fc081037416f041059e10f0f45","first_computed_at":"2026-07-05T01:52:04.668123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:04.668123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4cQxv9WqARaU0EbT3hYGtmunUdMr0epvQpyNRXeog2Ap1bYpvDPf3Yz11nx/1dzBFSIOgwb+r3v+xSc0Xj+SDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:04.668479Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.08376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0e0a734ff34aafdca8ade8601fb9c592107cac703d7aca1b3bc623cbf4a865e","sha256:3e96f59cd2286060eeb7e619568b2615732f5bc17d71f9c59f4d9be5d90481b9"],"state_sha256":"73d0916090c6800292441c3e51cd4408bf79215179a661551f2b2067e6d01a24"}