{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P2736C72S5J2A6SKK5HG2CGKYU","short_pith_number":"pith:P2736C72","schema_version":"1.0","canonical_sha256":"7ebfbf0bfa9753a07a4a574e6d08cac536ceb8b5a48c42cef4a85f9b7857efd3","source":{"kind":"arxiv","id":"1801.02259","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.02259","created_at":"2026-05-18T00:12:38.344830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02259v2","created_at":"2026-05-18T00:12:38.344830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02259","created_at":"2026-05-18T00:12:38.344830+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2736C72S5J2","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2736C72S5J2A6SK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2736C72","created_at":"2026-05-18T12:32:43.782077+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/P2736C72S5J2A6SKK5HG2CGKYU","json":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU.json","graph_json":"https://pith.science/api/pith-number/P2736C72S5J2A6SKK5HG2CGKYU/graph.json","events_json":"https://pith.science/api/pith-number/P2736C72S5J2A6SKK5HG2CGKYU/events.json","paper":"https://pith.science/paper/P2736C72"},"agent_actions":{"view_html":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU","download_json":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU.json","view_paper":"https://pith.science/paper/P2736C72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02259&json=true","fetch_graph":"https://pith.science/api/pith-number/P2736C72S5J2A6SKK5HG2CGKYU/graph.json","fetch_events":"https://pith.science/api/pith-number/P2736C72S5J2A6SKK5HG2CGKYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU/action/storage_attestation","attest_author":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU/action/author_attestation","sign_citation":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU/action/citation_signature","submit_replication":"https://pith.science/pith/P2736C72S5J2A6SKK5HG2CGKYU/action/replication_record"}},"created_at":"2026-05-18T00:12:38.344830+00:00","updated_at":"2026-05-18T00:12:38.344830+00:00"}