{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3VDMEYKKUSAH6XTMDHRL7N2AFG","short_pith_number":"pith:3VDMEYKK","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"},"canonical_sha256":"dd46c2614aa4807f5e6c19e2bfb74029892a68905bb9b5494881189d8f801edb","source":{"kind":"arxiv","id":"1210.4875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4875","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4875v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4875","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"3VDMEYKKUSAH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3VDMEYKKUSAH6XTM","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3VDMEYKK","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3VDMEYKKUSAH6XTMDHRL7N2AFG","target":"record","payload":{"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"},"canonical_sha256":"dd46c2614aa4807f5e6c19e2bfb74029892a68905bb9b5494881189d8f801edb","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"},"source_kind":"arxiv","source_id":"1210.4875","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:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijHCpIRDkiowG9t8U0axz6h6lCCKgpiZd5jJg3jKRWwgrU+EsVE1Jcm/lqhctZo1VPuTez4h+75hwrszQt+qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:21:10.373572Z"},"content_sha256":"77ad8a3617d28f1364ace6c53ebed6da3e61da86ef4b21a1854afc740e1d8918","schema_version":"1.0","event_id":"sha256:77ad8a3617d28f1364ace6c53ebed6da3e61da86ef4b21a1854afc740e1d8918"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3VDMEYKKUSAH6XTMDHRL7N2AFG","target":"graph","payload":{"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"},"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:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uR/uHarAeFwM1BtmszXz9oYq9142VrVlt5jvkX2hWj6itr7XfpO2J4D8wOohGnW4ttTYnEFnSx2vhFfjEk//Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:21:10.373916Z"},"content_sha256":"ca8b12dd38824c338d8d8e09516e132a1afd4bf323e5e45bc5b7fee737931045","schema_version":"1.0","event_id":"sha256:ca8b12dd38824c338d8d8e09516e132a1afd4bf323e5e45bc5b7fee737931045"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/bundle.json","state_url":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/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-07-01T22:21:10Z","links":{"resolver":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG","bundle":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/bundle.json","state":"https://pith.science/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VDMEYKKUSAH6XTMDHRL7N2AFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3VDMEYKKUSAH6XTMDHRL7N2AFG","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":"d44bbd3578094e3b778b167444e9483174252166c21bc32af8a82d9916213f9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:42:41Z","title_canon_sha256":"04fbd802e945a5bbede2ec43d2fc95772470e0184e7ec168d8af40a49129792c"},"schema_version":"1.0","source":{"id":"1210.4875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4875","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4875v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4875","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"3VDMEYKKUSAH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3VDMEYKKUSAH6XTM","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3VDMEYKK","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:ca8b12dd38824c338d8d8e09516e132a1afd4bf323e5e45bc5b7fee737931045","target":"graph","created_at":"2026-05-18T03:42:55Z","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":"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","authors_text":"Andrey Kolobov, Daniel Weld, Mausam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:42:41Z","title":"A Theory of Goal-Oriented MDPs with Dead Ends"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4875","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:77ad8a3617d28f1364ace6c53ebed6da3e61da86ef4b21a1854afc740e1d8918","target":"record","created_at":"2026-05-18T03:42:55Z","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":"d44bbd3578094e3b778b167444e9483174252166c21bc32af8a82d9916213f9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:42:41Z","title_canon_sha256":"04fbd802e945a5bbede2ec43d2fc95772470e0184e7ec168d8af40a49129792c"},"schema_version":"1.0","source":{"id":"1210.4875","kind":"arxiv","version":1}},"canonical_sha256":"dd46c2614aa4807f5e6c19e2bfb74029892a68905bb9b5494881189d8f801edb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd46c2614aa4807f5e6c19e2bfb74029892a68905bb9b5494881189d8f801edb","first_computed_at":"2026-05-18T03:42:55.262042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:55.262042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2jujvE2d/BUucYddydmCGNoMgGVOpONDkqdvnciTQW2zOqDgUYr3dVQYrHMK0O2yHXKh7D5oXgj1hftSLMWvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:55.262587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77ad8a3617d28f1364ace6c53ebed6da3e61da86ef4b21a1854afc740e1d8918","sha256:ca8b12dd38824c338d8d8e09516e132a1afd4bf323e5e45bc5b7fee737931045"],"state_sha256":"c7b785b7b18943f0529a87c5805163801b454a3f63463b195936af7aad115474"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+S5hiMFhUaaxxj/pyxA4QUU3Ytmt/RNneSFuGfRPfsIrF6XMpmOylH93kz+5C5ByFGicwTgnef4JbhKcsyaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T22:21:10.375838Z","bundle_sha256":"df0411d6541d6eab3ac0624f467dc43548ed79e60262765ad8c522d47067e32f"}}