{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P2736C72S5J2A6SKK5HG2CGKYU","short_pith_number":"pith:P2736C72","canonical_record":{"source":{"id":"1801.02259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-07T22:27:57Z","cross_cats_sorted":[],"title_canon_sha256":"37677698e2f0420ad7804afec7c7677e3ef08a2bb8e0879388ba650f6266e4d0","abstract_canon_sha256":"412ac77552b92942ec005d6d1657a06bcb81e7381d159b6f25d1b945c6185d28"},"schema_version":"1.0"},"canonical_sha256":"7ebfbf0bfa9753a07a4a574e6d08cac536ceb8b5a48c42cef4a85f9b7857efd3","source":{"kind":"arxiv","id":"1801.02259","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02259","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02259v2","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02259","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"P2736C72S5J2","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P2736C72S5J2A6SK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P2736C72","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P2736C72S5J2A6SKK5HG2CGKYU","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-07T22:27:57Z","cross_cats_sorted":[],"title_canon_sha256":"37677698e2f0420ad7804afec7c7677e3ef08a2bb8e0879388ba650f6266e4d0","abstract_canon_sha256":"412ac77552b92942ec005d6d1657a06bcb81e7381d159b6f25d1b945c6185d28"},"schema_version":"1.0"},"canonical_sha256":"7ebfbf0bfa9753a07a4a574e6d08cac536ceb8b5a48c42cef4a85f9b7857efd3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:38.345363Z","signature_b64":"7BW+165gLV+IuOXe5FzD1P/G7HxPLwZbbFzv1eP/UCMu12zMXsu93gkpSIotIZSVDvK+c9U3SH88L+SsU5JeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ebfbf0bfa9753a07a4a574e6d08cac536ceb8b5a48c42cef4a85f9b7857efd3","last_reissued_at":"2026-05-18T00:12:38.344728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:38.344728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02259","source_version":2,"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-18T00:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HdzxuYBnjCS3JYcjEUDFdpdjUi1uILKmz1I0iwpgBXy/GPrK4tSr5Cci0NmA6YGBrbc0kyYOTN3kazp/et7mDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:07:01.923484Z"},"content_sha256":"a56f41588cbbf50efe49080906e5645233ba47059e65dac800a263142c6ef55f","schema_version":"1.0","event_id":"sha256:a56f41588cbbf50efe49080906e5645233ba47059e65dac800a263142c6ef55f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P2736C72S5J2A6SKK5HG2CGKYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Dual Approximate Dynamic Programming Approach to Multi-stage Stochastic Unit Commitment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jagdish Ramakrishnan, James Luedtke","submitted_at":"2018-01-07T22:27:57Z","abstract_excerpt":"We study the multi-stage stochastic unit commitment problem in which commitment and generation decisions can be made and adjusted in each time period. We formulate this problem as a Markov decision process, which is \"weakly-coupled\" in the sense that if the demand constraint is relaxed, the problem decomposes into a separate, low-dimensional, Markov decision process for each generator. We demonstrate how the dual approximate dynamic programming method of Barty, Carpentier, and Girardeau (RAIRO Operations Research, 44:167-183, 2010) can be adapted to obtain bounds and a policy for this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02259","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"},"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-18T00:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOg5uM6wb4b+zbQhV9w8tRyiNGAg7HIQVkgK5/+cRER5g7CM+DJGFV0CS0IGmMpN0HEOnQb7M4ywHB8qJz2EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:07:01.923825Z"},"content_sha256":"724c4a0330955a04eb5cf3b9c1b13fdf819da801ad4b04a061f1acdb1cb254d6","schema_version":"1.0","event_id":"sha256:724c4a0330955a04eb5cf3b9c1b13fdf819da801ad4b04a061f1acdb1cb254d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU/bundle.json","state_url":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2736C72S5J2A6SKK5HG2CGKYU/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-06-24T21:07:01Z","links":{"resolver":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU","bundle":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU/bundle.json","state":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2736C72S5J2A6SKK5HG2CGKYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P2736C72S5J2A6SKK5HG2CGKYU","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":"412ac77552b92942ec005d6d1657a06bcb81e7381d159b6f25d1b945c6185d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-07T22:27:57Z","title_canon_sha256":"37677698e2f0420ad7804afec7c7677e3ef08a2bb8e0879388ba650f6266e4d0"},"schema_version":"1.0","source":{"id":"1801.02259","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02259","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02259v2","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02259","created_at":"2026-05-18T00:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"P2736C72S5J2","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P2736C72S5J2A6SK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P2736C72","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:724c4a0330955a04eb5cf3b9c1b13fdf819da801ad4b04a061f1acdb1cb254d6","target":"graph","created_at":"2026-05-18T00:12:38Z","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 study the multi-stage stochastic unit commitment problem in which commitment and generation decisions can be made and adjusted in each time period. We formulate this problem as a Markov decision process, which is \"weakly-coupled\" in the sense that if the demand constraint is relaxed, the problem decomposes into a separate, low-dimensional, Markov decision process for each generator. We demonstrate how the dual approximate dynamic programming method of Barty, Carpentier, and Girardeau (RAIRO Operations Research, 44:167-183, 2010) can be adapted to obtain bounds and a policy for this problem.","authors_text":"Jagdish Ramakrishnan, James Luedtke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-07T22:27:57Z","title":"A Dual Approximate Dynamic Programming Approach to Multi-stage Stochastic Unit Commitment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02259","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:a56f41588cbbf50efe49080906e5645233ba47059e65dac800a263142c6ef55f","target":"record","created_at":"2026-05-18T00:12:38Z","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":"412ac77552b92942ec005d6d1657a06bcb81e7381d159b6f25d1b945c6185d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-07T22:27:57Z","title_canon_sha256":"37677698e2f0420ad7804afec7c7677e3ef08a2bb8e0879388ba650f6266e4d0"},"schema_version":"1.0","source":{"id":"1801.02259","kind":"arxiv","version":2}},"canonical_sha256":"7ebfbf0bfa9753a07a4a574e6d08cac536ceb8b5a48c42cef4a85f9b7857efd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ebfbf0bfa9753a07a4a574e6d08cac536ceb8b5a48c42cef4a85f9b7857efd3","first_computed_at":"2026-05-18T00:12:38.344728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:38.344728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7BW+165gLV+IuOXe5FzD1P/G7HxPLwZbbFzv1eP/UCMu12zMXsu93gkpSIotIZSVDvK+c9U3SH88L+SsU5JeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:38.345363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02259","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a56f41588cbbf50efe49080906e5645233ba47059e65dac800a263142c6ef55f","sha256:724c4a0330955a04eb5cf3b9c1b13fdf819da801ad4b04a061f1acdb1cb254d6"],"state_sha256":"6baa12c185c99c6f8c4a2399da52ab465ebcac20fae082f8ff964323e5ddd0de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUI4nyv5L02BEFOI595GlywHQ0RzsYQimLVyg8DhejtpvqlhITJbyuLvI0gMGtuMV2kP4pfF6aFMs4V5Egb+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:07:01.925652Z","bundle_sha256":"94bbaf1c09d0a5763fe6e6c6c140a3d5e001ded7a502ea4d15c0f9034a97fcc6"}}