{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R7LZNVGP6BTVRIAFY33HILXLV6","short_pith_number":"pith:R7LZNVGP","schema_version":"1.0","canonical_sha256":"8fd796d4cff06758a005c6f6742eebafaf288c0ebd43b8e7f12cf24914632654","source":{"kind":"arxiv","id":"1501.02518","version":4},"attestation_state":"computed","paper":{"title":"Controlled Markov Chains with AVaR Criteria for Unbounded Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Kerem Ugurlu","submitted_at":"2015-01-12T01:18:38Z","abstract_excerpt":"In this paper, we consider the control problem with the Average-Value-at-Risk (AVaR) criteria of the possibly unbounded $L^{1}$-costs in infinite horizon on a Markov Decision Process (MDP). With a suitable state aggregation and by choosing a priori a global variable $s$ heuristically, we show that there exist optimal policies for the infinite horizon problem. To our knowledge, this is the first work of deriving dynamic programming equations with $L^1$-unbounded costs via AVaR-operator."},"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":"1501.02518","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-12T01:18:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a5d8150ca179dbcdffab0954e5014a9e29ff834892f5403c3612e7939293ac31","abstract_canon_sha256":"64becb570f36a1ab9afa7c4a9135c22642da6e83995ad8ce7c70573e0f037fad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:50.415077Z","signature_b64":"bxVcteiAvNGle9GXRkLhVLaJgXbINDMsUkyAakijZw3e4DhaDAT1hzZH/XqVogcoHmL9ZtPxVfrukxp9eFugCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd796d4cff06758a005c6f6742eebafaf288c0ebd43b8e7f12cf24914632654","last_reissued_at":"2026-05-18T01:26:50.414400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:50.414400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controlled Markov Chains with AVaR Criteria for Unbounded Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Kerem Ugurlu","submitted_at":"2015-01-12T01:18:38Z","abstract_excerpt":"In this paper, we consider the control problem with the Average-Value-at-Risk (AVaR) criteria of the possibly unbounded $L^{1}$-costs in infinite horizon on a Markov Decision Process (MDP). With a suitable state aggregation and by choosing a priori a global variable $s$ heuristically, we show that there exist optimal policies for the infinite horizon problem. To our knowledge, this is the first work of deriving dynamic programming equations with $L^1$-unbounded costs via AVaR-operator."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02518","kind":"arxiv","version":4},"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":"1501.02518","created_at":"2026-05-18T01:26:50.414527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02518v4","created_at":"2026-05-18T01:26:50.414527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02518","created_at":"2026-05-18T01:26:50.414527+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7LZNVGP6BTV","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7LZNVGP6BTVRIAF","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7LZNVGP","created_at":"2026-05-18T12:29:39.896362+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/R7LZNVGP6BTVRIAFY33HILXLV6","json":"https://pith.science/pith/R7LZNVGP6BTVRIAFY33HILXLV6.json","graph_json":"https://pith.science/api/pith-number/R7LZNVGP6BTVRIAFY33HILXLV6/graph.json","events_json":"https://pith.science/api/pith-number/R7LZNVGP6BTVRIAFY33HILXLV6/events.json","paper":"https://pith.science/paper/R7LZNVGP"},"agent_actions":{"view_html":"https://pith.science/pith/R7LZNVGP6BTVRIAFY33HILXLV6","download_json":"https://pith.science/pith/R7LZNVGP6BTVRIAFY33HILXLV6.json","view_paper":"https://pith.science/paper/R7LZNVGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02518&json=true","fetch_graph":"https://pith.science/api/pith-number/R7LZNVGP6BTVRIAFY33HILXLV6/graph.json","fetch_events":"https://pith.science/api/pith-number/R7LZNVGP6BTVRIAFY33HILXLV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7LZNVGP6BTVRIAFY33HILXLV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7LZNVGP6BTVRIAFY33HILXLV6/action/storage_attestation","attest_author":"https://pith.science/pith/R7LZNVGP6BTVRIAFY33HILXLV6/action/author_attestation","sign_citation":"https://pith.science/pith/R7LZNVGP6BTVRIAFY33HILXLV6/action/citation_signature","submit_replication":"https://pith.science/pith/R7LZNVGP6BTVRIAFY33HILXLV6/action/replication_record"}},"created_at":"2026-05-18T01:26:50.414527+00:00","updated_at":"2026-05-18T01:26:50.414527+00:00"}