{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QJJBPBZEO7RPHNACDG5ZYBNM3D","short_pith_number":"pith:QJJBPBZE","canonical_record":{"source":{"id":"1302.4952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:20:57Z","cross_cats_sorted":[],"title_canon_sha256":"3fd6b0d7a71e0935db89192c97c31a06a901e4ce3653dcf31ce8ce5b3ec1e9ea","abstract_canon_sha256":"b77df3e3dec73c24ac01a57ce30aff94da68bfd34906337ac7307a1376771e38"},"schema_version":"1.0"},"canonical_sha256":"825217872477e2f3b40219bb9c05acd8fc3dafe66263686dc96dbecec714aa6e","source":{"kind":"arxiv","id":"1302.4952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4952","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4952v1","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4952","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"QJJBPBZEO7RP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QJJBPBZEO7RPHNAC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QJJBPBZE","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QJJBPBZEO7RPHNACDG5ZYBNM3D","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:20:57Z","cross_cats_sorted":[],"title_canon_sha256":"3fd6b0d7a71e0935db89192c97c31a06a901e4ce3653dcf31ce8ce5b3ec1e9ea","abstract_canon_sha256":"b77df3e3dec73c24ac01a57ce30aff94da68bfd34906337ac7307a1376771e38"},"schema_version":"1.0"},"canonical_sha256":"825217872477e2f3b40219bb9c05acd8fc3dafe66263686dc96dbecec714aa6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:00.899861Z","signature_b64":"4HnuwQ/4LPF4PH4NUGVc5nT5adaUyQaqOQaeIcYXPj4+Prqdx4iAgWluUzaBfeZIB+84YdqYZVigtbKUM/bTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"825217872477e2f3b40219bb9c05acd8fc3dafe66263686dc96dbecec714aa6e","last_reissued_at":"2026-05-18T03:33:00.899049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:00.899049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4952","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDDRjAb2/mmsaZtTg3YngLfCr3z5626DJ0FfNH2qAosqrX0ipN5Ju0dy/oU9nBhXO7eaL0R/P8q10XQ6/sVkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:59:47.702405Z"},"content_sha256":"4efc5023db426ced8e760ceb00d50504d2713d781c0198a06c78abb62c61aaea","schema_version":"1.0","event_id":"sha256:4efc5023db426ced8e760ceb00d50504d2713d781c0198a06c78abb62c61aaea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QJJBPBZEO7RPHNACDG5ZYBNM3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Decision-Theoretic Planning: Techniques and Empirical Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"AnHai Doan, Peter Haddawy, Richard Goodwin","submitted_at":"2013-02-20T15:20:57Z","abstract_excerpt":"This paper discusses techniques for performing efficient decision-theoretic planning.  We give an overview of the DRIPS decision-theoretic refinement planning system, which uses abstraction to efficiently identify optimal plans.  We present techniques for automatically generating search control information, which can significantly improve the planner's performance.  We evaluate the efficiency of DRIPS both with and without the search control rules on a complex medical planning problem and compare its performance to that of a branch-and-bound decision tree algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4952","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cSaAHcNfiHGcDsR+GwCrvQ0dpkVWEAXjqAwd9lj6Tk4s1cXntLgTv6k4HIz67oKPvm0qWWLojPgakZ1hxAzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:59:47.703004Z"},"content_sha256":"eaaac80073962fc0f11b8ae9d51dc226f8034d7c940e1e385db077048eb31d37","schema_version":"1.0","event_id":"sha256:eaaac80073962fc0f11b8ae9d51dc226f8034d7c940e1e385db077048eb31d37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJJBPBZEO7RPHNACDG5ZYBNM3D/bundle.json","state_url":"https://pith.science/pith/QJJBPBZEO7RPHNACDG5ZYBNM3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJJBPBZEO7RPHNACDG5ZYBNM3D/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-27T17:59:47Z","links":{"resolver":"https://pith.science/pith/QJJBPBZEO7RPHNACDG5ZYBNM3D","bundle":"https://pith.science/pith/QJJBPBZEO7RPHNACDG5ZYBNM3D/bundle.json","state":"https://pith.science/pith/QJJBPBZEO7RPHNACDG5ZYBNM3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJJBPBZEO7RPHNACDG5ZYBNM3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QJJBPBZEO7RPHNACDG5ZYBNM3D","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":"b77df3e3dec73c24ac01a57ce30aff94da68bfd34906337ac7307a1376771e38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:20:57Z","title_canon_sha256":"3fd6b0d7a71e0935db89192c97c31a06a901e4ce3653dcf31ce8ce5b3ec1e9ea"},"schema_version":"1.0","source":{"id":"1302.4952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4952","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4952v1","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4952","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"QJJBPBZEO7RP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QJJBPBZEO7RPHNAC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QJJBPBZE","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:eaaac80073962fc0f11b8ae9d51dc226f8034d7c940e1e385db077048eb31d37","target":"graph","created_at":"2026-05-18T03:33:00Z","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":"This paper discusses techniques for performing efficient decision-theoretic planning.  We give an overview of the DRIPS decision-theoretic refinement planning system, which uses abstraction to efficiently identify optimal plans.  We present techniques for automatically generating search control information, which can significantly improve the planner's performance.  We evaluate the efficiency of DRIPS both with and without the search control rules on a complex medical planning problem and compare its performance to that of a branch-and-bound decision tree algorithm.","authors_text":"AnHai Doan, Peter Haddawy, Richard Goodwin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:20:57Z","title":"Efficient Decision-Theoretic Planning: Techniques and Empirical Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4952","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:4efc5023db426ced8e760ceb00d50504d2713d781c0198a06c78abb62c61aaea","target":"record","created_at":"2026-05-18T03:33:00Z","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":"b77df3e3dec73c24ac01a57ce30aff94da68bfd34906337ac7307a1376771e38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:20:57Z","title_canon_sha256":"3fd6b0d7a71e0935db89192c97c31a06a901e4ce3653dcf31ce8ce5b3ec1e9ea"},"schema_version":"1.0","source":{"id":"1302.4952","kind":"arxiv","version":1}},"canonical_sha256":"825217872477e2f3b40219bb9c05acd8fc3dafe66263686dc96dbecec714aa6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"825217872477e2f3b40219bb9c05acd8fc3dafe66263686dc96dbecec714aa6e","first_computed_at":"2026-05-18T03:33:00.899049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:00.899049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4HnuwQ/4LPF4PH4NUGVc5nT5adaUyQaqOQaeIcYXPj4+Prqdx4iAgWluUzaBfeZIB+84YdqYZVigtbKUM/bTCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:00.899861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4efc5023db426ced8e760ceb00d50504d2713d781c0198a06c78abb62c61aaea","sha256:eaaac80073962fc0f11b8ae9d51dc226f8034d7c940e1e385db077048eb31d37"],"state_sha256":"942b1b09c20d5b2847649088f2364b178cc1b57aef27c2f64c570660658e3da0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HO/BWh8yVQwozdgChCFmSK8t6gA8kYJzEtucWn1T5z9bXtjWQP+x8DGGyn0IvYkVWZLxuThjVdxhjeIX/d8iAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:59:47.706342Z","bundle_sha256":"fe0be5e94d19fb7f1a39018c7523266e920a97a1d457a5adb85eeff831dcde8b"}}