{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SUX664HEDSLLA5VS3K3YTV2YY4","short_pith_number":"pith:SUX664HE","canonical_record":{"source":{"id":"1302.1540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:55:32Z","cross_cats_sorted":[],"title_canon_sha256":"c7a1129b4e9e8136e6d7c0f6050507a5adc9e79f9e6239e084b57d64834f00e1","abstract_canon_sha256":"7bed39c3a49d2f243ffcab2206e8bae951e20b642595d72f1dcf8bf6ee825c78"},"schema_version":"1.0"},"canonical_sha256":"952fef70e41c96b076b2dab789d758c737bbe91da0a77555cda87e6fc6ab714b","source":{"kind":"arxiv","id":"1302.1540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1540","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1540v1","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1540","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"pith_short_12","alias_value":"SUX664HEDSLL","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SUX664HEDSLLA5VS","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SUX664HE","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SUX664HEDSLLA5VS3K3YTV2YY4","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:55:32Z","cross_cats_sorted":[],"title_canon_sha256":"c7a1129b4e9e8136e6d7c0f6050507a5adc9e79f9e6239e084b57d64834f00e1","abstract_canon_sha256":"7bed39c3a49d2f243ffcab2206e8bae951e20b642595d72f1dcf8bf6ee825c78"},"schema_version":"1.0"},"canonical_sha256":"952fef70e41c96b076b2dab789d758c737bbe91da0a77555cda87e6fc6ab714b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:23.854135Z","signature_b64":"MMmXIh4ab/tbnqP3e6jj/pv/VRQHs8TYyTr/jmbBsxyeXMrsoAFBQtNJnt9Pn38QBHXBEov9CPfsXPrTblSmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"952fef70e41c96b076b2dab789d758c737bbe91da0a77555cda87e6fc6ab714b","last_reissued_at":"2026-05-18T03:34:23.853712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:23.853712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1540","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":"you7v1eSKtK1rHjBbk9avI1rKusAl+aPwp+C5FKkKUa+Vn6eSZqv3Voex57FJNbDio+ljHh1gv8xf1SlZBgbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:59:52.049049Z"},"content_sha256":"0d351529383d59b1f1e38022600e643c1e8e3a2f928a40b340de2ede3e82f45f","schema_version":"1.0","event_id":"sha256:0d351529383d59b1f1e38022600e643c1e8e3a2f928a40b340de2ede3e82f45f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SUX664HEDSLLA5VS3K3YTV2YY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Plan Existence and Evaluation in Probabilistic Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Judy Goldsmith, Martin Mundhenk, Michael L. Littman","submitted_at":"2013-02-06T15:55:32Z","abstract_excerpt":"We examine the computational complexity of testing and finding small plans in probabilistic planning domains with succinct representations.  We find that many problems of interest are complete for a variety of complexity classes: NP, co-NP, PP, NP^PP, co-NP^PP, and PSPACE.  Of these, the probabilistic classes PP and NP^PP are likely to be of special interest in the field of uncertainty in artificial intelligence and are deserving of additional study.  These results suggest a fruitful direction of future algorithmic development."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1540","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":"wv7cNO/xEccmsmEcTpbL4OaOii5GDEH6+fmM4d3tRftVM+PpHxt6q1n8RxBKNe1JnvjBia9zeVX0ctdDty0VBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:59:52.049799Z"},"content_sha256":"375a49b1b5718919db1dc06e17b1c1342e1ed7f7b9e83549a4a76df5169cfcbe","schema_version":"1.0","event_id":"sha256:375a49b1b5718919db1dc06e17b1c1342e1ed7f7b9e83549a4a76df5169cfcbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4/bundle.json","state_url":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUX664HEDSLLA5VS3K3YTV2YY4/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-10T10:59:52Z","links":{"resolver":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4","bundle":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4/bundle.json","state":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUX664HEDSLLA5VS3K3YTV2YY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SUX664HEDSLLA5VS3K3YTV2YY4","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":"7bed39c3a49d2f243ffcab2206e8bae951e20b642595d72f1dcf8bf6ee825c78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:55:32Z","title_canon_sha256":"c7a1129b4e9e8136e6d7c0f6050507a5adc9e79f9e6239e084b57d64834f00e1"},"schema_version":"1.0","source":{"id":"1302.1540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1540","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1540v1","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1540","created_at":"2026-05-18T03:34:23Z"},{"alias_kind":"pith_short_12","alias_value":"SUX664HEDSLL","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SUX664HEDSLLA5VS","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SUX664HE","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:375a49b1b5718919db1dc06e17b1c1342e1ed7f7b9e83549a4a76df5169cfcbe","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":"We examine the computational complexity of testing and finding small plans in probabilistic planning domains with succinct representations.  We find that many problems of interest are complete for a variety of complexity classes: NP, co-NP, PP, NP^PP, co-NP^PP, and PSPACE.  Of these, the probabilistic classes PP and NP^PP are likely to be of special interest in the field of uncertainty in artificial intelligence and are deserving of additional study.  These results suggest a fruitful direction of future algorithmic development.","authors_text":"Judy Goldsmith, Martin Mundhenk, Michael L. Littman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:55:32Z","title":"The Complexity of Plan Existence and Evaluation in Probabilistic Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1540","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:0d351529383d59b1f1e38022600e643c1e8e3a2f928a40b340de2ede3e82f45f","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":"7bed39c3a49d2f243ffcab2206e8bae951e20b642595d72f1dcf8bf6ee825c78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:55:32Z","title_canon_sha256":"c7a1129b4e9e8136e6d7c0f6050507a5adc9e79f9e6239e084b57d64834f00e1"},"schema_version":"1.0","source":{"id":"1302.1540","kind":"arxiv","version":1}},"canonical_sha256":"952fef70e41c96b076b2dab789d758c737bbe91da0a77555cda87e6fc6ab714b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"952fef70e41c96b076b2dab789d758c737bbe91da0a77555cda87e6fc6ab714b","first_computed_at":"2026-05-18T03:34:23.853712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:23.853712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMmXIh4ab/tbnqP3e6jj/pv/VRQHs8TYyTr/jmbBsxyeXMrsoAFBQtNJnt9Pn38QBHXBEov9CPfsXPrTblSmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:23.854135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d351529383d59b1f1e38022600e643c1e8e3a2f928a40b340de2ede3e82f45f","sha256:375a49b1b5718919db1dc06e17b1c1342e1ed7f7b9e83549a4a76df5169cfcbe"],"state_sha256":"1d0d547c6502458086016f184295de7d36b22d3b5a00a723d73041a538f686d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nO/UBXsMxr+vaYw9vC56PQ3Ztc1MiH9VDBpd/FRRQ/FpfZszbuTNWxwwUv/xhEaWvqox/4CoM4gckcl4P2q2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:59:52.055866Z","bundle_sha256":"582c17802407a5758bb7851192d6244e87a76a8223f5f62f23e95aa28a86e9e5"}}