{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RQCEHJ2YRZZJUOSODD45O6XQDH","short_pith_number":"pith:RQCEHJ2Y","schema_version":"1.0","canonical_sha256":"8c0443a7588e729a3a4e18f9d77af019ff94434ca1cabd48b55c112c68f85bb2","source":{"kind":"arxiv","id":"2505.24815","version":1},"attestation_state":"computed","paper":{"title":"Convex Approximations of Random Constrained Markov Decision Processes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Abdel Lisser, Vikas Vikram Singh, V Varagapriya","submitted_at":"2025-05-30T17:18:34Z","abstract_excerpt":"Constrained Markov decision processes (CMDPs) are used as a decision-making framework to study the long-run performance of a stochastic system. It is well-known that a stationary optimal policy of a CMDP problem under discounted cost criterion can be obtained by solving a linear programming problem when running costs and transition probabilities are exactly known. In this paper, we consider a discounted cost CMDP problem where the running costs and transition probabilities are defined using random variables. Consequently, both the objective function and constraints become random. We use chance"},"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":"2505.24815","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-30T17:18:34Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"167eb528a213bd22f3b30ed9548e04266f48aa0476131b913226cea8c0547d7c","abstract_canon_sha256":"3e254f34c5167951e5b5143a6463cc375b4c054946881f4e80f66d8259c02b4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:57.232914Z","signature_b64":"mgTkK2whjFpWMXDfMMnYp4eAnFkD5Dy962cGvn5+1wnMeWqfFyYkbtJRfrKR7Y4pmlUvNOicCtflKx8Z/BRMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c0443a7588e729a3a4e18f9d77af019ff94434ca1cabd48b55c112c68f85bb2","last_reissued_at":"2026-07-05T11:12:57.232407Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:57.232407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Approximations of Random Constrained Markov Decision Processes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Abdel Lisser, Vikas Vikram Singh, V Varagapriya","submitted_at":"2025-05-30T17:18:34Z","abstract_excerpt":"Constrained Markov decision processes (CMDPs) are used as a decision-making framework to study the long-run performance of a stochastic system. It is well-known that a stationary optimal policy of a CMDP problem under discounted cost criterion can be obtained by solving a linear programming problem when running costs and transition probabilities are exactly known. In this paper, we consider a discounted cost CMDP problem where the running costs and transition probabilities are defined using random variables. Consequently, both the objective function and constraints become random. We use chance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24815","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.24815/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.24815","created_at":"2026-07-05T11:12:57.232477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24815v1","created_at":"2026-07-05T11:12:57.232477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24815","created_at":"2026-07-05T11:12:57.232477+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQCEHJ2YRZZJ","created_at":"2026-07-05T11:12:57.232477+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQCEHJ2YRZZJUOSO","created_at":"2026-07-05T11:12:57.232477+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQCEHJ2Y","created_at":"2026-07-05T11:12:57.232477+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/RQCEHJ2YRZZJUOSODD45O6XQDH","json":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH.json","graph_json":"https://pith.science/api/pith-number/RQCEHJ2YRZZJUOSODD45O6XQDH/graph.json","events_json":"https://pith.science/api/pith-number/RQCEHJ2YRZZJUOSODD45O6XQDH/events.json","paper":"https://pith.science/paper/RQCEHJ2Y"},"agent_actions":{"view_html":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH","download_json":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH.json","view_paper":"https://pith.science/paper/RQCEHJ2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24815&json=true","fetch_graph":"https://pith.science/api/pith-number/RQCEHJ2YRZZJUOSODD45O6XQDH/graph.json","fetch_events":"https://pith.science/api/pith-number/RQCEHJ2YRZZJUOSODD45O6XQDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/action/storage_attestation","attest_author":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/action/author_attestation","sign_citation":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/action/citation_signature","submit_replication":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/action/replication_record"}},"created_at":"2026-07-05T11:12:57.232477+00:00","updated_at":"2026-07-05T11:12:57.232477+00:00"}