{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:YTHY7EGBL6MK3XGPH6KS67KVUX","short_pith_number":"pith:YTHY7EGB","canonical_record":{"source":{"id":"math/0506489","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2005-06-23T22:59:37Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"965bc4b2ce6f643242b91f19c87347cf16f66bf7011340ed90d4b5e175227fef","abstract_canon_sha256":"80b5fc7de84f666c4de726d2bb2c2206785613dc8cdffc243c0a69e13f29709c"},"schema_version":"1.0"},"canonical_sha256":"c4cf8f90c15f98addccf3f952f7d55a5fc283b171bdf957bc376aebea185b779","source":{"kind":"arxiv","id":"math/0506489","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0506489","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"arxiv_version","alias_value":"math/0506489v2","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0506489","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"pith_short_12","alias_value":"YTHY7EGBL6MK","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"pith_short_16","alias_value":"YTHY7EGBL6MK3XGP","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"pith_short_8","alias_value":"YTHY7EGB","created_at":"2026-07-04T15:10:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:YTHY7EGBL6MK3XGPH6KS67KVUX","target":"record","payload":{"canonical_record":{"source":{"id":"math/0506489","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2005-06-23T22:59:37Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"965bc4b2ce6f643242b91f19c87347cf16f66bf7011340ed90d4b5e175227fef","abstract_canon_sha256":"80b5fc7de84f666c4de726d2bb2c2206785613dc8cdffc243c0a69e13f29709c"},"schema_version":"1.0"},"canonical_sha256":"c4cf8f90c15f98addccf3f952f7d55a5fc283b171bdf957bc376aebea185b779","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:10:26.525055Z","signature_b64":"r9MCPyUQzqQT4WtJ0XJrVz1NAYMQzRvQU/5gdkN/PskIxNEztdWWNZRIvQODFmgHvEc8l9jT4q0oKqUs2xtoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4cf8f90c15f98addccf3f952f7d55a5fc283b171bdf957bc376aebea185b779","last_reissued_at":"2026-07-04T15:10:26.524709Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:10:26.524709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0506489","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-07-04T15:10:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtgARDYKpnLoDyogSJXIlouXwmkeu3YpKyMbV6/9xiqCXjPvmPeGS9heGXvR9plgxIrs8GDespNOwXjLZ8M/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T22:50:43.925240Z"},"content_sha256":"7e8d2a34ce79dac87d2599a79d70ebd6fabbac7e5c705921da873cb069d7e00c","schema_version":"1.0","event_id":"sha256:7e8d2a34ce79dac87d2599a79d70ebd6fabbac7e5c705921da873cb069d7e00c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:YTHY7EGBL6MK3XGPH6KS67KVUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Acceleration Operators in the Value Iteration Algorithms for Markov Decision Processes","license":"","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Chi-Guhn Lee, Dmitry Khmelev, Nasser Jaber, Oleksandr Shlakhter","submitted_at":"2005-06-23T22:59:37Z","abstract_excerpt":"We study the general approach to accelerating the convergence of the most widely used solution method of Markov decision processes with the total expected discounted reward. Inspired by the monotone behavior of the contraction mappings in the feasible set of the linear programming problem equivalent to the MDP, we establish a class of operators that can be used in combination with a contraction mapping operator in the standard value iteration algorithm and its variants. We then propose two such operators, which can be easily implemented as part of the value iteration algorithm and its variants"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0506489","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0506489/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-04T15:10:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJdKRJb6RZrrYRRS4G+MwTSbW2qZWdv6ICRGxkTeDOzWw3cRpMXvlEdR+5pr+yqZmzslz4Saod2CR2m+I1EDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T22:50:43.926078Z"},"content_sha256":"62cfc6ff29a936d880c7cc8e6f41793821bda236e8e585459ab21ab95668cef3","schema_version":"1.0","event_id":"sha256:62cfc6ff29a936d880c7cc8e6f41793821bda236e8e585459ab21ab95668cef3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTHY7EGBL6MK3XGPH6KS67KVUX/bundle.json","state_url":"https://pith.science/pith/YTHY7EGBL6MK3XGPH6KS67KVUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTHY7EGBL6MK3XGPH6KS67KVUX/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-08-18T22:50:43Z","links":{"resolver":"https://pith.science/pith/YTHY7EGBL6MK3XGPH6KS67KVUX","bundle":"https://pith.science/pith/YTHY7EGBL6MK3XGPH6KS67KVUX/bundle.json","state":"https://pith.science/pith/YTHY7EGBL6MK3XGPH6KS67KVUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTHY7EGBL6MK3XGPH6KS67KVUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:YTHY7EGBL6MK3XGPH6KS67KVUX","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":"80b5fc7de84f666c4de726d2bb2c2206785613dc8cdffc243c0a69e13f29709c","cross_cats_sorted":["math.PR"],"license":"","primary_cat":"math.OC","submitted_at":"2005-06-23T22:59:37Z","title_canon_sha256":"965bc4b2ce6f643242b91f19c87347cf16f66bf7011340ed90d4b5e175227fef"},"schema_version":"1.0","source":{"id":"math/0506489","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0506489","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"arxiv_version","alias_value":"math/0506489v2","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0506489","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"pith_short_12","alias_value":"YTHY7EGBL6MK","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"pith_short_16","alias_value":"YTHY7EGBL6MK3XGP","created_at":"2026-07-04T15:10:26Z"},{"alias_kind":"pith_short_8","alias_value":"YTHY7EGB","created_at":"2026-07-04T15:10:26Z"}],"graph_snapshots":[{"event_id":"sha256:62cfc6ff29a936d880c7cc8e6f41793821bda236e8e585459ab21ab95668cef3","target":"graph","created_at":"2026-07-04T15:10:26Z","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/math/0506489/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the general approach to accelerating the convergence of the most widely used solution method of Markov decision processes with the total expected discounted reward. Inspired by the monotone behavior of the contraction mappings in the feasible set of the linear programming problem equivalent to the MDP, we establish a class of operators that can be used in combination with a contraction mapping operator in the standard value iteration algorithm and its variants. We then propose two such operators, which can be easily implemented as part of the value iteration algorithm and its variants","authors_text":"Chi-Guhn Lee, Dmitry Khmelev, Nasser Jaber, Oleksandr Shlakhter","cross_cats":["math.PR"],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2005-06-23T22:59:37Z","title":"Acceleration Operators in the Value Iteration Algorithms for Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0506489","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:7e8d2a34ce79dac87d2599a79d70ebd6fabbac7e5c705921da873cb069d7e00c","target":"record","created_at":"2026-07-04T15:10:26Z","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":"80b5fc7de84f666c4de726d2bb2c2206785613dc8cdffc243c0a69e13f29709c","cross_cats_sorted":["math.PR"],"license":"","primary_cat":"math.OC","submitted_at":"2005-06-23T22:59:37Z","title_canon_sha256":"965bc4b2ce6f643242b91f19c87347cf16f66bf7011340ed90d4b5e175227fef"},"schema_version":"1.0","source":{"id":"math/0506489","kind":"arxiv","version":2}},"canonical_sha256":"c4cf8f90c15f98addccf3f952f7d55a5fc283b171bdf957bc376aebea185b779","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4cf8f90c15f98addccf3f952f7d55a5fc283b171bdf957bc376aebea185b779","first_computed_at":"2026-07-04T15:10:26.524709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:10:26.524709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r9MCPyUQzqQT4WtJ0XJrVz1NAYMQzRvQU/5gdkN/PskIxNEztdWWNZRIvQODFmgHvEc8l9jT4q0oKqUs2xtoDw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:10:26.525055Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0506489","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e8d2a34ce79dac87d2599a79d70ebd6fabbac7e5c705921da873cb069d7e00c","sha256:62cfc6ff29a936d880c7cc8e6f41793821bda236e8e585459ab21ab95668cef3"],"state_sha256":"c48e6ee3348f1907e0a0962ea8d48838debca7463232e66f3b16bb3c263bfdce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"033HmZFbyTdHCtqlduO3r89QrPHfFmtt3RSADhjcs9gxLjxwKmroxyWBUzFYju4XRYMwhOuaHBOz9rPYZsVzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T22:50:43.931965Z","bundle_sha256":"297d67e0ec28fe96cca9b2fa75969fb1b93e263fdad43f00c80cd4dc59c4172c"}}