{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RQCEHJ2YRZZJUOSODD45O6XQDH","short_pith_number":"pith:RQCEHJ2Y","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"},"canonical_sha256":"8c0443a7588e729a3a4e18f9d77af019ff94434ca1cabd48b55c112c68f85bb2","source":{"kind":"arxiv","id":"2505.24815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24815","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24815v1","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24815","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"RQCEHJ2YRZZJ","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"pith_short_16","alias_value":"RQCEHJ2YRZZJUOSO","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"pith_short_8","alias_value":"RQCEHJ2Y","created_at":"2026-07-05T11:12:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RQCEHJ2YRZZJUOSODD45O6XQDH","target":"record","payload":{"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"},"canonical_sha256":"8c0443a7588e729a3a4e18f9d77af019ff94434ca1cabd48b55c112c68f85bb2","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"},"source_kind":"arxiv","source_id":"2505.24815","source_version":1,"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-07-05T11:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azOn5DoslrVM2NofjPxTBFZG0EJtVKldCIGFNZUMNduz+2IM7BbX/j3Q6Cc2Fj/y7YKq5DFfDde/VMCJfZSBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:53:56.379566Z"},"content_sha256":"f26d39034ca49dd33dddc031f11e89defb48a8dd7c28aff129946d79ca2014a3","schema_version":"1.0","event_id":"sha256:f26d39034ca49dd33dddc031f11e89defb48a8dd7c28aff129946d79ca2014a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RQCEHJ2YRZZJUOSODD45O6XQDH","target":"graph","payload":{"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"},"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-07-05T11:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bASUrQEjIT9tzTNYAe+iMuhbeFmZRMSzkyqg45IVLerKvg3X7i9h8q9XjWJVTSZQj+QlWi2TvAUXa0aiK7FXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:53:56.380462Z"},"content_sha256":"b7d1202e303d4c128e43b9a4b2904081d45e59e3ae97076c094d7ad1fead9e30","schema_version":"1.0","event_id":"sha256:b7d1202e303d4c128e43b9a4b2904081d45e59e3ae97076c094d7ad1fead9e30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/bundle.json","state_url":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/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-08-08T12:53:56Z","links":{"resolver":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH","bundle":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/bundle.json","state":"https://pith.science/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQCEHJ2YRZZJUOSODD45O6XQDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RQCEHJ2YRZZJUOSODD45O6XQDH","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":"3e254f34c5167951e5b5143a6463cc375b4c054946881f4e80f66d8259c02b4a","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-30T17:18:34Z","title_canon_sha256":"167eb528a213bd22f3b30ed9548e04266f48aa0476131b913226cea8c0547d7c"},"schema_version":"1.0","source":{"id":"2505.24815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24815","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24815v1","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24815","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"RQCEHJ2YRZZJ","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"pith_short_16","alias_value":"RQCEHJ2YRZZJUOSO","created_at":"2026-07-05T11:12:57Z"},{"alias_kind":"pith_short_8","alias_value":"RQCEHJ2Y","created_at":"2026-07-05T11:12:57Z"}],"graph_snapshots":[{"event_id":"sha256:b7d1202e303d4c128e43b9a4b2904081d45e59e3ae97076c094d7ad1fead9e30","target":"graph","created_at":"2026-07-05T11:12:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.24815/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Abdel Lisser, Vikas Vikram Singh, V Varagapriya","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-30T17:18:34Z","title":"Convex Approximations of Random Constrained Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24815","kind":"arxiv","version":1},"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:f26d39034ca49dd33dddc031f11e89defb48a8dd7c28aff129946d79ca2014a3","target":"record","created_at":"2026-07-05T11:12:57Z","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":"3e254f34c5167951e5b5143a6463cc375b4c054946881f4e80f66d8259c02b4a","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-30T17:18:34Z","title_canon_sha256":"167eb528a213bd22f3b30ed9548e04266f48aa0476131b913226cea8c0547d7c"},"schema_version":"1.0","source":{"id":"2505.24815","kind":"arxiv","version":1}},"canonical_sha256":"8c0443a7588e729a3a4e18f9d77af019ff94434ca1cabd48b55c112c68f85bb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c0443a7588e729a3a4e18f9d77af019ff94434ca1cabd48b55c112c68f85bb2","first_computed_at":"2026-07-05T11:12:57.232407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:12:57.232407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mgTkK2whjFpWMXDfMMnYp4eAnFkD5Dy962cGvn5+1wnMeWqfFyYkbtJRfrKR7Y4pmlUvNOicCtflKx8Z/BRMDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:12:57.232914Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.24815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f26d39034ca49dd33dddc031f11e89defb48a8dd7c28aff129946d79ca2014a3","sha256:b7d1202e303d4c128e43b9a4b2904081d45e59e3ae97076c094d7ad1fead9e30"],"state_sha256":"8ddaf9ba23f5202604000c833843f5f396f92794697320610062750db0d33200"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+vFcJi/SbI8Q/LRB/akbH0/717H9sfIeqQvLNcoaTVpoxJZt4sMI4GLyRGIGO+2qo+QqBWBQT0m02tKreElAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:53:56.385894Z","bundle_sha256":"107b69595abf4f96cb76e4a615e21bb2dc0921e3787aa22f9f0271e37b60730e"}}