{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:H5PJHXZS7BVP4YUKP6THACAMUI","short_pith_number":"pith:H5PJHXZS","canonical_record":{"source":{"id":"2103.09295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-03-16T19:35:45Z","cross_cats_sorted":[],"title_canon_sha256":"f0197ff31796827a29cb8a1ccc1a936f551a03aa06364a980d3936d41dd237a5","abstract_canon_sha256":"8bddb4bd1ebffa7a6a96694e79b1d5c37578e0e8b02ba34f6c4d1f4251040b79"},"schema_version":"1.0"},"canonical_sha256":"3f5e93df32f86afe628a7fa670080ca2257c9d183dcdd5b528643fd5f777846d","source":{"kind":"arxiv","id":"2103.09295","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.09295","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2103.09295v1","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09295","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"H5PJHXZS7BVP","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"H5PJHXZS7BVP4YUK","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"H5PJHXZS","created_at":"2026-07-05T02:24:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:H5PJHXZS7BVP4YUKP6THACAMUI","target":"record","payload":{"canonical_record":{"source":{"id":"2103.09295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-03-16T19:35:45Z","cross_cats_sorted":[],"title_canon_sha256":"f0197ff31796827a29cb8a1ccc1a936f551a03aa06364a980d3936d41dd237a5","abstract_canon_sha256":"8bddb4bd1ebffa7a6a96694e79b1d5c37578e0e8b02ba34f6c4d1f4251040b79"},"schema_version":"1.0"},"canonical_sha256":"3f5e93df32f86afe628a7fa670080ca2257c9d183dcdd5b528643fd5f777846d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:02.459755Z","signature_b64":"yXkeEdp17gj60lk61Y5RCW2UNrbiZN5J4npWMhMhQk8FF/crYLi6QZV+uBG93jPp33ckEcR5S5TUWwPY4o8TAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f5e93df32f86afe628a7fa670080ca2257c9d183dcdd5b528643fd5f777846d","last_reissued_at":"2026-07-05T02:24:02.459386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:02.459386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.09295","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-05T02:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OyhCVeAqA4xb5hSjbwWJtXBm9CrggKeofJ39OcX5hHbWnrsuko2Tk8RV6LQby9Wp3Kv+Sf3UsrfcuCJjipLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-29T02:27:07.254328Z"},"content_sha256":"872e8c48b20f3dd08b535230f87ea1653d680f465d406b799ccd332db18520d4","schema_version":"1.0","event_id":"sha256:872e8c48b20f3dd08b535230f87ea1653d680f465d406b799ccd332db18520d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:H5PJHXZS7BVP4YUKP6THACAMUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Minimizing Total Discounted Cost in MDPs Subject to Reachability Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos K. Verginis, Michael Hibbard, Ufuk Topcu, Yagiz Savas","submitted_at":"2021-03-16T19:35:45Z","abstract_excerpt":"We study the synthesis of a policy in a Markov decision process (MDP) following which an agent reaches a target state in the MDP while minimizing its total discounted cost. The problem combines a reachability criterion with a discounted cost criterion and naturally expresses the completion of a task with probabilistic guarantees and optimal transient performance. We first establish that an optimal policy for the considered formulation may not exist but that there always exists a near-optimal stationary policy. We additionally provide a necessary and sufficient condition for the existence of an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09295","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/2103.09295/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-05T02:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xTeM+2GhHGhEU59w7LHQNLvHKAh/tr/upDPhfs9ibEQPBus2gRBAph4B+2EZjdakd7EvPqzGytEk4kBjZ2yDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-29T02:27:07.254730Z"},"content_sha256":"a72eb012a8a6a1335852c3709667b2179cacee0965294ce3e33ca5da3afb5b93","schema_version":"1.0","event_id":"sha256:a72eb012a8a6a1335852c3709667b2179cacee0965294ce3e33ca5da3afb5b93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5PJHXZS7BVP4YUKP6THACAMUI/bundle.json","state_url":"https://pith.science/pith/H5PJHXZS7BVP4YUKP6THACAMUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5PJHXZS7BVP4YUKP6THACAMUI/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-07-29T02:27:07Z","links":{"resolver":"https://pith.science/pith/H5PJHXZS7BVP4YUKP6THACAMUI","bundle":"https://pith.science/pith/H5PJHXZS7BVP4YUKP6THACAMUI/bundle.json","state":"https://pith.science/pith/H5PJHXZS7BVP4YUKP6THACAMUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5PJHXZS7BVP4YUKP6THACAMUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:H5PJHXZS7BVP4YUKP6THACAMUI","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":"8bddb4bd1ebffa7a6a96694e79b1d5c37578e0e8b02ba34f6c4d1f4251040b79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-03-16T19:35:45Z","title_canon_sha256":"f0197ff31796827a29cb8a1ccc1a936f551a03aa06364a980d3936d41dd237a5"},"schema_version":"1.0","source":{"id":"2103.09295","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.09295","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2103.09295v1","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09295","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"H5PJHXZS7BVP","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"H5PJHXZS7BVP4YUK","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"H5PJHXZS","created_at":"2026-07-05T02:24:02Z"}],"graph_snapshots":[{"event_id":"sha256:a72eb012a8a6a1335852c3709667b2179cacee0965294ce3e33ca5da3afb5b93","target":"graph","created_at":"2026-07-05T02:24:02Z","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/2103.09295/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the synthesis of a policy in a Markov decision process (MDP) following which an agent reaches a target state in the MDP while minimizing its total discounted cost. The problem combines a reachability criterion with a discounted cost criterion and naturally expresses the completion of a task with probabilistic guarantees and optimal transient performance. We first establish that an optimal policy for the considered formulation may not exist but that there always exists a near-optimal stationary policy. We additionally provide a necessary and sufficient condition for the existence of an","authors_text":"Christos K. Verginis, Michael Hibbard, Ufuk Topcu, Yagiz Savas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-03-16T19:35:45Z","title":"On Minimizing Total Discounted Cost in MDPs Subject to Reachability Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09295","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:872e8c48b20f3dd08b535230f87ea1653d680f465d406b799ccd332db18520d4","target":"record","created_at":"2026-07-05T02:24:02Z","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":"8bddb4bd1ebffa7a6a96694e79b1d5c37578e0e8b02ba34f6c4d1f4251040b79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-03-16T19:35:45Z","title_canon_sha256":"f0197ff31796827a29cb8a1ccc1a936f551a03aa06364a980d3936d41dd237a5"},"schema_version":"1.0","source":{"id":"2103.09295","kind":"arxiv","version":1}},"canonical_sha256":"3f5e93df32f86afe628a7fa670080ca2257c9d183dcdd5b528643fd5f777846d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f5e93df32f86afe628a7fa670080ca2257c9d183dcdd5b528643fd5f777846d","first_computed_at":"2026-07-05T02:24:02.459386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:24:02.459386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yXkeEdp17gj60lk61Y5RCW2UNrbiZN5J4npWMhMhQk8FF/crYLi6QZV+uBG93jPp33ckEcR5S5TUWwPY4o8TAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:24:02.459755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.09295","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:872e8c48b20f3dd08b535230f87ea1653d680f465d406b799ccd332db18520d4","sha256:a72eb012a8a6a1335852c3709667b2179cacee0965294ce3e33ca5da3afb5b93"],"state_sha256":"48611c6e1b91041a098e82b99cdfb9d907e382e3e248f39d4e01a7916cf7e288"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fERthhEdEMhvidgAxJ5gc8EabcuHF23t3qr4p2t2+VI4Y9GFKlktbD2DeWGlVOw2lyHoaggxbXgsTpPBXIFqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-29T02:27:07.258308Z","bundle_sha256":"aa606e097556c969e2d9876b4b377d7d7bc004d711d58b900a158c808c416cb8"}}