{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GZ6FFCJO2ETSRH4UYMBFCHENQY","short_pith_number":"pith:GZ6FFCJO","canonical_record":{"source":{"id":"1803.06034","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T23:35:57Z","cross_cats_sorted":[],"title_canon_sha256":"6939683ea83708103e1e894ff362be820ae54762eb903426476b7e3b9bc387b7","abstract_canon_sha256":"b18b85eb2921d5b27638a18a6e6815882a327a1971edd30cd77ae88e6d3e7101"},"schema_version":"1.0"},"canonical_sha256":"367c52892ed127289f94c302511c8d860eedcb0e61487b15cefca40dd1e000dd","source":{"kind":"arxiv","id":"1803.06034","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06034","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06034v5","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06034","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"GZ6FFCJO2ETS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GZ6FFCJO2ETSRH4U","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GZ6FFCJO","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GZ6FFCJO2ETSRH4UYMBFCHENQY","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06034","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T23:35:57Z","cross_cats_sorted":[],"title_canon_sha256":"6939683ea83708103e1e894ff362be820ae54762eb903426476b7e3b9bc387b7","abstract_canon_sha256":"b18b85eb2921d5b27638a18a6e6815882a327a1971edd30cd77ae88e6d3e7101"},"schema_version":"1.0"},"canonical_sha256":"367c52892ed127289f94c302511c8d860eedcb0e61487b15cefca40dd1e000dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:24.241741Z","signature_b64":"TGajzcGryA8GISRPayT0YVvp6ITYFW4sA/BuQZw1rVLPrim2BnvOKdy+vr4cg0c6qBoqZvPPeUViptg7h4UxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"367c52892ed127289f94c302511c8d860eedcb0e61487b15cefca40dd1e000dd","last_reissued_at":"2026-05-17T23:40:24.240931Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:24.240931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06034","source_version":5,"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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0QWM3k9sk0W14NzSichxh3EwQdYad2XBBqk0ZqRrlRAA19eAZbQj+M2Gc5KFrdXDqyhlanvw6mT8TGVlQ3VeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:14:27.349677Z"},"content_sha256":"98b6be0bf29a304dfb6157e21a7b11f4eacf86da44d3d24144040452a5bde655","schema_version":"1.0","event_id":"sha256:98b6be0bf29a304dfb6157e21a7b11f4eacf86da44d3d24144040452a5bde655"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GZ6FFCJO2ETSRH4UYMBFCHENQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multistage stochastic programs with a random number of stages: dynamic programming equations, solution methods, and application to portfolio selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Vincent Guigues","submitted_at":"2018-03-15T23:35:57Z","abstract_excerpt":"We introduce the class of multistage stochastic optimization problems with a random number of stages. For such problems, we show how to write dynamic programming equations and detail the Stochastic Dual Dynamic Programming algorithm to solve these equations. Finally, we consider a portfolio selection problem over an optimization period of random duration. For several instances of this problem, we show the gain obtained using a policy that takes the random duration of the number of stages into account over a policy built taking a fixed number of stages (namely the maximal possible number of sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06034","kind":"arxiv","version":5},"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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eviIWi654CYbu5j2O7BhGiumnqX1tPg8PYXeg2uTeXWWWzoZztdpQmYtxTyNy86ynj/yd6Sy7gao84O619jJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:14:27.350418Z"},"content_sha256":"05a0e14f0310a78d087d4ce2cb6103e82057b21d8e9b810651678eb0bcb15f5a","schema_version":"1.0","event_id":"sha256:05a0e14f0310a78d087d4ce2cb6103e82057b21d8e9b810651678eb0bcb15f5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZ6FFCJO2ETSRH4UYMBFCHENQY/bundle.json","state_url":"https://pith.science/pith/GZ6FFCJO2ETSRH4UYMBFCHENQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZ6FFCJO2ETSRH4UYMBFCHENQY/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-30T21:14:27Z","links":{"resolver":"https://pith.science/pith/GZ6FFCJO2ETSRH4UYMBFCHENQY","bundle":"https://pith.science/pith/GZ6FFCJO2ETSRH4UYMBFCHENQY/bundle.json","state":"https://pith.science/pith/GZ6FFCJO2ETSRH4UYMBFCHENQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZ6FFCJO2ETSRH4UYMBFCHENQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GZ6FFCJO2ETSRH4UYMBFCHENQY","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":"b18b85eb2921d5b27638a18a6e6815882a327a1971edd30cd77ae88e6d3e7101","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T23:35:57Z","title_canon_sha256":"6939683ea83708103e1e894ff362be820ae54762eb903426476b7e3b9bc387b7"},"schema_version":"1.0","source":{"id":"1803.06034","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06034","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06034v5","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06034","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"GZ6FFCJO2ETS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GZ6FFCJO2ETSRH4U","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GZ6FFCJO","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:05a0e14f0310a78d087d4ce2cb6103e82057b21d8e9b810651678eb0bcb15f5a","target":"graph","created_at":"2026-05-17T23:40:24Z","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 the class of multistage stochastic optimization problems with a random number of stages. For such problems, we show how to write dynamic programming equations and detail the Stochastic Dual Dynamic Programming algorithm to solve these equations. Finally, we consider a portfolio selection problem over an optimization period of random duration. For several instances of this problem, we show the gain obtained using a policy that takes the random duration of the number of stages into account over a policy built taking a fixed number of stages (namely the maximal possible number of sta","authors_text":"Vincent Guigues","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T23:35:57Z","title":"Multistage stochastic programs with a random number of stages: dynamic programming equations, solution methods, and application to portfolio selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06034","kind":"arxiv","version":5},"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:98b6be0bf29a304dfb6157e21a7b11f4eacf86da44d3d24144040452a5bde655","target":"record","created_at":"2026-05-17T23:40:24Z","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":"b18b85eb2921d5b27638a18a6e6815882a327a1971edd30cd77ae88e6d3e7101","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T23:35:57Z","title_canon_sha256":"6939683ea83708103e1e894ff362be820ae54762eb903426476b7e3b9bc387b7"},"schema_version":"1.0","source":{"id":"1803.06034","kind":"arxiv","version":5}},"canonical_sha256":"367c52892ed127289f94c302511c8d860eedcb0e61487b15cefca40dd1e000dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"367c52892ed127289f94c302511c8d860eedcb0e61487b15cefca40dd1e000dd","first_computed_at":"2026-05-17T23:40:24.240931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:24.240931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TGajzcGryA8GISRPayT0YVvp6ITYFW4sA/BuQZw1rVLPrim2BnvOKdy+vr4cg0c6qBoqZvPPeUViptg7h4UxAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:24.241741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06034","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98b6be0bf29a304dfb6157e21a7b11f4eacf86da44d3d24144040452a5bde655","sha256:05a0e14f0310a78d087d4ce2cb6103e82057b21d8e9b810651678eb0bcb15f5a"],"state_sha256":"7fcf6928d210da773ce2e8efa093a250d3eb11a72a42a491382d2bda55fa54c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C8+2vy3bBbgtUIq99GwVVx4/HPw1yPRD3ERgvwH8dSzBPl9wsr0yxbxK6seu4YZdl/t+GGJWarnp36qQq5RTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:14:27.353753Z","bundle_sha256":"84bc1e733d64022880994502006f35cf3e4bc4a47c1cebcffbb64fb2cde61eae"}}