{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ATUWZBDLFIJEG72RXJOEJ2S3R6","short_pith_number":"pith:ATUWZBDL","canonical_record":{"source":{"id":"1701.04102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-15T19:23:06Z","cross_cats_sorted":[],"title_canon_sha256":"fb8cf7f53e0df5f29a823f8012f2454c82ecbd5aa91447006812a2fb637cba05","abstract_canon_sha256":"3d59418c855e01dc6fd95db8f0675f9426b5b5fe55c437793eb6f86210a4ce10"},"schema_version":"1.0"},"canonical_sha256":"04e96c846b2a12437f51ba5c44ea5b8fa9397ffb2b068c40114b5e7a4aee1a24","source":{"kind":"arxiv","id":"1701.04102","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04102","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04102v2","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04102","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"ATUWZBDLFIJE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"ATUWZBDLFIJEG72R","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"ATUWZBDL","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ATUWZBDLFIJEG72RXJOEJ2S3R6","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-15T19:23:06Z","cross_cats_sorted":[],"title_canon_sha256":"fb8cf7f53e0df5f29a823f8012f2454c82ecbd5aa91447006812a2fb637cba05","abstract_canon_sha256":"3d59418c855e01dc6fd95db8f0675f9426b5b5fe55c437793eb6f86210a4ce10"},"schema_version":"1.0"},"canonical_sha256":"04e96c846b2a12437f51ba5c44ea5b8fa9397ffb2b068c40114b5e7a4aee1a24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:49.190052Z","signature_b64":"8tobOAo65d5+BvGc34QN+uchi5KcwtGaCBjcU7Gm64dVfXp/6YH6skE6fvaQ7jYwKIrf7vHNRF/rvy7hNyAIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04e96c846b2a12437f51ba5c44ea5b8fa9397ffb2b068c40114b5e7a4aee1a24","last_reissued_at":"2026-05-18T00:20:49.189470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:49.189470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04102","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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yarBBidT2jU6gbaSNf8nGvnMG7tioA+sosZU9IbLx7Rl7S7l2PWRNpT+3G/f5p8aQ1ctO73uEdPhOCXMBytRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:11:16.047427Z"},"content_sha256":"d3e7cf0518bd018832dadfd12ff76c74c53248c93e48cf0a7c4a8105ef304b1e","schema_version":"1.0","event_id":"sha256:d3e7cf0518bd018832dadfd12ff76c74c53248c93e48cf0a7c4a8105ef304b1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ATUWZBDLFIJEG72RXJOEJ2S3R6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-stage Linear Decision Rules for Multi-stage Stochastic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"James Luedtke, Merve Bodur","submitted_at":"2017-01-15T19:23:06Z","abstract_excerpt":"Multi-stage stochastic linear programs (MSLPs) are notoriously hard to solve in general. Linear decision rules (LDRs) yield an approximation of an MSLP by restricting the decisions at each stage to be an affine function of the observed uncertain parameters. Finding an optimal LDR is a static optimization problem that provides an upper bound on the optimal value of the MSLP, and, under certain assumptions, can be formulated as an explicit linear program. Similarly, as proposed by Kuhn, Wiesemann, and Georghiou (Math. Program., 130, 177-209, 2011) a lower bound for an MSLP can be obtained by res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04102","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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2G5McQd9A+Acj8jsH2J+ylRu2/Nq7vKboPfCKF69jRhTzx33WRDGzBxuNTl8APpQiWMLgb1z5IAv2mFPCvIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:11:16.047792Z"},"content_sha256":"76e67aa3c60294ef8991039cb3ee6dd21e4af57ee3b21ff5c944a58a5ac976eb","schema_version":"1.0","event_id":"sha256:76e67aa3c60294ef8991039cb3ee6dd21e4af57ee3b21ff5c944a58a5ac976eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATUWZBDLFIJEG72RXJOEJ2S3R6/bundle.json","state_url":"https://pith.science/pith/ATUWZBDLFIJEG72RXJOEJ2S3R6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATUWZBDLFIJEG72RXJOEJ2S3R6/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-30T18:11:16Z","links":{"resolver":"https://pith.science/pith/ATUWZBDLFIJEG72RXJOEJ2S3R6","bundle":"https://pith.science/pith/ATUWZBDLFIJEG72RXJOEJ2S3R6/bundle.json","state":"https://pith.science/pith/ATUWZBDLFIJEG72RXJOEJ2S3R6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATUWZBDLFIJEG72RXJOEJ2S3R6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ATUWZBDLFIJEG72RXJOEJ2S3R6","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":"3d59418c855e01dc6fd95db8f0675f9426b5b5fe55c437793eb6f86210a4ce10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-15T19:23:06Z","title_canon_sha256":"fb8cf7f53e0df5f29a823f8012f2454c82ecbd5aa91447006812a2fb637cba05"},"schema_version":"1.0","source":{"id":"1701.04102","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04102","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04102v2","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04102","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"ATUWZBDLFIJE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"ATUWZBDLFIJEG72R","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"ATUWZBDL","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:76e67aa3c60294ef8991039cb3ee6dd21e4af57ee3b21ff5c944a58a5ac976eb","target":"graph","created_at":"2026-05-18T00:20:49Z","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":"Multi-stage stochastic linear programs (MSLPs) are notoriously hard to solve in general. Linear decision rules (LDRs) yield an approximation of an MSLP by restricting the decisions at each stage to be an affine function of the observed uncertain parameters. Finding an optimal LDR is a static optimization problem that provides an upper bound on the optimal value of the MSLP, and, under certain assumptions, can be formulated as an explicit linear program. Similarly, as proposed by Kuhn, Wiesemann, and Georghiou (Math. Program., 130, 177-209, 2011) a lower bound for an MSLP can be obtained by res","authors_text":"James Luedtke, Merve Bodur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-15T19:23:06Z","title":"Two-stage Linear Decision Rules for Multi-stage Stochastic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04102","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:d3e7cf0518bd018832dadfd12ff76c74c53248c93e48cf0a7c4a8105ef304b1e","target":"record","created_at":"2026-05-18T00:20:49Z","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":"3d59418c855e01dc6fd95db8f0675f9426b5b5fe55c437793eb6f86210a4ce10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-15T19:23:06Z","title_canon_sha256":"fb8cf7f53e0df5f29a823f8012f2454c82ecbd5aa91447006812a2fb637cba05"},"schema_version":"1.0","source":{"id":"1701.04102","kind":"arxiv","version":2}},"canonical_sha256":"04e96c846b2a12437f51ba5c44ea5b8fa9397ffb2b068c40114b5e7a4aee1a24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04e96c846b2a12437f51ba5c44ea5b8fa9397ffb2b068c40114b5e7a4aee1a24","first_computed_at":"2026-05-18T00:20:49.189470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:49.189470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8tobOAo65d5+BvGc34QN+uchi5KcwtGaCBjcU7Gm64dVfXp/6YH6skE6fvaQ7jYwKIrf7vHNRF/rvy7hNyAIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:49.190052Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04102","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3e7cf0518bd018832dadfd12ff76c74c53248c93e48cf0a7c4a8105ef304b1e","sha256:76e67aa3c60294ef8991039cb3ee6dd21e4af57ee3b21ff5c944a58a5ac976eb"],"state_sha256":"9bd0c1753ea796722d94fb7e28aa1058df1906e3373619db22de50e455dfb42f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AeW5ygKITKHf7yCUzgfiSmAeH3gb2Rmj2+dXUQnwE2sOWmFDIusZlGYOfDgjEo14P38CRm5m7XSkkoKbyoX0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:11:16.049847Z","bundle_sha256":"ac7d42aa025d4ae801035707caccb92573fe73e3af625b8ad473e575e3048c0d"}}