{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:STAWRF4U66Y7MZA6DAXKCENGH2","short_pith_number":"pith:STAWRF4U","canonical_record":{"source":{"id":"1410.6985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-26T04:25:26Z","cross_cats_sorted":[],"title_canon_sha256":"9aaf05c1326ea2fba3881abf9fa8949f2634ff6a712129d4e091bba25db4a463","abstract_canon_sha256":"0a2fffafbe9ebd0f84443829ff760b3de718eaae0587bf9a59c1d2477dc45cd5"},"schema_version":"1.0"},"canonical_sha256":"94c1689794f7b1f6641e182ea111a63eba299ae51da2073ca34305a25308da33","source":{"kind":"arxiv","id":"1410.6985","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6985","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6985v2","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6985","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"STAWRF4U66Y7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"STAWRF4U66Y7MZA6","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"STAWRF4U","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:STAWRF4U66Y7MZA6DAXKCENGH2","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-26T04:25:26Z","cross_cats_sorted":[],"title_canon_sha256":"9aaf05c1326ea2fba3881abf9fa8949f2634ff6a712129d4e091bba25db4a463","abstract_canon_sha256":"0a2fffafbe9ebd0f84443829ff760b3de718eaae0587bf9a59c1d2477dc45cd5"},"schema_version":"1.0"},"canonical_sha256":"94c1689794f7b1f6641e182ea111a63eba299ae51da2073ca34305a25308da33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:11.222025Z","signature_b64":"Kzws0777AW1HY1GbFsvtuCljzNJm20qoeJP56hJgFzHE9B/fhnrXemi6zWuCrmIiszHTFDnTyMLW3OzK6VQwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94c1689794f7b1f6641e182ea111a63eba299ae51da2073ca34305a25308da33","last_reissued_at":"2026-05-18T02:12:11.221231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:11.221231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6985","source_version":2,"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-18T02:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9psgXJ2XGUR02l0oWQ0WpGN8cufMiJHMLAlXfH0AYyb+/OpLzQsdvQK77PcBZeRl/GUho17kQPCPpYaxiUvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:26:19.305955Z"},"content_sha256":"808a5fb240666697a9050f8349f0edbcda5d268eed93a94e2d3d31ecec3fb53d","schema_version":"1.0","event_id":"sha256:808a5fb240666697a9050f8349f0edbcda5d268eed93a94e2d3d31ecec3fb53d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:STAWRF4U66Y7MZA6DAXKCENGH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near Optimality of Quantized Policies in Stochastic Control Under Weak Continuity Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Naci Saldi, Serdar Y\\\"uksel, Tam\\'as Linder","submitted_at":"2014-10-26T04:25:26Z","abstract_excerpt":"This paper studies the approximation of optimal control policies by quantized (discretized) policies for a very general class of Markov decision processes (MDPs). The problem is motivated by applications in networked control systems, computational methods for MDPs, and learning algorithms for MDPs. We consider the finite-action approximation of stationary policies for a discrete-time Markov decision process with discounted and average costs under a weak continuity assumption on the transition probability, which is a significant relaxation of conditions required in earlier literature. The discr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6985","kind":"arxiv","version":2},"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-18T02:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gtgty3SDQyNCWFmr7ogMPfv0D4PuiXeFcRlRJqBuy0yYsc2PV0jfqfX/t5X9E1d3hSFh9msYdFvcZkB7fJeVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:26:19.306308Z"},"content_sha256":"6efbfd9a560fa7aff4bc006b222b14d4cbe2379b6dfcf4f664f50cae187a9a85","schema_version":"1.0","event_id":"sha256:6efbfd9a560fa7aff4bc006b222b14d4cbe2379b6dfcf4f664f50cae187a9a85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STAWRF4U66Y7MZA6DAXKCENGH2/bundle.json","state_url":"https://pith.science/pith/STAWRF4U66Y7MZA6DAXKCENGH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STAWRF4U66Y7MZA6DAXKCENGH2/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-02T20:26:19Z","links":{"resolver":"https://pith.science/pith/STAWRF4U66Y7MZA6DAXKCENGH2","bundle":"https://pith.science/pith/STAWRF4U66Y7MZA6DAXKCENGH2/bundle.json","state":"https://pith.science/pith/STAWRF4U66Y7MZA6DAXKCENGH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STAWRF4U66Y7MZA6DAXKCENGH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:STAWRF4U66Y7MZA6DAXKCENGH2","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":"0a2fffafbe9ebd0f84443829ff760b3de718eaae0587bf9a59c1d2477dc45cd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-26T04:25:26Z","title_canon_sha256":"9aaf05c1326ea2fba3881abf9fa8949f2634ff6a712129d4e091bba25db4a463"},"schema_version":"1.0","source":{"id":"1410.6985","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6985","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6985v2","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6985","created_at":"2026-05-18T02:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"STAWRF4U66Y7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"STAWRF4U66Y7MZA6","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"STAWRF4U","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:6efbfd9a560fa7aff4bc006b222b14d4cbe2379b6dfcf4f664f50cae187a9a85","target":"graph","created_at":"2026-05-18T02:12:11Z","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":"This paper studies the approximation of optimal control policies by quantized (discretized) policies for a very general class of Markov decision processes (MDPs). The problem is motivated by applications in networked control systems, computational methods for MDPs, and learning algorithms for MDPs. We consider the finite-action approximation of stationary policies for a discrete-time Markov decision process with discounted and average costs under a weak continuity assumption on the transition probability, which is a significant relaxation of conditions required in earlier literature. The discr","authors_text":"Naci Saldi, Serdar Y\\\"uksel, Tam\\'as Linder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-26T04:25:26Z","title":"Near Optimality of Quantized Policies in Stochastic Control Under Weak Continuity Conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6985","kind":"arxiv","version":2},"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:808a5fb240666697a9050f8349f0edbcda5d268eed93a94e2d3d31ecec3fb53d","target":"record","created_at":"2026-05-18T02:12:11Z","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":"0a2fffafbe9ebd0f84443829ff760b3de718eaae0587bf9a59c1d2477dc45cd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-26T04:25:26Z","title_canon_sha256":"9aaf05c1326ea2fba3881abf9fa8949f2634ff6a712129d4e091bba25db4a463"},"schema_version":"1.0","source":{"id":"1410.6985","kind":"arxiv","version":2}},"canonical_sha256":"94c1689794f7b1f6641e182ea111a63eba299ae51da2073ca34305a25308da33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94c1689794f7b1f6641e182ea111a63eba299ae51da2073ca34305a25308da33","first_computed_at":"2026-05-18T02:12:11.221231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:11.221231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kzws0777AW1HY1GbFsvtuCljzNJm20qoeJP56hJgFzHE9B/fhnrXemi6zWuCrmIiszHTFDnTyMLW3OzK6VQwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:11.222025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6985","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:808a5fb240666697a9050f8349f0edbcda5d268eed93a94e2d3d31ecec3fb53d","sha256:6efbfd9a560fa7aff4bc006b222b14d4cbe2379b6dfcf4f664f50cae187a9a85"],"state_sha256":"d971b26e207c8de4f55cb7cfd6320c34cfcaaa429d30a6dcba0acb5a131f86a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wlIfCWa68LW27MNtNE2Vg4KUSmCxKNca7dIhuTtSrnuKlInKOJDoVDV4FB/mTDKjUHjdvVi6K7VQm9HOTEzVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:26:19.308273Z","bundle_sha256":"32bff1b8a4f43bbf8363344d6af8c4d47b172cbba7aa894e06361b21f07c1b2c"}}