{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6WV4JRWKZMK2MRQM5FAXPR5YFX","short_pith_number":"pith:6WV4JRWK","schema_version":"1.0","canonical_sha256":"f5abc4c6cacb15a6460ce94177c7b82dc59c2b5ea5b13bfd0fae1d1a42997287","source":{"kind":"arxiv","id":"1512.00583","version":1},"attestation_state":"computed","paper":{"title":"Central-limit approach to risk-aware Markov decision processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Huan Xu, Jia Yuan Yu, Pengqian Yu","submitted_at":"2015-12-02T05:37:33Z","abstract_excerpt":"Whereas classical Markov decision processes maximize the expected reward, we consider minimizing the risk. We propose to evaluate the risk associated to a given policy over a long-enough time horizon with the help of a central limit theorem. The proposed approach works whether the transition probabilities are known or not. We also provide a gradient-based policy improvement algorithm that converges to a local optimum of the risk objective."},"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":"1512.00583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T05:37:33Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"0cf06dc9bce7beeb1e3e877bd67aba45d846a39a2f395c73a61cd15c3b45fc7a","abstract_canon_sha256":"9219341a022b3924a00cfda253d9488c9e7bbc7691f6e2559a60d87cfd229530"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:25.628392Z","signature_b64":"BOJvrxS6Bdo4YnzjQ7I/8n/8lJ8dDEpxmA1CbcvEuuZi5Gcx/Vv3EoA9kb+rBZBZQ/5lPgtI2mvoPscAzEx9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5abc4c6cacb15a6460ce94177c7b82dc59c2b5ea5b13bfd0fae1d1a42997287","last_reissued_at":"2026-05-18T01:25:25.627814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:25.627814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Central-limit approach to risk-aware Markov decision processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Huan Xu, Jia Yuan Yu, Pengqian Yu","submitted_at":"2015-12-02T05:37:33Z","abstract_excerpt":"Whereas classical Markov decision processes maximize the expected reward, we consider minimizing the risk. We propose to evaluate the risk associated to a given policy over a long-enough time horizon with the help of a central limit theorem. The proposed approach works whether the transition probabilities are known or not. We also provide a gradient-based policy improvement algorithm that converges to a local optimum of the risk objective."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00583","kind":"arxiv","version":1},"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":"1512.00583","created_at":"2026-05-18T01:25:25.627908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.00583v1","created_at":"2026-05-18T01:25:25.627908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00583","created_at":"2026-05-18T01:25:25.627908+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WV4JRWKZMK2","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WV4JRWKZMK2MRQM","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WV4JRWK","created_at":"2026-05-18T12:29:07.941421+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/6WV4JRWKZMK2MRQM5FAXPR5YFX","json":"https://pith.science/pith/6WV4JRWKZMK2MRQM5FAXPR5YFX.json","graph_json":"https://pith.science/api/pith-number/6WV4JRWKZMK2MRQM5FAXPR5YFX/graph.json","events_json":"https://pith.science/api/pith-number/6WV4JRWKZMK2MRQM5FAXPR5YFX/events.json","paper":"https://pith.science/paper/6WV4JRWK"},"agent_actions":{"view_html":"https://pith.science/pith/6WV4JRWKZMK2MRQM5FAXPR5YFX","download_json":"https://pith.science/pith/6WV4JRWKZMK2MRQM5FAXPR5YFX.json","view_paper":"https://pith.science/paper/6WV4JRWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.00583&json=true","fetch_graph":"https://pith.science/api/pith-number/6WV4JRWKZMK2MRQM5FAXPR5YFX/graph.json","fetch_events":"https://pith.science/api/pith-number/6WV4JRWKZMK2MRQM5FAXPR5YFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WV4JRWKZMK2MRQM5FAXPR5YFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WV4JRWKZMK2MRQM5FAXPR5YFX/action/storage_attestation","attest_author":"https://pith.science/pith/6WV4JRWKZMK2MRQM5FAXPR5YFX/action/author_attestation","sign_citation":"https://pith.science/pith/6WV4JRWKZMK2MRQM5FAXPR5YFX/action/citation_signature","submit_replication":"https://pith.science/pith/6WV4JRWKZMK2MRQM5FAXPR5YFX/action/replication_record"}},"created_at":"2026-05-18T01:25:25.627908+00:00","updated_at":"2026-05-18T01:25:25.627908+00:00"}