{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SUX664HEDSLLA5VS3K3YTV2YY4","short_pith_number":"pith:SUX664HE","schema_version":"1.0","canonical_sha256":"952fef70e41c96b076b2dab789d758c737bbe91da0a77555cda87e6fc6ab714b","source":{"kind":"arxiv","id":"1302.1540","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.1540","created_at":"2026-05-18T03:34:23.853778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1540v1","created_at":"2026-05-18T03:34:23.853778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1540","created_at":"2026-05-18T03:34:23.853778+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUX664HEDSLL","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUX664HEDSLLA5VS","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUX664HE","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4","json":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4.json","graph_json":"https://pith.science/api/pith-number/SUX664HEDSLLA5VS3K3YTV2YY4/graph.json","events_json":"https://pith.science/api/pith-number/SUX664HEDSLLA5VS3K3YTV2YY4/events.json","paper":"https://pith.science/paper/SUX664HE"},"agent_actions":{"view_html":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4","download_json":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4.json","view_paper":"https://pith.science/paper/SUX664HE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1540&json=true","fetch_graph":"https://pith.science/api/pith-number/SUX664HEDSLLA5VS3K3YTV2YY4/graph.json","fetch_events":"https://pith.science/api/pith-number/SUX664HEDSLLA5VS3K3YTV2YY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4/action/storage_attestation","attest_author":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4/action/author_attestation","sign_citation":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4/action/citation_signature","submit_replication":"https://pith.science/pith/SUX664HEDSLLA5VS3K3YTV2YY4/action/replication_record"}},"created_at":"2026-05-18T03:34:23.853778+00:00","updated_at":"2026-05-18T03:34:23.853778+00:00"}