{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:X2C23UR3O7R5B73YDMYXWDD2YF","short_pith_number":"pith:X2C23UR3","canonical_record":{"source":{"id":"1106.0251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:40:25Z","cross_cats_sorted":[],"title_canon_sha256":"2655b9ffac550aed7652ef31d7de8efa36b15ce0bc01975e58a8e15b58daae19","abstract_canon_sha256":"530b36e6c08ab3fc0dfc4680a46bfd219b06c420a81f51801f501550d5de026d"},"schema_version":"1.0"},"canonical_sha256":"be85add23b77e3d0ff781b317b0c7ac1720cd6eb51bce471d73f45b1c010476c","source":{"kind":"arxiv","id":"1106.0251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0251","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0251v1","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0251","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"X2C23UR3O7R5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X2C23UR3O7R5B73Y","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X2C23UR3","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:X2C23UR3O7R5B73YDMYXWDD2YF","target":"record","payload":{"canonical_record":{"source":{"id":"1106.0251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:40:25Z","cross_cats_sorted":[],"title_canon_sha256":"2655b9ffac550aed7652ef31d7de8efa36b15ce0bc01975e58a8e15b58daae19","abstract_canon_sha256":"530b36e6c08ab3fc0dfc4680a46bfd219b06c420a81f51801f501550d5de026d"},"schema_version":"1.0"},"canonical_sha256":"be85add23b77e3d0ff781b317b0c7ac1720cd6eb51bce471d73f45b1c010476c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:51.702717Z","signature_b64":"eGul2LQ97ZDeCKCKFlUFzfpABbQxLy7p8r5aoxypgsayn/8XkPhiva+aZHa6FeSYBG9BCxswzC6zEonfPfhjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be85add23b77e3d0ff781b317b0c7ac1720cd6eb51bce471d73f45b1c010476c","last_reissued_at":"2026-05-18T04:20:51.702159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:51.702159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.0251","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-18T04:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKEeUx1SCix4CpCcZWoO+I7vROAER0y3STmQBeM4QXhi7hulafh00Szxy+5JN0IarRYY1mvzRslc80C621PeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:02:47.783197Z"},"content_sha256":"ea4d86f76b4c008a257d1ca7fa50c52b9138ce51a078df974814178e5374c94b","schema_version":"1.0","event_id":"sha256:ea4d86f76b4c008a257d1ca7fa50c52b9138ce51a078df974814178e5374c94b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:X2C23UR3O7R5B73YDMYXWDD2YF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speeding Up the Convergence of 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":"N. L. Zhang, W. Zhang","submitted_at":"2011-06-01T16:40:25Z","abstract_excerpt":"Partially observable Markov decision processes (POMDPs) have    recently become popular among many AI researchers because they serve    as a natural model for planning under uncertainty.  Value iteration is    a well-known algorithm for finding optimal policies for POMDPs.  It    typically takes a large number of iterations to converge.  This paper    proposes a method for accelerating the convergence of value iteration.    The method has been evaluated on an array of benchmark problems and    was found to be very effective: It enabled value iteration to converge    after only a few iterations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0251","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-18T04:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xs1aXVDaBYqRI48zhgipEGO1z3wZyqePhsGvP9rlhOpQCVEcqPD5mScJpIiIWgO9iMst8Kg3SYZvFZEqhCF1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:02:47.783910Z"},"content_sha256":"e04b5518d9636c00d2bffbb7c9c1baa66e9e5f44dc600ef49b45a17aef1076cd","schema_version":"1.0","event_id":"sha256:e04b5518d9636c00d2bffbb7c9c1baa66e9e5f44dc600ef49b45a17aef1076cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2C23UR3O7R5B73YDMYXWDD2YF/bundle.json","state_url":"https://pith.science/pith/X2C23UR3O7R5B73YDMYXWDD2YF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2C23UR3O7R5B73YDMYXWDD2YF/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-05-25T18:02:47Z","links":{"resolver":"https://pith.science/pith/X2C23UR3O7R5B73YDMYXWDD2YF","bundle":"https://pith.science/pith/X2C23UR3O7R5B73YDMYXWDD2YF/bundle.json","state":"https://pith.science/pith/X2C23UR3O7R5B73YDMYXWDD2YF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2C23UR3O7R5B73YDMYXWDD2YF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:X2C23UR3O7R5B73YDMYXWDD2YF","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":"530b36e6c08ab3fc0dfc4680a46bfd219b06c420a81f51801f501550d5de026d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:40:25Z","title_canon_sha256":"2655b9ffac550aed7652ef31d7de8efa36b15ce0bc01975e58a8e15b58daae19"},"schema_version":"1.0","source":{"id":"1106.0251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0251","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0251v1","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0251","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"X2C23UR3O7R5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X2C23UR3O7R5B73Y","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X2C23UR3","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:e04b5518d9636c00d2bffbb7c9c1baa66e9e5f44dc600ef49b45a17aef1076cd","target":"graph","created_at":"2026-05-18T04:20:51Z","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":"Partially observable Markov decision processes (POMDPs) have    recently become popular among many AI researchers because they serve    as a natural model for planning under uncertainty.  Value iteration is    a well-known algorithm for finding optimal policies for POMDPs.  It    typically takes a large number of iterations to converge.  This paper    proposes a method for accelerating the convergence of value iteration.    The method has been evaluated on an array of benchmark problems and    was found to be very effective: It enabled value iteration to converge    after only a few iterations","authors_text":"N. L. Zhang, W. Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:40:25Z","title":"Speeding Up the Convergence of Value Iteration in Partially Observable Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0251","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:ea4d86f76b4c008a257d1ca7fa50c52b9138ce51a078df974814178e5374c94b","target":"record","created_at":"2026-05-18T04:20:51Z","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":"530b36e6c08ab3fc0dfc4680a46bfd219b06c420a81f51801f501550d5de026d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:40:25Z","title_canon_sha256":"2655b9ffac550aed7652ef31d7de8efa36b15ce0bc01975e58a8e15b58daae19"},"schema_version":"1.0","source":{"id":"1106.0251","kind":"arxiv","version":1}},"canonical_sha256":"be85add23b77e3d0ff781b317b0c7ac1720cd6eb51bce471d73f45b1c010476c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be85add23b77e3d0ff781b317b0c7ac1720cd6eb51bce471d73f45b1c010476c","first_computed_at":"2026-05-18T04:20:51.702159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:51.702159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eGul2LQ97ZDeCKCKFlUFzfpABbQxLy7p8r5aoxypgsayn/8XkPhiva+aZHa6FeSYBG9BCxswzC6zEonfPfhjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:51.702717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea4d86f76b4c008a257d1ca7fa50c52b9138ce51a078df974814178e5374c94b","sha256:e04b5518d9636c00d2bffbb7c9c1baa66e9e5f44dc600ef49b45a17aef1076cd"],"state_sha256":"1364dc2b8ec423fe3cc391cdfe5cbf5f188bdbac55fa75d288c8abf155eacefa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6+4KWxUbzDogLSuVT3X3b0JBefpGFI8SToNdcTRK3/e1zJTcRZS6aXa7PwsBtv1tG1Lq4PwBbkUubSRX36MAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:02:47.787720Z","bundle_sha256":"9617ecf8d36eee1f79d68cc251a70435b6e24597ddc0734d410c47239034803a"}}