{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FUB47YMHBHYM4AYVRWP5YOQDA7","short_pith_number":"pith:FUB47YMH","canonical_record":{"source":{"id":"1302.1525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:54:07Z","cross_cats_sorted":[],"title_canon_sha256":"c7a96994489117845cdaa1e0dc11e1f8d021d7065ed61652b16f08bf7b859a0b","abstract_canon_sha256":"ca77e697d66674514ff8b243c0e5ad5be667fb649805d6e67e728447e582de7c"},"schema_version":"1.0"},"canonical_sha256":"2d03cfe18709f0ce03158d9fdc3a0307c80aa7f7b679bf6a610106939a94646b","source":{"kind":"arxiv","id":"1302.1525","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1525","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1525v1","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1525","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"pith_short_12","alias_value":"FUB47YMHBHYM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FUB47YMHBHYM4AYV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FUB47YMH","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FUB47YMHBHYM4AYVRWP5YOQDA7","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:54:07Z","cross_cats_sorted":[],"title_canon_sha256":"c7a96994489117845cdaa1e0dc11e1f8d021d7065ed61652b16f08bf7b859a0b","abstract_canon_sha256":"ca77e697d66674514ff8b243c0e5ad5be667fb649805d6e67e728447e582de7c"},"schema_version":"1.0"},"canonical_sha256":"2d03cfe18709f0ce03158d9fdc3a0307c80aa7f7b679bf6a610106939a94646b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:23.962669Z","signature_b64":"iw4Rz61DreG5qDR8Y1ojCqE/brAh47BLvX4GEyBCye21FnNyJ9QGcpcpBq6N9Bcl5mduJWz9CqcNlpI7VVK2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d03cfe18709f0ce03158d9fdc3a0307c80aa7f7b679bf6a610106939a94646b","last_reissued_at":"2026-05-18T03:34:23.962123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:23.962123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1525","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:34:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEYv+FO+7pC70gjexUPAjsokXw84IjiXgPL0gd6LBl0UiJFbDxCs/3aUMFpPFel/YzNbksiH25ZoBw+4TtuEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:23:52.918313Z"},"content_sha256":"e851ba3f00db4789905ff61a60cdab7b072ae03b7fc1174916ab3e68016f5996","schema_version":"1.0","event_id":"sha256:e851ba3f00db4789905ff61a60cdab7b072ae03b7fc1174916ab3e68016f5996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FUB47YMHBHYM4AYVRWP5YOQDA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anthony R. Cassandra, Michael L. Littman, Nevin Lianwen Zhang","submitted_at":"2013-02-06T15:54:07Z","abstract_excerpt":"Most exact algorithms for general partially observable Markov decision processes (POMDPs) use a form of dynamic programming in which a piecewise-linear and convex representation of one value function is transformed into another.  We examine variations of the \"incremental pruning\" method for solving this problem and compare them to earlier algorithms from theoretical and empirical perspectives.  We find that incremental pruning is presently the most efficient exact method for solving POMDPs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1525","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:34:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prhEp4bA4Bn91hIDN1VeL/SlzgKI9kaOBtVzWr25fQJCAGNj15TpYrFlV/DFENIUrvyTXEX5Wg4FtKL5ZVr5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:23:52.918677Z"},"content_sha256":"552b660b62995865775106b83db0bfe464a46866a2ccda286e4a92bde0a6cd5d","schema_version":"1.0","event_id":"sha256:552b660b62995865775106b83db0bfe464a46866a2ccda286e4a92bde0a6cd5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUB47YMHBHYM4AYVRWP5YOQDA7/bundle.json","state_url":"https://pith.science/pith/FUB47YMHBHYM4AYVRWP5YOQDA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUB47YMHBHYM4AYVRWP5YOQDA7/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-27T03:23:52Z","links":{"resolver":"https://pith.science/pith/FUB47YMHBHYM4AYVRWP5YOQDA7","bundle":"https://pith.science/pith/FUB47YMHBHYM4AYVRWP5YOQDA7/bundle.json","state":"https://pith.science/pith/FUB47YMHBHYM4AYVRWP5YOQDA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUB47YMHBHYM4AYVRWP5YOQDA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FUB47YMHBHYM4AYVRWP5YOQDA7","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":"ca77e697d66674514ff8b243c0e5ad5be667fb649805d6e67e728447e582de7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:54:07Z","title_canon_sha256":"c7a96994489117845cdaa1e0dc11e1f8d021d7065ed61652b16f08bf7b859a0b"},"schema_version":"1.0","source":{"id":"1302.1525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1525","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1525v1","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1525","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"pith_short_12","alias_value":"FUB47YMHBHYM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FUB47YMHBHYM4AYV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FUB47YMH","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:552b660b62995865775106b83db0bfe464a46866a2ccda286e4a92bde0a6cd5d","target":"graph","created_at":"2026-05-18T03:34:23Z","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":"Most exact algorithms for general partially observable Markov decision processes (POMDPs) use a form of dynamic programming in which a piecewise-linear and convex representation of one value function is transformed into another.  We examine variations of the \"incremental pruning\" method for solving this problem and compare them to earlier algorithms from theoretical and empirical perspectives.  We find that incremental pruning is presently the most efficient exact method for solving POMDPs.","authors_text":"Anthony R. Cassandra, Michael L. Littman, Nevin Lianwen Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:54:07Z","title":"Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1525","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:e851ba3f00db4789905ff61a60cdab7b072ae03b7fc1174916ab3e68016f5996","target":"record","created_at":"2026-05-18T03:34:23Z","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":"ca77e697d66674514ff8b243c0e5ad5be667fb649805d6e67e728447e582de7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:54:07Z","title_canon_sha256":"c7a96994489117845cdaa1e0dc11e1f8d021d7065ed61652b16f08bf7b859a0b"},"schema_version":"1.0","source":{"id":"1302.1525","kind":"arxiv","version":1}},"canonical_sha256":"2d03cfe18709f0ce03158d9fdc3a0307c80aa7f7b679bf6a610106939a94646b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d03cfe18709f0ce03158d9fdc3a0307c80aa7f7b679bf6a610106939a94646b","first_computed_at":"2026-05-18T03:34:23.962123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:23.962123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iw4Rz61DreG5qDR8Y1ojCqE/brAh47BLvX4GEyBCye21FnNyJ9QGcpcpBq6N9Bcl5mduJWz9CqcNlpI7VVK2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:23.962669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e851ba3f00db4789905ff61a60cdab7b072ae03b7fc1174916ab3e68016f5996","sha256:552b660b62995865775106b83db0bfe464a46866a2ccda286e4a92bde0a6cd5d"],"state_sha256":"2bb2a28b3b55b1a9949c4a9132214f3240cad35dc1d44d7959a2aeb49c52e708"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOGGniZifuyrjX0qLNNEwHEnbUsU75QN2rXmwin+vZBp7vHEH13o9VsifdaqsjLKag12jr+I6P685bkwmlWbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:23:52.920605Z","bundle_sha256":"374a3fb87bd9458ac736f5e165fa02a7b6f3b270ced2bdfcb5c938428e9ec767"}}