{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CS6ZAVSH7IMURO2TA5KXWOV4BI","short_pith_number":"pith:CS6ZAVSH","canonical_record":{"source":{"id":"1401.3882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:13:02Z","cross_cats_sorted":[],"title_canon_sha256":"749eae1c54385c01e3c6f5344eb7ca976ea5666f0d6a2eda4c1bbab2dbff9bf6","abstract_canon_sha256":"714569e78debca9063198a5d88eef2b35001e8e1298fa670fce3a0512b3c6bb6"},"schema_version":"1.0"},"canonical_sha256":"14bd905647fa1948bb5307557b3abc0a27f509149597feb0d40e7c59099a11d6","source":{"kind":"arxiv","id":"1401.3882","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3882","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3882v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3882","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"CS6ZAVSH7IMU","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CS6ZAVSH7IMURO2T","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CS6ZAVSH","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CS6ZAVSH7IMURO2TA5KXWOV4BI","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:13:02Z","cross_cats_sorted":[],"title_canon_sha256":"749eae1c54385c01e3c6f5344eb7ca976ea5666f0d6a2eda4c1bbab2dbff9bf6","abstract_canon_sha256":"714569e78debca9063198a5d88eef2b35001e8e1298fa670fce3a0512b3c6bb6"},"schema_version":"1.0"},"canonical_sha256":"14bd905647fa1948bb5307557b3abc0a27f509149597feb0d40e7c59099a11d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.278523Z","signature_b64":"NFE7THVXIlboA+aBJfgtl6LvaBNFzDQWEHR5k7NhXU3SEtN39R1vX8sbuAI2yEtJOgXCrn2GImTC5HVj4ah+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14bd905647fa1948bb5307557b3abc0a27f509149597feb0d40e7c59099a11d6","last_reissued_at":"2026-05-18T03:02:06.278000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.278000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3882","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:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MIOADITymc0Q4aqQDSvmmzCa0apwS5b6ZeXv6A77cqs4z98w9AlITAix459qWtopucD9vMV5DupjH7zgVo1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:20:36.855077Z"},"content_sha256":"26d75db1a50bf76fa99014495e6eee65a6dca9bf7630e069fa80f77db3f77e6c","schema_version":"1.0","event_id":"sha256:26d75db1a50bf76fa99014495e6eee65a6dca9bf7630e069fa80f77db3f77e6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CS6ZAVSH7IMURO2TA5KXWOV4BI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Relational Planning with First Order Decision Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Roni Khardon, Saket Joshi","submitted_at":"2014-01-16T05:13:02Z","abstract_excerpt":"Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diagrams, to capture domain dynamics and value functions.  Work on symbolic dynamic programming lifted these ideas to first order logic using several representation schemes.  Recent work introduced a first order variant of decision diagrams (FODD) and developed a value iteration algorithm for this representation. This paper develops several improvements to the FODD algorithm that make the approach practical. These include"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3882","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:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOjcQRPsSDFdweER/YjJtKQoYNG6xN/N7Z8bY8xxF6oLFnZVSrIYPNv/RJaJiiCCkPcyzulI7E9oPtOHo+f8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:20:36.855523Z"},"content_sha256":"087db480b5418155a0f98224369afd40e3dde7797be54eb0c095d90249b81351","schema_version":"1.0","event_id":"sha256:087db480b5418155a0f98224369afd40e3dde7797be54eb0c095d90249b81351"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CS6ZAVSH7IMURO2TA5KXWOV4BI/bundle.json","state_url":"https://pith.science/pith/CS6ZAVSH7IMURO2TA5KXWOV4BI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CS6ZAVSH7IMURO2TA5KXWOV4BI/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-30T03:20:36Z","links":{"resolver":"https://pith.science/pith/CS6ZAVSH7IMURO2TA5KXWOV4BI","bundle":"https://pith.science/pith/CS6ZAVSH7IMURO2TA5KXWOV4BI/bundle.json","state":"https://pith.science/pith/CS6ZAVSH7IMURO2TA5KXWOV4BI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CS6ZAVSH7IMURO2TA5KXWOV4BI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CS6ZAVSH7IMURO2TA5KXWOV4BI","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":"714569e78debca9063198a5d88eef2b35001e8e1298fa670fce3a0512b3c6bb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:13:02Z","title_canon_sha256":"749eae1c54385c01e3c6f5344eb7ca976ea5666f0d6a2eda4c1bbab2dbff9bf6"},"schema_version":"1.0","source":{"id":"1401.3882","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3882","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3882v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3882","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"CS6ZAVSH7IMU","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CS6ZAVSH7IMURO2T","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CS6ZAVSH","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:087db480b5418155a0f98224369afd40e3dde7797be54eb0c095d90249b81351","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diagrams, to capture domain dynamics and value functions.  Work on symbolic dynamic programming lifted these ideas to first order logic using several representation schemes.  Recent work introduced a first order variant of decision diagrams (FODD) and developed a value iteration algorithm for this representation. This paper develops several improvements to the FODD algorithm that make the approach practical. These include","authors_text":"Roni Khardon, Saket Joshi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:13:02Z","title":"Probabilistic Relational Planning with First Order Decision Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3882","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:26d75db1a50bf76fa99014495e6eee65a6dca9bf7630e069fa80f77db3f77e6c","target":"record","created_at":"2026-05-18T03:02:06Z","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":"714569e78debca9063198a5d88eef2b35001e8e1298fa670fce3a0512b3c6bb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:13:02Z","title_canon_sha256":"749eae1c54385c01e3c6f5344eb7ca976ea5666f0d6a2eda4c1bbab2dbff9bf6"},"schema_version":"1.0","source":{"id":"1401.3882","kind":"arxiv","version":1}},"canonical_sha256":"14bd905647fa1948bb5307557b3abc0a27f509149597feb0d40e7c59099a11d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14bd905647fa1948bb5307557b3abc0a27f509149597feb0d40e7c59099a11d6","first_computed_at":"2026-05-18T03:02:06.278000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.278000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NFE7THVXIlboA+aBJfgtl6LvaBNFzDQWEHR5k7NhXU3SEtN39R1vX8sbuAI2yEtJOgXCrn2GImTC5HVj4ah+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.278523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3882","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26d75db1a50bf76fa99014495e6eee65a6dca9bf7630e069fa80f77db3f77e6c","sha256:087db480b5418155a0f98224369afd40e3dde7797be54eb0c095d90249b81351"],"state_sha256":"984afcc15b594b9bde1b193129557682580b82597725761440d34d173c2d608e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OzwY8lyYbTMs7otngX4/VX8RpzV6/eD6O220GLuJzhiNMjcCjnVspnZi2XgFfcegpA835e3oAXVd1SRkuqm2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:20:36.859491Z","bundle_sha256":"ebed79142f674d2f8d72a57eabc70bac8e201839f45b9913ac5583114e49225c"}}