{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LTTZSHPDYWLTIRGQS5Y7WNNOU6","short_pith_number":"pith:LTTZSHPD","schema_version":"1.0","canonical_sha256":"5ce7991de3c5973444d09771fb35aea7b18f7ada1c314316f63f0d46c703abdd","source":{"kind":"arxiv","id":"1304.2495","version":1},"attestation_state":"computed","paper":{"title":"Killed Markov Decision Processes on Finite Time Interval for Countable Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Nestor Parolya, Yaroslav Yeleyko","submitted_at":"2013-04-09T09:09:53Z","abstract_excerpt":"We consider killed Markov decision processes for countable models on a finite time-interval. Existence of a uniform $\\varepsilon$-optimal policy is proven. We show the correctness of the fundamental equation. The optimal control problem is reduced to a similar problem for the derived model. We receive an optimality equation and a method for the construction of simple optimal policies. The sufficiency of simple policies for countable models is proven. We show the correctness of the Markovian property. Additionally, a dynamic programming principle is considered."},"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":"1304.2495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-09T09:09:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"373aa3a4d314c30fb2fc421c965a7f00893067c7c7b484ab8fff3d3aac6ac1fd","abstract_canon_sha256":"20e07bb26145dc7b5409d98be619019dcde063cd6a67e5fb54778503710f8929"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:31.765788Z","signature_b64":"qjUmHnFqup2Ek6djsbd5IYJXSRX55Kl4w2OGWdZxM7/F0ld3lVb+HdlKN5ZNIdO2d/t1R36Z9LJoK6Mx0adJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ce7991de3c5973444d09771fb35aea7b18f7ada1c314316f63f0d46c703abdd","last_reissued_at":"2026-05-18T03:28:31.765009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:31.765009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Killed Markov Decision Processes on Finite Time Interval for Countable Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Nestor Parolya, Yaroslav Yeleyko","submitted_at":"2013-04-09T09:09:53Z","abstract_excerpt":"We consider killed Markov decision processes for countable models on a finite time-interval. Existence of a uniform $\\varepsilon$-optimal policy is proven. We show the correctness of the fundamental equation. The optimal control problem is reduced to a similar problem for the derived model. We receive an optimality equation and a method for the construction of simple optimal policies. The sufficiency of simple policies for countable models is proven. We show the correctness of the Markovian property. Additionally, a dynamic programming principle is considered."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2495","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":"1304.2495","created_at":"2026-05-18T03:28:31.765120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2495v1","created_at":"2026-05-18T03:28:31.765120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2495","created_at":"2026-05-18T03:28:31.765120+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTTZSHPDYWLT","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTTZSHPDYWLTIRGQ","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTTZSHPD","created_at":"2026-05-18T12:27:51.066281+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/LTTZSHPDYWLTIRGQS5Y7WNNOU6","json":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6.json","graph_json":"https://pith.science/api/pith-number/LTTZSHPDYWLTIRGQS5Y7WNNOU6/graph.json","events_json":"https://pith.science/api/pith-number/LTTZSHPDYWLTIRGQS5Y7WNNOU6/events.json","paper":"https://pith.science/paper/LTTZSHPD"},"agent_actions":{"view_html":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6","download_json":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6.json","view_paper":"https://pith.science/paper/LTTZSHPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2495&json=true","fetch_graph":"https://pith.science/api/pith-number/LTTZSHPDYWLTIRGQS5Y7WNNOU6/graph.json","fetch_events":"https://pith.science/api/pith-number/LTTZSHPDYWLTIRGQS5Y7WNNOU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/action/storage_attestation","attest_author":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/action/author_attestation","sign_citation":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/action/citation_signature","submit_replication":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/action/replication_record"}},"created_at":"2026-05-18T03:28:31.765120+00:00","updated_at":"2026-05-18T03:28:31.765120+00:00"}