{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3QAATL2KF264GJBNE4LC6CFSUT","short_pith_number":"pith:3QAATL2K","canonical_record":{"source":{"id":"1705.08977","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T21:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"2ba629640a563e92cfac9b0f61f37d8245cf1eba624e83774c13f14c64633a88","abstract_canon_sha256":"54f979e7570ce48c19c69075dcc88593938939d9dd184c697d8f891de608387f"},"schema_version":"1.0"},"canonical_sha256":"dc0009af4a2ebdc3242d27162f08b2a4f8d3282d1cd1a46d39ab4c5fe13cb2c3","source":{"kind":"arxiv","id":"1705.08977","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08977","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08977v3","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08977","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"3QAATL2KF264","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3QAATL2KF264GJBN","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3QAATL2K","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3QAATL2KF264GJBNE4LC6CFSUT","target":"record","payload":{"canonical_record":{"source":{"id":"1705.08977","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T21:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"2ba629640a563e92cfac9b0f61f37d8245cf1eba624e83774c13f14c64633a88","abstract_canon_sha256":"54f979e7570ce48c19c69075dcc88593938939d9dd184c697d8f891de608387f"},"schema_version":"1.0"},"canonical_sha256":"dc0009af4a2ebdc3242d27162f08b2a4f8d3282d1cd1a46d39ab4c5fe13cb2c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:04.843342Z","signature_b64":"HYP8Q7ErbGQ1+nl2KFYQFundnT9v1qWEPE0HPbqCet5EKBoDKbl3k8qQA5IwTVVO72Nr/8uI1h2s93RkgCFICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc0009af4a2ebdc3242d27162f08b2a4f8d3282d1cd1a46d39ab4c5fe13cb2c3","last_reissued_at":"2026-05-17T23:40:04.842792Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:04.842792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.08977","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMUPWKngGBGNocIKDyF0Vo9iDgM0iHL/8+pM4xrvM31cy40fNM3JNNo/DD3LHAe7HvU4BlpdNhsC+owWK2bMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:33:06.877364Z"},"content_sha256":"fea4d8dcadb9ba7b722d3373d333111adbd602b3186015e5fbcbf9464705a07f","schema_version":"1.0","event_id":"sha256:fea4d8dcadb9ba7b722d3373d333111adbd602b3186015e5fbcbf9464705a07f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3QAATL2KF264GJBNE4LC6CFSUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multicut decomposition methods with cut selection for multistage stochastic programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michelle Bandarra, Vincent Guigues","submitted_at":"2017-05-24T21:56:43Z","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 strategies to select the most relevant cuts of the approximate recourse functions. We prove the convergence of the method in a finite number of iterations and use it to solve six portfolio problems with direct transaction costs under return uncertainty and six inventory management problems under demand uncertainty. On all problem instances CuSMuDA is much quicker than MuDA: between 5.1 and 1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08977","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvpzfUWEOo3LRUfZaKcTaiVhmejKdOqF0oCB5n85qp4GiKwbZ27vibdVu647mkZA8XRbI0e/UBx1lvtrFCmUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:33:06.877734Z"},"content_sha256":"0085a48b8ec6527b2c067762b0d34727ecd3df8fe9f758a762f1f3e634c06d97","schema_version":"1.0","event_id":"sha256:0085a48b8ec6527b2c067762b0d34727ecd3df8fe9f758a762f1f3e634c06d97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QAATL2KF264GJBNE4LC6CFSUT/bundle.json","state_url":"https://pith.science/pith/3QAATL2KF264GJBNE4LC6CFSUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QAATL2KF264GJBNE4LC6CFSUT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T03:33:06Z","links":{"resolver":"https://pith.science/pith/3QAATL2KF264GJBNE4LC6CFSUT","bundle":"https://pith.science/pith/3QAATL2KF264GJBNE4LC6CFSUT/bundle.json","state":"https://pith.science/pith/3QAATL2KF264GJBNE4LC6CFSUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QAATL2KF264GJBNE4LC6CFSUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3QAATL2KF264GJBNE4LC6CFSUT","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":"54f979e7570ce48c19c69075dcc88593938939d9dd184c697d8f891de608387f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T21:56:43Z","title_canon_sha256":"2ba629640a563e92cfac9b0f61f37d8245cf1eba624e83774c13f14c64633a88"},"schema_version":"1.0","source":{"id":"1705.08977","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08977","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08977v3","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08977","created_at":"2026-05-17T23:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"3QAATL2KF264","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3QAATL2KF264GJBN","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3QAATL2K","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:0085a48b8ec6527b2c067762b0d34727ecd3df8fe9f758a762f1f3e634c06d97","target":"graph","created_at":"2026-05-17T23:40: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"},"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 strategies to select the most relevant cuts of the approximate recourse functions. We prove the convergence of the method in a finite number of iterations and use it to solve six portfolio problems with direct transaction costs under return uncertainty and six inventory management problems under demand uncertainty. On all problem instances CuSMuDA is much quicker than MuDA: between 5.1 and 1","authors_text":"Michelle Bandarra, Vincent Guigues","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T21:56:43Z","title":"Multicut decomposition methods with cut selection for multistage stochastic programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08977","kind":"arxiv","version":3},"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:fea4d8dcadb9ba7b722d3373d333111adbd602b3186015e5fbcbf9464705a07f","target":"record","created_at":"2026-05-17T23:40: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":"54f979e7570ce48c19c69075dcc88593938939d9dd184c697d8f891de608387f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T21:56:43Z","title_canon_sha256":"2ba629640a563e92cfac9b0f61f37d8245cf1eba624e83774c13f14c64633a88"},"schema_version":"1.0","source":{"id":"1705.08977","kind":"arxiv","version":3}},"canonical_sha256":"dc0009af4a2ebdc3242d27162f08b2a4f8d3282d1cd1a46d39ab4c5fe13cb2c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc0009af4a2ebdc3242d27162f08b2a4f8d3282d1cd1a46d39ab4c5fe13cb2c3","first_computed_at":"2026-05-17T23:40:04.842792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:04.842792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HYP8Q7ErbGQ1+nl2KFYQFundnT9v1qWEPE0HPbqCet5EKBoDKbl3k8qQA5IwTVVO72Nr/8uI1h2s93RkgCFICQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:04.843342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08977","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fea4d8dcadb9ba7b722d3373d333111adbd602b3186015e5fbcbf9464705a07f","sha256:0085a48b8ec6527b2c067762b0d34727ecd3df8fe9f758a762f1f3e634c06d97"],"state_sha256":"f88cbc4703b6f9dcd369bffb9b6ed1d2c609748d4780b7a2b165553aa5467084"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+ZUHBax+LtdYfP/re01LcDdL4CW9nRhKu5Djh1GGKjI+J643uY95ikLb/+acIdNZRPddiJLVVTN0F4LvHB1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:33:06.880140Z","bundle_sha256":"dd8ef3c28e704b705db53a5a26a89609b1b7758b874111c1bdc3e83c68f6a73f"}}