{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:I6NMSF2B5B2C4ZWABQRKY7AEES","short_pith_number":"pith:I6NMSF2B","schema_version":"1.0","canonical_sha256":"479ac91741e8742e66c00c22ac7c0424b8c89562f16135f1a2eeb0a1a0be9b4d","source":{"kind":"arxiv","id":"2606.20383","version":1},"attestation_state":"computed","paper":{"title":"A Single-Loop Minorized Dual Decomposition Method for Nonsmooth Multi-Stage Stochastic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dan Luo, Hailin Sun, Lei Yang, Yang You","submitted_at":"2026-06-18T15:41:19Z","abstract_excerpt":"In this paper, we study multi-stage stochastic programming (MSP) problems with nonsmooth composite objectives. Tailored to their intrinsic stage-wise and scenario-wise structure, we develop a single-loop minorized dual decomposition method, in which each iteration constructs a minorized problem and its restricted Wolfe dual, and then performs \\textit{one iteration} of the symmetric Gauss--Seidel based inexact alternating direction method of multipliers on the resulting dual problem to generate the next iterate. A key feature of the proposed optimization framework is that the resulting updates "},"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":"2606.20383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-18T15:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"5713808b5954b04234d7dde275ed3674ab95ce7434b2d1fc467abfadb1387ce6","abstract_canon_sha256":"e47eff1461281c420aadc92998964e23b796a41d83d7f601b230512ef56f0df7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:11.108893Z","signature_b64":"a/rysGom+vx8oQlS4bjvRjkwXxsOUdfMlrJvQ/auuZUUaAUbHHSYZwshAGq3bd432c0AdBlCxbGnwz7dAPrwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"479ac91741e8742e66c00c22ac7c0424b8c89562f16135f1a2eeb0a1a0be9b4d","last_reissued_at":"2026-06-19T16:13:11.108493Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:11.108493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Single-Loop Minorized Dual Decomposition Method for Nonsmooth Multi-Stage Stochastic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dan Luo, Hailin Sun, Lei Yang, Yang You","submitted_at":"2026-06-18T15:41:19Z","abstract_excerpt":"In this paper, we study multi-stage stochastic programming (MSP) problems with nonsmooth composite objectives. Tailored to their intrinsic stage-wise and scenario-wise structure, we develop a single-loop minorized dual decomposition method, in which each iteration constructs a minorized problem and its restricted Wolfe dual, and then performs \\textit{one iteration} of the symmetric Gauss--Seidel based inexact alternating direction method of multipliers on the resulting dual problem to generate the next iterate. A key feature of the proposed optimization framework is that the resulting updates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20383","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/2606.20383/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":"2606.20383","created_at":"2026-06-19T16:13:11.108555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.20383v1","created_at":"2026-06-19T16:13:11.108555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20383","created_at":"2026-06-19T16:13:11.108555+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6NMSF2B5B2C","created_at":"2026-06-19T16:13:11.108555+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6NMSF2B5B2C4ZWA","created_at":"2026-06-19T16:13:11.108555+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6NMSF2B","created_at":"2026-06-19T16:13:11.108555+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/I6NMSF2B5B2C4ZWABQRKY7AEES","json":"https://pith.science/pith/I6NMSF2B5B2C4ZWABQRKY7AEES.json","graph_json":"https://pith.science/api/pith-number/I6NMSF2B5B2C4ZWABQRKY7AEES/graph.json","events_json":"https://pith.science/api/pith-number/I6NMSF2B5B2C4ZWABQRKY7AEES/events.json","paper":"https://pith.science/paper/I6NMSF2B"},"agent_actions":{"view_html":"https://pith.science/pith/I6NMSF2B5B2C4ZWABQRKY7AEES","download_json":"https://pith.science/pith/I6NMSF2B5B2C4ZWABQRKY7AEES.json","view_paper":"https://pith.science/paper/I6NMSF2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.20383&json=true","fetch_graph":"https://pith.science/api/pith-number/I6NMSF2B5B2C4ZWABQRKY7AEES/graph.json","fetch_events":"https://pith.science/api/pith-number/I6NMSF2B5B2C4ZWABQRKY7AEES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6NMSF2B5B2C4ZWABQRKY7AEES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6NMSF2B5B2C4ZWABQRKY7AEES/action/storage_attestation","attest_author":"https://pith.science/pith/I6NMSF2B5B2C4ZWABQRKY7AEES/action/author_attestation","sign_citation":"https://pith.science/pith/I6NMSF2B5B2C4ZWABQRKY7AEES/action/citation_signature","submit_replication":"https://pith.science/pith/I6NMSF2B5B2C4ZWABQRKY7AEES/action/replication_record"}},"created_at":"2026-06-19T16:13:11.108555+00:00","updated_at":"2026-06-19T16:13:11.108555+00:00"}