{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TKNEQC4LHXUW4PJT5LW2CBGGRO","short_pith_number":"pith:TKNEQC4L","canonical_record":{"source":{"id":"1301.6704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"fd8bd4db8c11cee55430ad1cf0860f4012ba9806e92071b27d423469f9924aec","abstract_canon_sha256":"ef67324606f81155d81cc773a487a8bd5e3fec25d880dc895afbc7d6d0fa33a8"},"schema_version":"1.0"},"canonical_sha256":"9a9a480b8b3de96e3d33eaeda104c68b896eaa6eba8e97af7ce6b4e7bc46a661","source":{"kind":"arxiv","id":"1301.6704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6704","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6704v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6704","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"TKNEQC4LHXUW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TKNEQC4LHXUW4PJT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TKNEQC4L","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TKNEQC4LHXUW4PJT5LW2CBGGRO","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"fd8bd4db8c11cee55430ad1cf0860f4012ba9806e92071b27d423469f9924aec","abstract_canon_sha256":"ef67324606f81155d81cc773a487a8bd5e3fec25d880dc895afbc7d6d0fa33a8"},"schema_version":"1.0"},"canonical_sha256":"9a9a480b8b3de96e3d33eaeda104c68b896eaa6eba8e97af7ce6b4e7bc46a661","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.867109Z","signature_b64":"M5dVyVmmAsda6Ns82fR8vOCw6ucaqPGHgMF3WtU68XvHeoVAjJGUtG7Sejd3X4eLWAUAa51a0rvxqOdUPsR8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a9a480b8b3de96e3d33eaeda104c68b896eaa6eba8e97af7ce6b4e7bc46a661","last_reissued_at":"2026-05-18T03:35:12.866258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.866258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6704","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":"Jgwa88Vu9qh98xpdh6Sidcg0jtkzZau6yeRIU9UvxPqEKN+4UJKNnTCS3aasgE/fMCqS06XQvePslnCp6N92Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:02:05.334250Z"},"content_sha256":"a41661f9f5dec38e8f4e9ab2f5efca7bf0f470f68f3f96cf699045072e5e8287","schema_version":"1.0","event_id":"sha256:a41661f9f5dec38e8f4e9ab2f5efca7bf0f470f68f3f96cf699045072e5e8287"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TKNEQC4LHXUW4PJT5LW2CBGGRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SPUDD: Stochastic Planning using Decision Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alan Hu, Craig Boutilier, Jesse Hoey, Robert St-Aubin","submitted_at":"2013-01-23T15:58:38Z","abstract_excerpt":"Markov decisions processes (MDPs) are becoming increasing popular as models of decision theoretic planning. While traditional dynamic programming methods perform well for problems with small state spaces, structured methods are needed for large problems. We propose and examine a value iteration algorithm for MDPs that uses algebraic decision diagrams(ADDs) to represent value functions and policies. An MDP is represented using Bayesian networks and ADDs and dynamic programming is applied directly to these ADDs. We demonstrate our method on large MDPs (up to 63 million states) and show that sign"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6704","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":"Tsn9OMD/1FNEHKikgqdpQdJr+N++oJpqqR3qBWoZN0l3x/MKmD1HMSRx+yy5eFwJO85MuGuUgQVcEeDFUS56BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:02:05.334624Z"},"content_sha256":"e9ec66b092f78b92cfd1672a5d87929532d35b36e3e71ea1bdaddf9f0f314199","schema_version":"1.0","event_id":"sha256:e9ec66b092f78b92cfd1672a5d87929532d35b36e3e71ea1bdaddf9f0f314199"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKNEQC4LHXUW4PJT5LW2CBGGRO/bundle.json","state_url":"https://pith.science/pith/TKNEQC4LHXUW4PJT5LW2CBGGRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKNEQC4LHXUW4PJT5LW2CBGGRO/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-09T00:02:05Z","links":{"resolver":"https://pith.science/pith/TKNEQC4LHXUW4PJT5LW2CBGGRO","bundle":"https://pith.science/pith/TKNEQC4LHXUW4PJT5LW2CBGGRO/bundle.json","state":"https://pith.science/pith/TKNEQC4LHXUW4PJT5LW2CBGGRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKNEQC4LHXUW4PJT5LW2CBGGRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TKNEQC4LHXUW4PJT5LW2CBGGRO","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":"ef67324606f81155d81cc773a487a8bd5e3fec25d880dc895afbc7d6d0fa33a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:38Z","title_canon_sha256":"fd8bd4db8c11cee55430ad1cf0860f4012ba9806e92071b27d423469f9924aec"},"schema_version":"1.0","source":{"id":"1301.6704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6704","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6704v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6704","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"TKNEQC4LHXUW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TKNEQC4LHXUW4PJT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TKNEQC4L","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:e9ec66b092f78b92cfd1672a5d87929532d35b36e3e71ea1bdaddf9f0f314199","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":"Markov decisions processes (MDPs) are becoming increasing popular as models of decision theoretic planning. While traditional dynamic programming methods perform well for problems with small state spaces, structured methods are needed for large problems. We propose and examine a value iteration algorithm for MDPs that uses algebraic decision diagrams(ADDs) to represent value functions and policies. An MDP is represented using Bayesian networks and ADDs and dynamic programming is applied directly to these ADDs. We demonstrate our method on large MDPs (up to 63 million states) and show that sign","authors_text":"Alan Hu, Craig Boutilier, Jesse Hoey, Robert St-Aubin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:38Z","title":"SPUDD: Stochastic Planning using Decision Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6704","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:a41661f9f5dec38e8f4e9ab2f5efca7bf0f470f68f3f96cf699045072e5e8287","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":"ef67324606f81155d81cc773a487a8bd5e3fec25d880dc895afbc7d6d0fa33a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:38Z","title_canon_sha256":"fd8bd4db8c11cee55430ad1cf0860f4012ba9806e92071b27d423469f9924aec"},"schema_version":"1.0","source":{"id":"1301.6704","kind":"arxiv","version":1}},"canonical_sha256":"9a9a480b8b3de96e3d33eaeda104c68b896eaa6eba8e97af7ce6b4e7bc46a661","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a9a480b8b3de96e3d33eaeda104c68b896eaa6eba8e97af7ce6b4e7bc46a661","first_computed_at":"2026-05-18T03:35:12.866258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:12.866258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M5dVyVmmAsda6Ns82fR8vOCw6ucaqPGHgMF3WtU68XvHeoVAjJGUtG7Sejd3X4eLWAUAa51a0rvxqOdUPsR8Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:12.867109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a41661f9f5dec38e8f4e9ab2f5efca7bf0f470f68f3f96cf699045072e5e8287","sha256:e9ec66b092f78b92cfd1672a5d87929532d35b36e3e71ea1bdaddf9f0f314199"],"state_sha256":"e85f4effc0f7373271be8e3ff7cbc55e9cb17a95d4f689141b09f27ae3106131"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yu7w6PsfedNyTYkeYl34HM3adT5W23p8vmM6tV193qE5ZtnsYA5HI1X8saaxiM2XeRoOg8mQtCzcNMsk/eAeDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:02:05.336504Z","bundle_sha256":"e84c4779c0593aeca5b989108a3a02740bf9c6056742aad88cbaf65346ddc878"}}