{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SVIESIIS4IOQWYZOOICGFX6VZN","short_pith_number":"pith:SVIESIIS","schema_version":"1.0","canonical_sha256":"9550492112e21d0b632e720462dfd5cb7031cb00e61998b7d46078ce3d199fbf","source":{"kind":"arxiv","id":"1701.01290","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.01290","created_at":"2026-05-18T00:44:23.863104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01290v3","created_at":"2026-05-18T00:44:23.863104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01290","created_at":"2026-05-18T00:44:23.863104+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVIESIIS4IOQ","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVIESIIS4IOQWYZO","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVIESIIS","created_at":"2026-05-18T12:31:43.269735+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/SVIESIIS4IOQWYZOOICGFX6VZN","json":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN.json","graph_json":"https://pith.science/api/pith-number/SVIESIIS4IOQWYZOOICGFX6VZN/graph.json","events_json":"https://pith.science/api/pith-number/SVIESIIS4IOQWYZOOICGFX6VZN/events.json","paper":"https://pith.science/paper/SVIESIIS"},"agent_actions":{"view_html":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN","download_json":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN.json","view_paper":"https://pith.science/paper/SVIESIIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01290&json=true","fetch_graph":"https://pith.science/api/pith-number/SVIESIIS4IOQWYZOOICGFX6VZN/graph.json","fetch_events":"https://pith.science/api/pith-number/SVIESIIS4IOQWYZOOICGFX6VZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN/action/storage_attestation","attest_author":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN/action/author_attestation","sign_citation":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN/action/citation_signature","submit_replication":"https://pith.science/pith/SVIESIIS4IOQWYZOOICGFX6VZN/action/replication_record"}},"created_at":"2026-05-18T00:44:23.863104+00:00","updated_at":"2026-05-18T00:44:23.863104+00:00"}