{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LTTZSHPDYWLTIRGQS5Y7WNNOU6","short_pith_number":"pith:LTTZSHPD","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"},"canonical_sha256":"5ce7991de3c5973444d09771fb35aea7b18f7ada1c314316f63f0d46c703abdd","source":{"kind":"arxiv","id":"1304.2495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2495","created_at":"2026-05-18T03:28:31Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2495v1","created_at":"2026-05-18T03:28:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2495","created_at":"2026-05-18T03:28:31Z"},{"alias_kind":"pith_short_12","alias_value":"LTTZSHPDYWLT","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LTTZSHPDYWLTIRGQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LTTZSHPD","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LTTZSHPDYWLTIRGQS5Y7WNNOU6","target":"record","payload":{"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"},"canonical_sha256":"5ce7991de3c5973444d09771fb35aea7b18f7ada1c314316f63f0d46c703abdd","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"},"source_kind":"arxiv","source_id":"1304.2495","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-05-18T03:28:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RAuK/PBRV1IxCUQjNaJmWb41KlBqBMR5nmn7l2IHqqVDHw+a1wi5Bt4GWKPSBdCsiiwMQEQkCBGgV5vLSTtDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:33:07.543481Z"},"content_sha256":"15e641bac145f6366b8a6906caf14a297113e709eedd2dbbcbf84a8de34a7a60","schema_version":"1.0","event_id":"sha256:15e641bac145f6366b8a6906caf14a297113e709eedd2dbbcbf84a8de34a7a60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LTTZSHPDYWLTIRGQS5Y7WNNOU6","target":"graph","payload":{"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"},"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-05-18T03:28:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWew+axDRW+IIo6+EcDZY5rijjJa6HMS0lWKHGkGrWtLMPmwuWtlxsgyn4rFa86tFTuwB7TcHLYgUNlGfcv6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:33:07.543830Z"},"content_sha256":"db518ffdacab9008b51c29d4870850bbbd83fa0c05114a3d1903a21113fa54a4","schema_version":"1.0","event_id":"sha256:db518ffdacab9008b51c29d4870850bbbd83fa0c05114a3d1903a21113fa54a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/bundle.json","state_url":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/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-06-03T01:33:07Z","links":{"resolver":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6","bundle":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/bundle.json","state":"https://pith.science/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTTZSHPDYWLTIRGQS5Y7WNNOU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LTTZSHPDYWLTIRGQS5Y7WNNOU6","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":"20e07bb26145dc7b5409d98be619019dcde063cd6a67e5fb54778503710f8929","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-09T09:09:53Z","title_canon_sha256":"373aa3a4d314c30fb2fc421c965a7f00893067c7c7b484ab8fff3d3aac6ac1fd"},"schema_version":"1.0","source":{"id":"1304.2495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2495","created_at":"2026-05-18T03:28:31Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2495v1","created_at":"2026-05-18T03:28:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2495","created_at":"2026-05-18T03:28:31Z"},{"alias_kind":"pith_short_12","alias_value":"LTTZSHPDYWLT","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LTTZSHPDYWLTIRGQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LTTZSHPD","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:db518ffdacab9008b51c29d4870850bbbd83fa0c05114a3d1903a21113fa54a4","target":"graph","created_at":"2026-05-18T03:28:31Z","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"},"paper":{"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.","authors_text":"Nestor Parolya, Yaroslav Yeleyko","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-09T09:09:53Z","title":"Killed Markov Decision Processes on Finite Time Interval for Countable Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2495","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:15e641bac145f6366b8a6906caf14a297113e709eedd2dbbcbf84a8de34a7a60","target":"record","created_at":"2026-05-18T03:28:31Z","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":"20e07bb26145dc7b5409d98be619019dcde063cd6a67e5fb54778503710f8929","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-09T09:09:53Z","title_canon_sha256":"373aa3a4d314c30fb2fc421c965a7f00893067c7c7b484ab8fff3d3aac6ac1fd"},"schema_version":"1.0","source":{"id":"1304.2495","kind":"arxiv","version":1}},"canonical_sha256":"5ce7991de3c5973444d09771fb35aea7b18f7ada1c314316f63f0d46c703abdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ce7991de3c5973444d09771fb35aea7b18f7ada1c314316f63f0d46c703abdd","first_computed_at":"2026-05-18T03:28:31.765009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:31.765009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qjUmHnFqup2Ek6djsbd5IYJXSRX55Kl4w2OGWdZxM7/F0ld3lVb+HdlKN5ZNIdO2d/t1R36Z9LJoK6Mx0adJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:31.765788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15e641bac145f6366b8a6906caf14a297113e709eedd2dbbcbf84a8de34a7a60","sha256:db518ffdacab9008b51c29d4870850bbbd83fa0c05114a3d1903a21113fa54a4"],"state_sha256":"c5c98e93a60dc46f389dcb914801fd577f7275803712b1c544726e47d0212ba4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4eUUBbG+B/TbiWtA9kHB7OdYZIcjEuyPNq0PuBfeUmcnSJTpbv5dFGFNBl0LyGBWTMTZgUWXIb+sfw8nUVwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:33:07.545795Z","bundle_sha256":"6650d13269ebc019593cd0e92f37213d78cd95c982a7595bc84531d90d430871"}}