{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3VDMEYKKUSAH6XTMDHRL7N2AFG","short_pith_number":"pith:3VDMEYKK","schema_version":"1.0","canonical_sha256":"dd46c2614aa4807f5e6c19e2bfb74029892a68905bb9b5494881189d8f801edb","source":{"kind":"arxiv","id":"1210.4875","version":1},"attestation_state":"computed","paper":{"title":"A Theory of Goal-Oriented MDPs with Dead Ends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrey Kolobov, Daniel Weld, Mausam","submitted_at":"2012-10-16T17:42:41Z","abstract_excerpt":"Stochastic Shortest Path (SSP) MDPs is a problem class widely studied in AI, especially in probabilistic planning. They describe a wide range of scenarios but make the restrictive assumption that the goal is reachable from any state, i.e., that dead-end states do not exist. Because of this, SSPs are unable to model various scenarios that may have catastrophic events (e.g., an airplane possibly crashing if it flies into a storm). Even though MDP algorithms have been used for solving problems with dead ends, a principled theory of SSP extensions that would allow dead ends, including theoreticall"},"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":"1210.4875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:42:41Z","cross_cats_sorted":[],"title_canon_sha256":"04fbd802e945a5bbede2ec43d2fc95772470e0184e7ec168d8af40a49129792c","abstract_canon_sha256":"d44bbd3578094e3b778b167444e9483174252166c21bc32af8a82d9916213f9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.262587Z","signature_b64":"2jujvE2d/BUucYddydmCGNoMgGVOpONDkqdvnciTQW2zOqDgUYr3dVQYrHMK0O2yHXKh7D5oXgj1hftSLMWvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd46c2614aa4807f5e6c19e2bfb74029892a68905bb9b5494881189d8f801edb","last_reissued_at":"2026-05-18T03:42:55.262042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.262042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theory of Goal-Oriented MDPs with Dead Ends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrey Kolobov, Daniel Weld, Mausam","submitted_at":"2012-10-16T17:42:41Z","abstract_excerpt":"Stochastic Shortest Path (SSP) MDPs is a problem class widely studied in AI, especially in probabilistic planning. They describe a wide range of scenarios but make the restrictive assumption that the goal is reachable from any state, i.e., that dead-end states do not exist. Because of this, SSPs are unable to model various scenarios that may have catastrophic events (e.g., an airplane possibly crashing if it flies into a storm). Even though MDP algorithms have been used for solving problems with dead ends, a principled theory of SSP extensions that would allow dead ends, including theoreticall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4875","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":"1210.4875","created_at":"2026-05-18T03:42:55.262129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4875v1","created_at":"2026-05-18T03:42:55.262129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4875","created_at":"2026-05-18T03:42:55.262129+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VDMEYKKUSAH","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VDMEYKKUSAH6XTM","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VDMEYKK","created_at":"2026-05-18T12:26:53.410803+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/3VDMEYKKUSAH6XTMDHRL7N2AFG","json":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG.json","graph_json":"https://pith.science/api/pith-number/3VDMEYKKUSAH6XTMDHRL7N2AFG/graph.json","events_json":"https://pith.science/api/pith-number/3VDMEYKKUSAH6XTMDHRL7N2AFG/events.json","paper":"https://pith.science/paper/3VDMEYKK"},"agent_actions":{"view_html":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG","download_json":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG.json","view_paper":"https://pith.science/paper/3VDMEYKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4875&json=true","fetch_graph":"https://pith.science/api/pith-number/3VDMEYKKUSAH6XTMDHRL7N2AFG/graph.json","fetch_events":"https://pith.science/api/pith-number/3VDMEYKKUSAH6XTMDHRL7N2AFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/action/storage_attestation","attest_author":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/action/author_attestation","sign_citation":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/action/citation_signature","submit_replication":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/action/replication_record"}},"created_at":"2026-05-18T03:42:55.262129+00:00","updated_at":"2026-05-18T03:42:55.262129+00:00"}