{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HW76VQMBKK6FA5JWIOTSGXKPUJ","short_pith_number":"pith:HW76VQMB","schema_version":"1.0","canonical_sha256":"3dbfeac18152bc50753643a7235d4fa257823b36c5cb383378e1d9a49c418194","source":{"kind":"arxiv","id":"1902.06757","version":2},"attestation_state":"computed","paper":{"title":"Single cut and multicut SDDP with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michelle Bandarra, Vincent Guigues","submitted_at":"2019-02-14T21:18:20Z","abstract_excerpt":"We introduce a variant of Multicut Decomposition Algorithms (MuDA), called CuSMuDA (Cut Selection for Multicut Decomposition Algorithms), for solving multistage stochastic linear programs that incorporates a class of cut selection strategies to choose the most relevant cuts of the approximate recourse functions. This class contains Level 1 and Limited Memory Level 1 cut selection strategies, initially introduced for respectively Stochastic Dual Dynamic Programming (SDDP) and Dual Dynamic Programming (DDP). We prove the almost sure convergence of the method in a finite number of iterations and "},"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":"1902.06757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-14T21:18:20Z","cross_cats_sorted":[],"title_canon_sha256":"d3ceaaf0acd1180365bca04fc71e4aa1924c298e9ac9d92dd589e54c29f8d58e","abstract_canon_sha256":"3771938bbf17b12a130a7974aa1f33064c3a32c90757f711c7353ef45bdd8f56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:03.843014Z","signature_b64":"1lg5NITSvMOZEnpQTbZ4Kiu+0ZI9PQkt8135hYpgiMStGrl1Hd3bs32DqjoZ0640L39ZqEDpxSIot5cSv9rGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dbfeac18152bc50753643a7235d4fa257823b36c5cb383378e1d9a49c418194","last_reissued_at":"2026-05-17T23:40:03.842514Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:03.842514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single cut and multicut SDDP with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michelle Bandarra, Vincent Guigues","submitted_at":"2019-02-14T21:18:20Z","abstract_excerpt":"We introduce a variant of Multicut Decomposition Algorithms (MuDA), called CuSMuDA (Cut Selection for Multicut Decomposition Algorithms), for solving multistage stochastic linear programs that incorporates a class of cut selection strategies to choose the most relevant cuts of the approximate recourse functions. This class contains Level 1 and Limited Memory Level 1 cut selection strategies, initially introduced for respectively Stochastic Dual Dynamic Programming (SDDP) and Dual Dynamic Programming (DDP). We prove the almost sure convergence of the method in a finite number of iterations and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06757","kind":"arxiv","version":2},"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":"1902.06757","created_at":"2026-05-17T23:40:03.842590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06757v2","created_at":"2026-05-17T23:40:03.842590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06757","created_at":"2026-05-17T23:40:03.842590+00:00"},{"alias_kind":"pith_short_12","alias_value":"HW76VQMBKK6F","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HW76VQMBKK6FA5JW","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HW76VQMB","created_at":"2026-05-18T12:33:18.533446+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/HW76VQMBKK6FA5JWIOTSGXKPUJ","json":"https://pith.science/pith/HW76VQMBKK6FA5JWIOTSGXKPUJ.json","graph_json":"https://pith.science/api/pith-number/HW76VQMBKK6FA5JWIOTSGXKPUJ/graph.json","events_json":"https://pith.science/api/pith-number/HW76VQMBKK6FA5JWIOTSGXKPUJ/events.json","paper":"https://pith.science/paper/HW76VQMB"},"agent_actions":{"view_html":"https://pith.science/pith/HW76VQMBKK6FA5JWIOTSGXKPUJ","download_json":"https://pith.science/pith/HW76VQMBKK6FA5JWIOTSGXKPUJ.json","view_paper":"https://pith.science/paper/HW76VQMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06757&json=true","fetch_graph":"https://pith.science/api/pith-number/HW76VQMBKK6FA5JWIOTSGXKPUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HW76VQMBKK6FA5JWIOTSGXKPUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HW76VQMBKK6FA5JWIOTSGXKPUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HW76VQMBKK6FA5JWIOTSGXKPUJ/action/storage_attestation","attest_author":"https://pith.science/pith/HW76VQMBKK6FA5JWIOTSGXKPUJ/action/author_attestation","sign_citation":"https://pith.science/pith/HW76VQMBKK6FA5JWIOTSGXKPUJ/action/citation_signature","submit_replication":"https://pith.science/pith/HW76VQMBKK6FA5JWIOTSGXKPUJ/action/replication_record"}},"created_at":"2026-05-17T23:40:03.842590+00:00","updated_at":"2026-05-17T23:40:03.842590+00:00"}