{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SVIESIIS4IOQWYZOOICGFX6VZN","short_pith_number":"pith:SVIESIIS","canonical_record":{"source":{"id":"1701.01290","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-01-05T12:10:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8dddc8498606052196a90ce4239fd25a4f5ddc5b44a52167c165ab483310b568","abstract_canon_sha256":"955ac420e2912f97b9efd2cd68f00cfd66f276f41e9e055e3f98807dae9df2b5"},"schema_version":"1.0"},"canonical_sha256":"9550492112e21d0b632e720462dfd5cb7031cb00e61998b7d46078ce3d199fbf","source":{"kind":"arxiv","id":"1701.01290","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01290","created_at":"2026-05-18T00:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01290v3","created_at":"2026-05-18T00:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01290","created_at":"2026-05-18T00:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"SVIESIIS4IOQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SVIESIIS4IOQWYZO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SVIESIIS","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SVIESIIS4IOQWYZOOICGFX6VZN","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01290","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-01-05T12:10:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8dddc8498606052196a90ce4239fd25a4f5ddc5b44a52167c165ab483310b568","abstract_canon_sha256":"955ac420e2912f97b9efd2cd68f00cfd66f276f41e9e055e3f98807dae9df2b5"},"schema_version":"1.0"},"canonical_sha256":"9550492112e21d0b632e720462dfd5cb7031cb00e61998b7d46078ce3d199fbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:23.863502Z","signature_b64":"wzN0l58f+Z64mu/YNp+DgsagYyWSG9rvwWqKXDfqIMkkRIOKD4oYeO7w+cYCl+GXGm+0WVnpSql/ASE45ArpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9550492112e21d0b632e720462dfd5cb7031cb00e61998b7d46078ce3d199fbf","last_reissued_at":"2026-05-18T00:44:23.863033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:23.863033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01290","source_version":3,"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:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fPq41Abxpn4AqZSZTTHIGYYbfQmGJyuSBqEfYo3mmTran+Kckop8EAvv0HCKSlcapwAHEgONGn555mMXPEE3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:27:01.526658Z"},"content_sha256":"52cd633ae641f4faf7c16d656eb6ad9e200d24c2d6ae86d1f109a7e1f59c3aa8","schema_version":"1.0","event_id":"sha256:52cd633ae641f4faf7c16d656eb6ad9e200d24c2d6ae86d1f109a7e1f59c3aa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SVIESIIS4IOQWYZOOICGFX6VZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Value Iteration for Risk-aware 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, William B. Haskell","submitted_at":"2017-01-05T12:10:26Z","abstract_excerpt":"We consider large-scale Markov decision processes (MDPs) with a risk measure of variability in cost, under the risk-aware MDPs paradigm. Previous studies showed that risk-aware MDPs, based on a minimax approach to handling risk, can be solved using dynamic programming for small to medium sized problems. However, due to the \"curse of dimensionality\", MDPs that model real-life problems are typically prohibitively large for such approaches. In this paper, we employ an approximate dynamic programming approach, and develop a family of simulation-based algorithms to approximately solve large-scale r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01290","kind":"arxiv","version":3},"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:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXlOticEw2OQXSdul+XXXZXHmWq9kWGtfE9K4N5PL5rcQjei2g645+SiK7r1eFV3Db0Wat9JgbkYmxf1I1jNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:27:01.527006Z"},"content_sha256":"1921b43206f728e296e07196d3f9bb51c26de17b76e256da6bba29b992605338","schema_version":"1.0","event_id":"sha256:1921b43206f728e296e07196d3f9bb51c26de17b76e256da6bba29b992605338"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN/bundle.json","state_url":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVIESIIS4IOQWYZOOICGFX6VZN/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-28T03:27:01Z","links":{"resolver":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN","bundle":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN/bundle.json","state":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVIESIIS4IOQWYZOOICGFX6VZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SVIESIIS4IOQWYZOOICGFX6VZN","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":"955ac420e2912f97b9efd2cd68f00cfd66f276f41e9e055e3f98807dae9df2b5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-01-05T12:10:26Z","title_canon_sha256":"8dddc8498606052196a90ce4239fd25a4f5ddc5b44a52167c165ab483310b568"},"schema_version":"1.0","source":{"id":"1701.01290","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01290","created_at":"2026-05-18T00:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01290v3","created_at":"2026-05-18T00:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01290","created_at":"2026-05-18T00:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"SVIESIIS4IOQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SVIESIIS4IOQWYZO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SVIESIIS","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:1921b43206f728e296e07196d3f9bb51c26de17b76e256da6bba29b992605338","target":"graph","created_at":"2026-05-18T00:44:23Z","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 consider large-scale Markov decision processes (MDPs) with a risk measure of variability in cost, under the risk-aware MDPs paradigm. Previous studies showed that risk-aware MDPs, based on a minimax approach to handling risk, can be solved using dynamic programming for small to medium sized problems. However, due to the \"curse of dimensionality\", MDPs that model real-life problems are typically prohibitively large for such approaches. In this paper, we employ an approximate dynamic programming approach, and develop a family of simulation-based algorithms to approximately solve large-scale r","authors_text":"Huan Xu, Pengqian Yu, William B. Haskell","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-01-05T12:10:26Z","title":"Approximate Value Iteration for Risk-aware Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01290","kind":"arxiv","version":3},"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:52cd633ae641f4faf7c16d656eb6ad9e200d24c2d6ae86d1f109a7e1f59c3aa8","target":"record","created_at":"2026-05-18T00:44:23Z","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":"955ac420e2912f97b9efd2cd68f00cfd66f276f41e9e055e3f98807dae9df2b5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-01-05T12:10:26Z","title_canon_sha256":"8dddc8498606052196a90ce4239fd25a4f5ddc5b44a52167c165ab483310b568"},"schema_version":"1.0","source":{"id":"1701.01290","kind":"arxiv","version":3}},"canonical_sha256":"9550492112e21d0b632e720462dfd5cb7031cb00e61998b7d46078ce3d199fbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9550492112e21d0b632e720462dfd5cb7031cb00e61998b7d46078ce3d199fbf","first_computed_at":"2026-05-18T00:44:23.863033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:23.863033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wzN0l58f+Z64mu/YNp+DgsagYyWSG9rvwWqKXDfqIMkkRIOKD4oYeO7w+cYCl+GXGm+0WVnpSql/ASE45ArpCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:23.863502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01290","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52cd633ae641f4faf7c16d656eb6ad9e200d24c2d6ae86d1f109a7e1f59c3aa8","sha256:1921b43206f728e296e07196d3f9bb51c26de17b76e256da6bba29b992605338"],"state_sha256":"ffe379b58d327ce297cf78b2c42cbd83a1c0eea5bd932460e8409cd9009c826a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzF/FaK8tNPpPeq8KpkqUYUr+OXDkojvBWzQ8ltzw+8wQEB0P1tw4m6WMWk5z4xEB/AfFRFcSySmr336CqSoBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:27:01.529079Z","bundle_sha256":"ce1e1fbee57add6d0a82b716126d5a6019c79e73f803ff392653d3fe0a63e3f8"}}