{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GQASSJKE4KGQGN3ZV6ALACIFQZ","short_pith_number":"pith:GQASSJKE","canonical_record":{"source":{"id":"1207.4116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:43:38Z","cross_cats_sorted":[],"title_canon_sha256":"14e0d303c51c0607e50a9f9e9c5aae89db035f559590abbcfdc1d568ec4a82f8","abstract_canon_sha256":"297bd8e653f93c2cefc120ab55021e83284bdb1dbb247486bcad3b0714cbc5bd"},"schema_version":"1.0"},"canonical_sha256":"3401292544e28d033779af80b009058655e47c1b831191b92345a73fecd19938","source":{"kind":"arxiv","id":"1207.4116","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4116","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4116v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4116","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"GQASSJKE4KGQ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GQASSJKE4KGQGN3Z","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GQASSJKE","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GQASSJKE4KGQGN3ZV6ALACIFQZ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:43:38Z","cross_cats_sorted":[],"title_canon_sha256":"14e0d303c51c0607e50a9f9e9c5aae89db035f559590abbcfdc1d568ec4a82f8","abstract_canon_sha256":"297bd8e653f93c2cefc120ab55021e83284bdb1dbb247486bcad3b0714cbc5bd"},"schema_version":"1.0"},"canonical_sha256":"3401292544e28d033779af80b009058655e47c1b831191b92345a73fecd19938","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.936372Z","signature_b64":"o5Dajb8TZ9czoKUPzPzJyIrzKY5QcQlwccuo4JD3sb3n0kYU4/fQhwTrUWqRUWYSUnd4phql1A9nuV0ESh31Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3401292544e28d033779af80b009058655e47c1b831191b92345a73fecd19938","last_reissued_at":"2026-05-18T03:50:47.935754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.935754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4116","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmevMu9xlGlOu9VT+40UYKcO8FzdJwEsrxk/3H1taJWlBw0YpOrWKOVAXaw9oWsNHJy3WKWVSUYndeWFzcKyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:07:43.060629Z"},"content_sha256":"bf40e617b7c43a82e85c8d7dc453787220e951e6771b0f79fd511ec8179aa2c3","schema_version":"1.0","event_id":"sha256:bf40e617b7c43a82e85c8d7dc453787220e951e6771b0f79fd511ec8179aa2c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GQASSJKE4KGQGN3ZV6ALACIFQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Region-Based Incremental Pruning for POMDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Shlomo Zilberstein, Zhengzhu Feng","submitted_at":"2012-07-11T14:43:38Z","abstract_excerpt":"We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dynamic programming (DP) update, a key source of complexity in POMDP algorithms. Instead of reasoning about the whole belief space when pruning the cross-sums, our algorithm divides the belief space into smaller regions and performs independent pruning in each region. We evaluate the benefits of the new technique both analytically and experimentally, and show that it produces very significant performance gains. The resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4116","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxaRTUU4dco8ren/Nnpavp7H3md0CAKj5FMcYEZvVYFrmIvGeXD5wpwXHyv+/x7Lf0WiAJxW0tyegFUNGfV4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:07:43.060978Z"},"content_sha256":"ae5d7fa322d98258d4b83c05958bfc3738d9b004c02941ea7255dfe78b36fe3b","schema_version":"1.0","event_id":"sha256:ae5d7fa322d98258d4b83c05958bfc3738d9b004c02941ea7255dfe78b36fe3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQASSJKE4KGQGN3ZV6ALACIFQZ/bundle.json","state_url":"https://pith.science/pith/GQASSJKE4KGQGN3ZV6ALACIFQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQASSJKE4KGQGN3ZV6ALACIFQZ/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-03T22:07:43Z","links":{"resolver":"https://pith.science/pith/GQASSJKE4KGQGN3ZV6ALACIFQZ","bundle":"https://pith.science/pith/GQASSJKE4KGQGN3ZV6ALACIFQZ/bundle.json","state":"https://pith.science/pith/GQASSJKE4KGQGN3ZV6ALACIFQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQASSJKE4KGQGN3ZV6ALACIFQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GQASSJKE4KGQGN3ZV6ALACIFQZ","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":"297bd8e653f93c2cefc120ab55021e83284bdb1dbb247486bcad3b0714cbc5bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:43:38Z","title_canon_sha256":"14e0d303c51c0607e50a9f9e9c5aae89db035f559590abbcfdc1d568ec4a82f8"},"schema_version":"1.0","source":{"id":"1207.4116","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4116","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4116v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4116","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"GQASSJKE4KGQ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GQASSJKE4KGQGN3Z","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GQASSJKE","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:ae5d7fa322d98258d4b83c05958bfc3738d9b004c02941ea7255dfe78b36fe3b","target":"graph","created_at":"2026-05-18T03:50:47Z","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 major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dynamic programming (DP) update, a key source of complexity in POMDP algorithms. Instead of reasoning about the whole belief space when pruning the cross-sums, our algorithm divides the belief space into smaller regions and performs independent pruning in each region. We evaluate the benefits of the new technique both analytically and experimentally, and show that it produces very significant performance gains. The resul","authors_text":"Shlomo Zilberstein, Zhengzhu Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:43:38Z","title":"Region-Based Incremental Pruning for POMDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4116","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:bf40e617b7c43a82e85c8d7dc453787220e951e6771b0f79fd511ec8179aa2c3","target":"record","created_at":"2026-05-18T03:50:47Z","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":"297bd8e653f93c2cefc120ab55021e83284bdb1dbb247486bcad3b0714cbc5bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:43:38Z","title_canon_sha256":"14e0d303c51c0607e50a9f9e9c5aae89db035f559590abbcfdc1d568ec4a82f8"},"schema_version":"1.0","source":{"id":"1207.4116","kind":"arxiv","version":1}},"canonical_sha256":"3401292544e28d033779af80b009058655e47c1b831191b92345a73fecd19938","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3401292544e28d033779af80b009058655e47c1b831191b92345a73fecd19938","first_computed_at":"2026-05-18T03:50:47.935754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:47.935754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o5Dajb8TZ9czoKUPzPzJyIrzKY5QcQlwccuo4JD3sb3n0kYU4/fQhwTrUWqRUWYSUnd4phql1A9nuV0ESh31Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:47.936372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4116","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf40e617b7c43a82e85c8d7dc453787220e951e6771b0f79fd511ec8179aa2c3","sha256:ae5d7fa322d98258d4b83c05958bfc3738d9b004c02941ea7255dfe78b36fe3b"],"state_sha256":"844736d6d3e19c490eabd74cdff846973ae2d3dff53d11eb8ac105d3e9b277b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLksbDQHOUL2w0gcxoPFzTKnxfoa9o1QwArT/KfgcyKaUZBfFbrVkGvWdj81jDaSHhtw26edWW5IlmLKeVdyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:07:43.062946Z","bundle_sha256":"a4d5ed8cb5180ccb408ca299205558e49499c4d2639184140a6d19a56d8f0179"}}