{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WEEGGB42WSRMK6VZX2NG52ZLGD","short_pith_number":"pith:WEEGGB42","canonical_record":{"source":{"id":"1801.04745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-15T11:31:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"984b7e4518ba61a8ceb1a83361180ffc46d761465e1844a7f5d9a6df601c28eb","abstract_canon_sha256":"2d62c820c23bcbce2c277a7d0cf270a34efe5e2b3e69994dbb6344437243b1cd"},"schema_version":"1.0"},"canonical_sha256":"b10863079ab4a2c57ab9be9a6eeb2b30f30f2a6fce16e992d66ffaf5bcb06cf1","source":{"kind":"arxiv","id":"1801.04745","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04745","created_at":"2026-05-18T00:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04745v2","created_at":"2026-05-18T00:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04745","created_at":"2026-05-18T00:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"WEEGGB42WSRM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WEEGGB42WSRMK6VZ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WEEGGB42","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WEEGGB42WSRMK6VZX2NG52ZLGD","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-15T11:31:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"984b7e4518ba61a8ceb1a83361180ffc46d761465e1844a7f5d9a6df601c28eb","abstract_canon_sha256":"2d62c820c23bcbce2c277a7d0cf270a34efe5e2b3e69994dbb6344437243b1cd"},"schema_version":"1.0"},"canonical_sha256":"b10863079ab4a2c57ab9be9a6eeb2b30f30f2a6fce16e992d66ffaf5bcb06cf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:49.633478Z","signature_b64":"jDn8ql7t0cX4rS+GxlzheN6nFVHt9k63tJx6++MpZk5UNooy8qpYYFAJt0lYKQRlzterzyfrBOUEyooR/l3QAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b10863079ab4a2c57ab9be9a6eeb2b30f30f2a6fce16e992d66ffaf5bcb06cf1","last_reissued_at":"2026-05-18T00:03:49.632859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:49.632859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04745","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:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FuQ7nTC9mkjLVrqLLr+YFdbfI6qq8PoRLGvWSbQyFI/ZMjKZ7oMxggjfZ8f6cxVepqxN556Kq9Bki07VKpX7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:20:41.523735Z"},"content_sha256":"4381c21168e3939a2fc7287be27aa68f516de38b34d343c3b7c51f2dfa31ff1a","schema_version":"1.0","event_id":"sha256:4381c21168e3939a2fc7287be27aa68f516de38b34d343c3b7c51f2dfa31ff1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WEEGGB42WSRMK6VZX2NG52ZLGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributionally Robust Optimization for Sequential Decision Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Pengqian Yu, William B. Haskell, Zhi Chen","submitted_at":"2018-01-15T11:31:01Z","abstract_excerpt":"The distributionally robust Markov Decision Process (MDP) approach asks for a distributionally robust policy that achieves the maximal expected total reward under the most adversarial distribution of uncertain parameters. In this paper, we study distributionally robust MDPs where ambiguity sets for the uncertain parameters are of a format that can easily incorporate in its description the uncertainty's generalized moment as well as statistical distance information. In this way, we generalize existing works on distributionally robust MDP with generalized-moment-based and statistical-distance-ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04745","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:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VO2APHI6Ujk/THNlOX0kWVXwY/fMeCB82dRgRJ4PTEG12rB9dEBsmIqzAxAm8Yivk4mXtwJhSPRwPb0w3+veAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:20:41.524076Z"},"content_sha256":"e6460c7c3418024f2ce603d70d8c52bdbaff0605f284c83d13a8393fe0c2dde5","schema_version":"1.0","event_id":"sha256:e6460c7c3418024f2ce603d70d8c52bdbaff0605f284c83d13a8393fe0c2dde5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEEGGB42WSRMK6VZX2NG52ZLGD/bundle.json","state_url":"https://pith.science/pith/WEEGGB42WSRMK6VZX2NG52ZLGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEEGGB42WSRMK6VZX2NG52ZLGD/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-28T00:20:41Z","links":{"resolver":"https://pith.science/pith/WEEGGB42WSRMK6VZX2NG52ZLGD","bundle":"https://pith.science/pith/WEEGGB42WSRMK6VZX2NG52ZLGD/bundle.json","state":"https://pith.science/pith/WEEGGB42WSRMK6VZX2NG52ZLGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEEGGB42WSRMK6VZX2NG52ZLGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WEEGGB42WSRMK6VZX2NG52ZLGD","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":"2d62c820c23bcbce2c277a7d0cf270a34efe5e2b3e69994dbb6344437243b1cd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-15T11:31:01Z","title_canon_sha256":"984b7e4518ba61a8ceb1a83361180ffc46d761465e1844a7f5d9a6df601c28eb"},"schema_version":"1.0","source":{"id":"1801.04745","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04745","created_at":"2026-05-18T00:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04745v2","created_at":"2026-05-18T00:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04745","created_at":"2026-05-18T00:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"WEEGGB42WSRM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WEEGGB42WSRMK6VZ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WEEGGB42","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:e6460c7c3418024f2ce603d70d8c52bdbaff0605f284c83d13a8393fe0c2dde5","target":"graph","created_at":"2026-05-18T00:03: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":"The distributionally robust Markov Decision Process (MDP) approach asks for a distributionally robust policy that achieves the maximal expected total reward under the most adversarial distribution of uncertain parameters. In this paper, we study distributionally robust MDPs where ambiguity sets for the uncertain parameters are of a format that can easily incorporate in its description the uncertainty's generalized moment as well as statistical distance information. In this way, we generalize existing works on distributionally robust MDP with generalized-moment-based and statistical-distance-ba","authors_text":"Pengqian Yu, William B. Haskell, Zhi Chen","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-15T11:31:01Z","title":"Distributionally Robust Optimization for Sequential Decision Making"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04745","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:4381c21168e3939a2fc7287be27aa68f516de38b34d343c3b7c51f2dfa31ff1a","target":"record","created_at":"2026-05-18T00:03: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":"2d62c820c23bcbce2c277a7d0cf270a34efe5e2b3e69994dbb6344437243b1cd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-15T11:31:01Z","title_canon_sha256":"984b7e4518ba61a8ceb1a83361180ffc46d761465e1844a7f5d9a6df601c28eb"},"schema_version":"1.0","source":{"id":"1801.04745","kind":"arxiv","version":2}},"canonical_sha256":"b10863079ab4a2c57ab9be9a6eeb2b30f30f2a6fce16e992d66ffaf5bcb06cf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b10863079ab4a2c57ab9be9a6eeb2b30f30f2a6fce16e992d66ffaf5bcb06cf1","first_computed_at":"2026-05-18T00:03:49.632859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:49.632859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jDn8ql7t0cX4rS+GxlzheN6nFVHt9k63tJx6++MpZk5UNooy8qpYYFAJt0lYKQRlzterzyfrBOUEyooR/l3QAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:49.633478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04745","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4381c21168e3939a2fc7287be27aa68f516de38b34d343c3b7c51f2dfa31ff1a","sha256:e6460c7c3418024f2ce603d70d8c52bdbaff0605f284c83d13a8393fe0c2dde5"],"state_sha256":"06f6dc15e6f2fb01ebb0215a4b48d9a22cdd65d29b784b03de79bb9b91e635e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1LmQgsn+WGn0zSzuBJL/MG065vJcQMDKYTjNA5TIt10CFujrSGPinP8DO+sRshdsf1HcKCSJXXB5+qjAYWYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:20:41.526183Z","bundle_sha256":"03ab746321badac8d2df6fb259c74ee6a074f5fae2e32923139b9dc7cf307d0f"}}