{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MAIVIIDL7TJYJVKR7ABQWOMKZB","short_pith_number":"pith:MAIVIIDL","canonical_record":{"source":{"id":"1503.02244","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-08T04:16:33Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4649dc60bb03bca18eb222ecb5ff202f15522c7f0cdfbd3a64d4c5cce027244b","abstract_canon_sha256":"f8a06742255cc31877caf00b5b996e6b60944906db30dda7935a1e192086924b"},"schema_version":"1.0"},"canonical_sha256":"601154206bfcd384d551f8030b398ac853107dda6e54573d2bc834133fb2a496","source":{"kind":"arxiv","id":"1503.02244","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02244","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02244v3","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02244","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"MAIVIIDL7TJY","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MAIVIIDL7TJYJVKR","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MAIVIIDL","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MAIVIIDL7TJYJVKR7ABQWOMKZB","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02244","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-08T04:16:33Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4649dc60bb03bca18eb222ecb5ff202f15522c7f0cdfbd3a64d4c5cce027244b","abstract_canon_sha256":"f8a06742255cc31877caf00b5b996e6b60944906db30dda7935a1e192086924b"},"schema_version":"1.0"},"canonical_sha256":"601154206bfcd384d551f8030b398ac853107dda6e54573d2bc834133fb2a496","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:05.915236Z","signature_b64":"rU2RGmDRX5TOThq4+uMIs8uIRDWg1VpujijRaZRrRZSVxNgAe6Fd4gkUVhqYlWpskuXn5UIHxjtElSXbKbAtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"601154206bfcd384d551f8030b398ac853107dda6e54573d2bc834133fb2a496","last_reissued_at":"2026-05-18T01:04:05.914826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:05.914826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02244","source_version":3,"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-18T01:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75JtxhOP60ewPv179IJUI+BHi28Z0qSWLBrkZjfPA82PIz87endnIKSpSsLIjsT/Utw91Lp7EuF2kI/r1XjjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:32:50.249413Z"},"content_sha256":"0e16d8ad40bccdc38b463ee9a3ee2266651848bd43acc7b43f4edc097fbc80d2","schema_version":"1.0","event_id":"sha256:0e16d8ad40bccdc38b463ee9a3ee2266651848bd43acc7b43f4edc097fbc80d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MAIVIIDL7TJYJVKR7ABQWOMKZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Naci Saldi, Serdar Y\\\"uksel, Tam\\'as Linder","submitted_at":"2015-03-08T04:16:33Z","abstract_excerpt":"Calculating optimal policies is known to be computationally difficult for Markov decision processes (MDPs) with Borel state and action spaces. This paper studies finite-state approximations of discrete time Markov decision processes with Borel state and action spaces, for both discounted and average costs criteria. The stationary policies thus obtained are shown to approximate the optimal stationary policy with arbitrary precision under quite general conditions for discounted cost and more restrictive conditions for average cost. For compact-state MDPs, we obtain explicit rate of convergence b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02244","kind":"arxiv","version":3},"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-18T01:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DjKjWgs0Uk4DnAn6VCjNn+F9TzX2coBPSDfg6p7yINS+FOfRyTb6JAf0M6tYIvjF6PIeVjSzhlmotu8yyhRiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:32:50.249765Z"},"content_sha256":"8671c48e1e36e1fe6402494b001f88429bedb669d8c6c657656f9b167e05a5c7","schema_version":"1.0","event_id":"sha256:8671c48e1e36e1fe6402494b001f88429bedb669d8c6c657656f9b167e05a5c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAIVIIDL7TJYJVKR7ABQWOMKZB/bundle.json","state_url":"https://pith.science/pith/MAIVIIDL7TJYJVKR7ABQWOMKZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAIVIIDL7TJYJVKR7ABQWOMKZB/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-03T00:32:50Z","links":{"resolver":"https://pith.science/pith/MAIVIIDL7TJYJVKR7ABQWOMKZB","bundle":"https://pith.science/pith/MAIVIIDL7TJYJVKR7ABQWOMKZB/bundle.json","state":"https://pith.science/pith/MAIVIIDL7TJYJVKR7ABQWOMKZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAIVIIDL7TJYJVKR7ABQWOMKZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MAIVIIDL7TJYJVKR7ABQWOMKZB","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":"f8a06742255cc31877caf00b5b996e6b60944906db30dda7935a1e192086924b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-08T04:16:33Z","title_canon_sha256":"4649dc60bb03bca18eb222ecb5ff202f15522c7f0cdfbd3a64d4c5cce027244b"},"schema_version":"1.0","source":{"id":"1503.02244","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02244","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02244v3","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02244","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"MAIVIIDL7TJY","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MAIVIIDL7TJYJVKR","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MAIVIIDL","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:8671c48e1e36e1fe6402494b001f88429bedb669d8c6c657656f9b167e05a5c7","target":"graph","created_at":"2026-05-18T01:04:05Z","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":"Calculating optimal policies is known to be computationally difficult for Markov decision processes (MDPs) with Borel state and action spaces. This paper studies finite-state approximations of discrete time Markov decision processes with Borel state and action spaces, for both discounted and average costs criteria. The stationary policies thus obtained are shown to approximate the optimal stationary policy with arbitrary precision under quite general conditions for discounted cost and more restrictive conditions for average cost. For compact-state MDPs, we obtain explicit rate of convergence b","authors_text":"Naci Saldi, Serdar Y\\\"uksel, Tam\\'as Linder","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-08T04:16:33Z","title":"Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02244","kind":"arxiv","version":3},"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:0e16d8ad40bccdc38b463ee9a3ee2266651848bd43acc7b43f4edc097fbc80d2","target":"record","created_at":"2026-05-18T01:04:05Z","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":"f8a06742255cc31877caf00b5b996e6b60944906db30dda7935a1e192086924b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-08T04:16:33Z","title_canon_sha256":"4649dc60bb03bca18eb222ecb5ff202f15522c7f0cdfbd3a64d4c5cce027244b"},"schema_version":"1.0","source":{"id":"1503.02244","kind":"arxiv","version":3}},"canonical_sha256":"601154206bfcd384d551f8030b398ac853107dda6e54573d2bc834133fb2a496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"601154206bfcd384d551f8030b398ac853107dda6e54573d2bc834133fb2a496","first_computed_at":"2026-05-18T01:04:05.914826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:05.914826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rU2RGmDRX5TOThq4+uMIs8uIRDWg1VpujijRaZRrRZSVxNgAe6Fd4gkUVhqYlWpskuXn5UIHxjtElSXbKbAtAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:05.915236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02244","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e16d8ad40bccdc38b463ee9a3ee2266651848bd43acc7b43f4edc097fbc80d2","sha256:8671c48e1e36e1fe6402494b001f88429bedb669d8c6c657656f9b167e05a5c7"],"state_sha256":"f8fbdc89c761417553d5298ccccbf0b61f6a14dd4d5d904f4d145d8b0932722d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6liJn1tgyo9Ey++caAwoZCSTCvIKNQFtYk37LW8VSkVIAyYfE+tQqawvno6AovpEIaeStbnUyuQuRIgze6DCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:32:50.251736Z","bundle_sha256":"94653b33b210565234cdeb160272b43f1728374e4026b2d9490ed50122972ae5"}}