{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HW76VQMBKK6FA5JWIOTSGXKPUJ","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":"3771938bbf17b12a130a7974aa1f33064c3a32c90757f711c7353ef45bdd8f56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-14T21:18:20Z","title_canon_sha256":"d3ceaaf0acd1180365bca04fc71e4aa1924c298e9ac9d92dd589e54c29f8d58e"},"schema_version":"1.0","source":{"id":"1902.06757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06757","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06757v2","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06757","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"HW76VQMBKK6F","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HW76VQMBKK6FA5JW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HW76VQMB","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:2a77c2548ff3c4a10a5c93f782d53f653b5dff03a75fff3be63b2dd901e70e42","target":"graph","created_at":"2026-05-17T23:40:03Z","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"},"paper":{"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 ","authors_text":"Michelle Bandarra, Vincent Guigues","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-14T21:18:20Z","title":"Single cut and multicut SDDP with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06757","kind":"arxiv","version":2},"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:18c69d5063eb20e7767e178815adc6a1026519bfe094919fec08a79edfa98327","target":"record","created_at":"2026-05-17T23:40:03Z","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":"3771938bbf17b12a130a7974aa1f33064c3a32c90757f711c7353ef45bdd8f56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-14T21:18:20Z","title_canon_sha256":"d3ceaaf0acd1180365bca04fc71e4aa1924c298e9ac9d92dd589e54c29f8d58e"},"schema_version":"1.0","source":{"id":"1902.06757","kind":"arxiv","version":2}},"canonical_sha256":"3dbfeac18152bc50753643a7235d4fa257823b36c5cb383378e1d9a49c418194","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dbfeac18152bc50753643a7235d4fa257823b36c5cb383378e1d9a49c418194","first_computed_at":"2026-05-17T23:40:03.842514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:03.842514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1lg5NITSvMOZEnpQTbZ4Kiu+0ZI9PQkt8135hYpgiMStGrl1Hd3bs32DqjoZ0640L39ZqEDpxSIot5cSv9rGBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:03.843014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18c69d5063eb20e7767e178815adc6a1026519bfe094919fec08a79edfa98327","sha256:2a77c2548ff3c4a10a5c93f782d53f653b5dff03a75fff3be63b2dd901e70e42"],"state_sha256":"11bc596759485f277366b619a879a0cb9775e98021458ec2200043a763ef2dad"}