{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AZM65SGS56MCSN5UAANITAJ3CM","short_pith_number":"pith:AZM65SGS","schema_version":"1.0","canonical_sha256":"0659eec8d2ef982937b4001a89813b132197063aabed5c1b3f781c4b4627af4a","source":{"kind":"arxiv","id":"1708.07930","version":1},"attestation_state":"computed","paper":{"title":"A Study of Distributionally Robust Multistage Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jianqiu Huang, Kezhuo Zhou, Yongpei Guan","submitted_at":"2017-08-26T04:52:41Z","abstract_excerpt":"In this paper, we focus on a data-driven risk-averse multistage stochastic programming (RMSP) model considering distributional robustness. We optimize the RMSP over the worst-case distribution within an ambiguity set of probability distributions constructed directly from historical data samples. The proposed RMSP is intractable due to the multistage nested minimax structure in its objective function, so we reformulate it into a deterministic equivalent that contains a series of convex combination of expectation and conditional value at risk (CVaR), which can be solved by a customized stochasti"},"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":"1708.07930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-26T04:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"a41941da76634d49d4f664f1f75dda92b1af34638ff2b035a09835ac0f41d511","abstract_canon_sha256":"b71f90c10a395527167e097da5254b66f2cb00b6184601bc85aaba292f6235a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:37.608910Z","signature_b64":"3I9DgJhdZqLyEDLF73UW/ZpcFvtd/TRSRjSZacIBfeRumZ0//gw3pmS9oPOJJ5KG0E07ADCm4BCXfwEf7jJKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0659eec8d2ef982937b4001a89813b132197063aabed5c1b3f781c4b4627af4a","last_reissued_at":"2026-05-18T00:36:37.608413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:37.608413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Study of Distributionally Robust Multistage Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jianqiu Huang, Kezhuo Zhou, Yongpei Guan","submitted_at":"2017-08-26T04:52:41Z","abstract_excerpt":"In this paper, we focus on a data-driven risk-averse multistage stochastic programming (RMSP) model considering distributional robustness. We optimize the RMSP over the worst-case distribution within an ambiguity set of probability distributions constructed directly from historical data samples. The proposed RMSP is intractable due to the multistage nested minimax structure in its objective function, so we reformulate it into a deterministic equivalent that contains a series of convex combination of expectation and conditional value at risk (CVaR), which can be solved by a customized stochasti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07930","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":"1708.07930","created_at":"2026-05-18T00:36:37.608496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07930v1","created_at":"2026-05-18T00:36:37.608496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07930","created_at":"2026-05-18T00:36:37.608496+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZM65SGS56MC","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZM65SGS56MCSN5U","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZM65SGS","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06936","citing_title":"Adaptive Distributionally Robust Optimal Control with Bayesian Ambiguity Sets","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AZM65SGS56MCSN5UAANITAJ3CM","json":"https://pith.science/pith/AZM65SGS56MCSN5UAANITAJ3CM.json","graph_json":"https://pith.science/api/pith-number/AZM65SGS56MCSN5UAANITAJ3CM/graph.json","events_json":"https://pith.science/api/pith-number/AZM65SGS56MCSN5UAANITAJ3CM/events.json","paper":"https://pith.science/paper/AZM65SGS"},"agent_actions":{"view_html":"https://pith.science/pith/AZM65SGS56MCSN5UAANITAJ3CM","download_json":"https://pith.science/pith/AZM65SGS56MCSN5UAANITAJ3CM.json","view_paper":"https://pith.science/paper/AZM65SGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07930&json=true","fetch_graph":"https://pith.science/api/pith-number/AZM65SGS56MCSN5UAANITAJ3CM/graph.json","fetch_events":"https://pith.science/api/pith-number/AZM65SGS56MCSN5UAANITAJ3CM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZM65SGS56MCSN5UAANITAJ3CM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZM65SGS56MCSN5UAANITAJ3CM/action/storage_attestation","attest_author":"https://pith.science/pith/AZM65SGS56MCSN5UAANITAJ3CM/action/author_attestation","sign_citation":"https://pith.science/pith/AZM65SGS56MCSN5UAANITAJ3CM/action/citation_signature","submit_replication":"https://pith.science/pith/AZM65SGS56MCSN5UAANITAJ3CM/action/replication_record"}},"created_at":"2026-05-18T00:36:37.608496+00:00","updated_at":"2026-05-18T00:36:37.608496+00:00"}