{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FE767JJFIUVBL3YVPLVXBV6AAV","short_pith_number":"pith:FE767JJF","canonical_record":{"source":{"id":"1501.07418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-01-29T11:36:35Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1a057fcb39bd1aec164fe7575dea7228c8c9e2b4c598dd0658a3daa99fa56804","abstract_canon_sha256":"5e7d4691e27e05cd179d72fe23d46fe26ead463f30813272c6fbd7334e4e6e89"},"schema_version":"1.0"},"canonical_sha256":"293fefa525452a15ef157aeb70d7c0055c8920b91f4a8383143df656fc6c2bef","source":{"kind":"arxiv","id":"1501.07418","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07418","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07418v2","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07418","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"FE767JJFIUVB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FE767JJFIUVBL3YV","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FE767JJF","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FE767JJFIUVBL3YVPLVXBV6AAV","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-01-29T11:36:35Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1a057fcb39bd1aec164fe7575dea7228c8c9e2b4c598dd0658a3daa99fa56804","abstract_canon_sha256":"5e7d4691e27e05cd179d72fe23d46fe26ead463f30813272c6fbd7334e4e6e89"},"schema_version":"1.0"},"canonical_sha256":"293fefa525452a15ef157aeb70d7c0055c8920b91f4a8383143df656fc6c2bef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:10.897653Z","signature_b64":"1kxjHnlxvqwkmnw85pbtLnuPe93uUKKWC/9cV2FDI3UNSGm+sJuEi4PLdYu573Lb2Lz8f50ui1Y9A6dc6q0uAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"293fefa525452a15ef157aeb70d7c0055c8920b91f4a8383143df656fc6c2bef","last_reissued_at":"2026-05-18T02:12:10.896953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:10.896953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07418","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-18T02:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLc4jC+LC0se6jh9TN4DoDzJOcuQp8D2E3+vJw9UduhSXzuEBRNUgST1VW/2nijQaOXm73KhQZBSu2hNhRrNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:05:28.285067Z"},"content_sha256":"4aa766f55bd495f30e1f7a4793eb73648df5f182a91f9f3c8e85e39b0de97885","schema_version":"1.0","event_id":"sha256:4aa766f55bd495f30e1f7a4793eb73648df5f182a91f9f3c8e85e39b0de97885"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FE767JJFIUVBL3YVPLVXBV6AAV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributionally Robust Counterpart in Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Huan Xu, Pengqian Yu","submitted_at":"2015-01-29T11:36:35Z","abstract_excerpt":"This paper studies Markov Decision Processes under parameter uncertainty. We adapt the distributionally robust optimization framework, and assume that the uncertain parameters are random variables following an unknown distribution, and seeks the strategy which maximizes the expected performance under the most adversarial distribution. In particular, we generalize previous study \\cite{xu2012distributionally} which concentrates on distribution sets with very special structure to much more generic class of distribution sets, and show that the optimal strategy can be obtained efficiently under mil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07418","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-18T02:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKgF4oAf5nr6zbNSAb1KodKNecVfoLQsO3fRQrS4ZWj0Nqx54YC31BChcf3bcTc3YHh4xd63YmAqStBGpSg+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:05:28.285764Z"},"content_sha256":"88dd62098c87503fa998b5b99fcb6b20f4e24d585dfcb796b7367314464e67bb","schema_version":"1.0","event_id":"sha256:88dd62098c87503fa998b5b99fcb6b20f4e24d585dfcb796b7367314464e67bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FE767JJFIUVBL3YVPLVXBV6AAV/bundle.json","state_url":"https://pith.science/pith/FE767JJFIUVBL3YVPLVXBV6AAV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FE767JJFIUVBL3YVPLVXBV6AAV/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-07T20:05:28Z","links":{"resolver":"https://pith.science/pith/FE767JJFIUVBL3YVPLVXBV6AAV","bundle":"https://pith.science/pith/FE767JJFIUVBL3YVPLVXBV6AAV/bundle.json","state":"https://pith.science/pith/FE767JJFIUVBL3YVPLVXBV6AAV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FE767JJFIUVBL3YVPLVXBV6AAV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FE767JJFIUVBL3YVPLVXBV6AAV","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":"5e7d4691e27e05cd179d72fe23d46fe26ead463f30813272c6fbd7334e4e6e89","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-01-29T11:36:35Z","title_canon_sha256":"1a057fcb39bd1aec164fe7575dea7228c8c9e2b4c598dd0658a3daa99fa56804"},"schema_version":"1.0","source":{"id":"1501.07418","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07418","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07418v2","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07418","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"FE767JJFIUVB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FE767JJFIUVBL3YV","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FE767JJF","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:88dd62098c87503fa998b5b99fcb6b20f4e24d585dfcb796b7367314464e67bb","target":"graph","created_at":"2026-05-18T02:12:10Z","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":"This paper studies Markov Decision Processes under parameter uncertainty. We adapt the distributionally robust optimization framework, and assume that the uncertain parameters are random variables following an unknown distribution, and seeks the strategy which maximizes the expected performance under the most adversarial distribution. In particular, we generalize previous study \\cite{xu2012distributionally} which concentrates on distribution sets with very special structure to much more generic class of distribution sets, and show that the optimal strategy can be obtained efficiently under mil","authors_text":"Huan Xu, Pengqian Yu","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-01-29T11:36:35Z","title":"Distributionally Robust Counterpart in Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07418","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:4aa766f55bd495f30e1f7a4793eb73648df5f182a91f9f3c8e85e39b0de97885","target":"record","created_at":"2026-05-18T02:12:10Z","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":"5e7d4691e27e05cd179d72fe23d46fe26ead463f30813272c6fbd7334e4e6e89","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-01-29T11:36:35Z","title_canon_sha256":"1a057fcb39bd1aec164fe7575dea7228c8c9e2b4c598dd0658a3daa99fa56804"},"schema_version":"1.0","source":{"id":"1501.07418","kind":"arxiv","version":2}},"canonical_sha256":"293fefa525452a15ef157aeb70d7c0055c8920b91f4a8383143df656fc6c2bef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"293fefa525452a15ef157aeb70d7c0055c8920b91f4a8383143df656fc6c2bef","first_computed_at":"2026-05-18T02:12:10.896953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:10.896953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1kxjHnlxvqwkmnw85pbtLnuPe93uUKKWC/9cV2FDI3UNSGm+sJuEi4PLdYu573Lb2Lz8f50ui1Y9A6dc6q0uAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:10.897653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07418","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4aa766f55bd495f30e1f7a4793eb73648df5f182a91f9f3c8e85e39b0de97885","sha256:88dd62098c87503fa998b5b99fcb6b20f4e24d585dfcb796b7367314464e67bb"],"state_sha256":"86281095fbf01a829c06a103475b29add96687ce1da92c36b15c8e71c07aba24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+WAkONXUnHaHX9tv/5ASVP5rW7R14yxp787E4Pg1uyjhwidkZmFmZi5JDEYF6A/SpBMYvIhS4ogiTWFcXNiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:05:28.289406Z","bundle_sha256":"1dbfed1d81f4d073100715dd12fe74c3bf734d1f79d3aee242b6111091f83a47"}}