{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SH5X5DFPX27QZFXMNWQFDVBYFU","short_pith_number":"pith:SH5X5DFP","canonical_record":{"source":{"id":"1301.6751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T16:01:45Z","cross_cats_sorted":[],"title_canon_sha256":"480b5053dcab1d69f699d88cc7ec93baa45010ac2719d29fcc572fd845415ad0","abstract_canon_sha256":"49d6efb46cfa7e03b89efe982e9e520276a3e93b985bf0faa718775f8cfe526e"},"schema_version":"1.0"},"canonical_sha256":"91fb7e8cafbebf0c96ec6da051d4382d28dcdc3ec0e993f8e8ea5c02b5bb747e","source":{"kind":"arxiv","id":"1301.6751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6751","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6751v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6751","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"SH5X5DFPX27Q","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SH5X5DFPX27QZFXM","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SH5X5DFP","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SH5X5DFPX27QZFXMNWQFDVBYFU","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T16:01:45Z","cross_cats_sorted":[],"title_canon_sha256":"480b5053dcab1d69f699d88cc7ec93baa45010ac2719d29fcc572fd845415ad0","abstract_canon_sha256":"49d6efb46cfa7e03b89efe982e9e520276a3e93b985bf0faa718775f8cfe526e"},"schema_version":"1.0"},"canonical_sha256":"91fb7e8cafbebf0c96ec6da051d4382d28dcdc3ec0e993f8e8ea5c02b5bb747e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.459955Z","signature_b64":"Jg7AEu1hvWHYNjxfYFUEiYQoSGoiuOz+1wLR8wPAo/cQQLZ5ZZQtufAbvHmReUFFnbydQ6XxuereYSOq6hNpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91fb7e8cafbebf0c96ec6da051d4382d28dcdc3ec0e993f8e8ea5c02b5bb747e","last_reissued_at":"2026-05-18T03:35:12.459274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.459274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6751","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:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qkCXHDcErwEet+m+PTs30sW5QmN5PoJRmaJeC9L/QMzcuF3SZPBBmEOjRwgGJSs+/4IQ4JVqE6l7fr06aPZ2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:18:04.604122Z"},"content_sha256":"977a75d1a3e9713c103895a058d24e53a4e375fee3ca77e370109e6dfc92f332","schema_version":"1.0","event_id":"sha256:977a75d1a3e9713c103895a058d24e53a4e375fee3ca77e370109e6dfc92f332"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SH5X5DFPX27QZFXMNWQFDVBYFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Method for Speeding Up Value Iteration in Partially Observable Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nevin Lianwen Zhang, Stephen S. Lee, Weihong Zhang","submitted_at":"2013-01-23T16:01:45Z","abstract_excerpt":"We present a technique for speeding up the convergence of  value iteration for partially observable Markov decisions processes (POMDPs). The underlying idea is similar to that behind modified policy iteration for fully observable Markov  decision processes (MDPs). The technique can be easily  incorporated into any existing POMDP value iteration algorithms. Experiments have been conducted on several test problems with one POMDP value iteration algorithm called incremental pruning. We find that the technique can make incremental pruning run several orders of magnitude faster."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6751","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:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXGxRQhIJMk0X+yN0yIdx7wBEWBb0exPGPmeSqf1f5EDC6gMKkrbT39HXxynzCfe46Zqmra5qUgN42Q8PuqGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:18:04.604742Z"},"content_sha256":"947dc11d11d090c4272df623eb19a9fe02cef2189b57f60d5193e4ce2a9349f9","schema_version":"1.0","event_id":"sha256:947dc11d11d090c4272df623eb19a9fe02cef2189b57f60d5193e4ce2a9349f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SH5X5DFPX27QZFXMNWQFDVBYFU/bundle.json","state_url":"https://pith.science/pith/SH5X5DFPX27QZFXMNWQFDVBYFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SH5X5DFPX27QZFXMNWQFDVBYFU/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-11T06:18:04Z","links":{"resolver":"https://pith.science/pith/SH5X5DFPX27QZFXMNWQFDVBYFU","bundle":"https://pith.science/pith/SH5X5DFPX27QZFXMNWQFDVBYFU/bundle.json","state":"https://pith.science/pith/SH5X5DFPX27QZFXMNWQFDVBYFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SH5X5DFPX27QZFXMNWQFDVBYFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SH5X5DFPX27QZFXMNWQFDVBYFU","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":"49d6efb46cfa7e03b89efe982e9e520276a3e93b985bf0faa718775f8cfe526e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T16:01:45Z","title_canon_sha256":"480b5053dcab1d69f699d88cc7ec93baa45010ac2719d29fcc572fd845415ad0"},"schema_version":"1.0","source":{"id":"1301.6751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6751","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6751v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6751","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"SH5X5DFPX27Q","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SH5X5DFPX27QZFXM","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SH5X5DFP","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:947dc11d11d090c4272df623eb19a9fe02cef2189b57f60d5193e4ce2a9349f9","target":"graph","created_at":"2026-05-18T03:35:12Z","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 present a technique for speeding up the convergence of  value iteration for partially observable Markov decisions processes (POMDPs). The underlying idea is similar to that behind modified policy iteration for fully observable Markov  decision processes (MDPs). The technique can be easily  incorporated into any existing POMDP value iteration algorithms. Experiments have been conducted on several test problems with one POMDP value iteration algorithm called incremental pruning. We find that the technique can make incremental pruning run several orders of magnitude faster.","authors_text":"Nevin Lianwen Zhang, Stephen S. Lee, Weihong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T16:01:45Z","title":"A Method for Speeding Up Value Iteration in Partially Observable Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6751","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:977a75d1a3e9713c103895a058d24e53a4e375fee3ca77e370109e6dfc92f332","target":"record","created_at":"2026-05-18T03:35:12Z","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":"49d6efb46cfa7e03b89efe982e9e520276a3e93b985bf0faa718775f8cfe526e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T16:01:45Z","title_canon_sha256":"480b5053dcab1d69f699d88cc7ec93baa45010ac2719d29fcc572fd845415ad0"},"schema_version":"1.0","source":{"id":"1301.6751","kind":"arxiv","version":1}},"canonical_sha256":"91fb7e8cafbebf0c96ec6da051d4382d28dcdc3ec0e993f8e8ea5c02b5bb747e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91fb7e8cafbebf0c96ec6da051d4382d28dcdc3ec0e993f8e8ea5c02b5bb747e","first_computed_at":"2026-05-18T03:35:12.459274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:12.459274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jg7AEu1hvWHYNjxfYFUEiYQoSGoiuOz+1wLR8wPAo/cQQLZ5ZZQtufAbvHmReUFFnbydQ6XxuereYSOq6hNpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:12.459955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:977a75d1a3e9713c103895a058d24e53a4e375fee3ca77e370109e6dfc92f332","sha256:947dc11d11d090c4272df623eb19a9fe02cef2189b57f60d5193e4ce2a9349f9"],"state_sha256":"5ed5ced76c0d448e4bd6433c91b335f48ced8240cce43530dd8c53f5f0562eaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFfuoH/sxyR3bpund3IErgaYkxZt4mHVT1nR+ffqJy2Z8R6DItl9NQTliManICHUPtWQX3hIfja7bu1ChLcBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:18:04.608551Z","bundle_sha256":"fecbca3140fa006eb1ec0b5fc783c14755de5d13b4ab5de6f9d47a525b3d3905"}}