{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6GWX2LENKN3XNJJZBH3OSPQ7PB","short_pith_number":"pith:6GWX2LEN","canonical_record":{"source":{"id":"1802.00898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-03T02:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"2db7794d47bd1a1e27e6cdc65932acbc705f095c19fcb0262ab1e05b7ea94454","abstract_canon_sha256":"39b13ecfd0b2e156fd999814e88bc13cacd37f7d5a951871e96f4a391b2efdca"},"schema_version":"1.0"},"canonical_sha256":"f1ad7d2c8d537776a53909f6e93e1f7865f783389b5c1a674c321ba9323ec8de","source":{"kind":"arxiv","id":"1802.00898","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00898","created_at":"2026-05-18T00:07:40Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00898v2","created_at":"2026-05-18T00:07:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00898","created_at":"2026-05-18T00:07:40Z"},{"alias_kind":"pith_short_12","alias_value":"6GWX2LENKN3X","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6GWX2LENKN3XNJJZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6GWX2LEN","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6GWX2LENKN3XNJJZBH3OSPQ7PB","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-03T02:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"2db7794d47bd1a1e27e6cdc65932acbc705f095c19fcb0262ab1e05b7ea94454","abstract_canon_sha256":"39b13ecfd0b2e156fd999814e88bc13cacd37f7d5a951871e96f4a391b2efdca"},"schema_version":"1.0"},"canonical_sha256":"f1ad7d2c8d537776a53909f6e93e1f7865f783389b5c1a674c321ba9323ec8de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:40.864199Z","signature_b64":"lvfrwiiLsbxTERlEaRKEJriOraDIpkLRJRIrbi44b4Hu+kRwBHWfiUZI+2G2Uzf4q9LZbcmvF3jcZn7HtC8HBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1ad7d2c8d537776a53909f6e93e1f7865f783389b5c1a674c321ba9323ec8de","last_reissued_at":"2026-05-18T00:07:40.863729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:40.863729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00898","source_version":2,"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-18T00:07:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"es+qtlsQGRT1hI06tVrnxF/m2/YZR79Lf+mZVdjlXdeRTT1dl7aYfa78cYFRAy8dwSXTdxRzK49sXLRuOmTlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:36:20.240773Z"},"content_sha256":"f7d25a55f5a7e4e874669a4e0fc1ae1dc44bca158329eab064e2ec061db0cf36","schema_version":"1.0","event_id":"sha256:f7d25a55f5a7e4e874669a4e0fc1ae1dc44bca158329eab064e2ec061db0cf36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6GWX2LENKN3XNJJZBH3OSPQ7PB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path Planning for Minimizing the Expected Cost until Success","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Arjun Muralidharan, Yasamin Mostofi","submitted_at":"2018-02-03T02:54:06Z","abstract_excerpt":"Consider a general path planning problem of a robot on a graph with edge costs, and where each node has a Boolean value of success or failure (with respect to some task) with a given probability. The objective is to plan a path for the robot on the graph that minimizes the expected cost until success. In this paper, it is our goal to bring a foundational understanding to this problem. We start by showing how this problem can be optimally solved by formulating it as an infinite horizon Markov Decision Process, but with an exponential space complexity. We then formally prove its NP-hardness. To "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00898","kind":"arxiv","version":2},"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-18T00:07:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIbcwo/j95mrs+bTpizoeOqzBQ3/g1ze3TdLn7zHjvCkI7OuYEroGheD7h39KkOcgIqk7AWhWUrRQ7XNjPYqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:36:20.241518Z"},"content_sha256":"8f2671da56575fbe0f5e29af46c16acbf5915441717a124e5d09c035ff963bc5","schema_version":"1.0","event_id":"sha256:8f2671da56575fbe0f5e29af46c16acbf5915441717a124e5d09c035ff963bc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GWX2LENKN3XNJJZBH3OSPQ7PB/bundle.json","state_url":"https://pith.science/pith/6GWX2LENKN3XNJJZBH3OSPQ7PB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GWX2LENKN3XNJJZBH3OSPQ7PB/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-10T13:36:20Z","links":{"resolver":"https://pith.science/pith/6GWX2LENKN3XNJJZBH3OSPQ7PB","bundle":"https://pith.science/pith/6GWX2LENKN3XNJJZBH3OSPQ7PB/bundle.json","state":"https://pith.science/pith/6GWX2LENKN3XNJJZBH3OSPQ7PB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GWX2LENKN3XNJJZBH3OSPQ7PB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6GWX2LENKN3XNJJZBH3OSPQ7PB","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":"39b13ecfd0b2e156fd999814e88bc13cacd37f7d5a951871e96f4a391b2efdca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-03T02:54:06Z","title_canon_sha256":"2db7794d47bd1a1e27e6cdc65932acbc705f095c19fcb0262ab1e05b7ea94454"},"schema_version":"1.0","source":{"id":"1802.00898","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00898","created_at":"2026-05-18T00:07:40Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00898v2","created_at":"2026-05-18T00:07:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00898","created_at":"2026-05-18T00:07:40Z"},{"alias_kind":"pith_short_12","alias_value":"6GWX2LENKN3X","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6GWX2LENKN3XNJJZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6GWX2LEN","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:8f2671da56575fbe0f5e29af46c16acbf5915441717a124e5d09c035ff963bc5","target":"graph","created_at":"2026-05-18T00:07:40Z","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":"Consider a general path planning problem of a robot on a graph with edge costs, and where each node has a Boolean value of success or failure (with respect to some task) with a given probability. The objective is to plan a path for the robot on the graph that minimizes the expected cost until success. In this paper, it is our goal to bring a foundational understanding to this problem. We start by showing how this problem can be optimally solved by formulating it as an infinite horizon Markov Decision Process, but with an exponential space complexity. We then formally prove its NP-hardness. To ","authors_text":"Arjun Muralidharan, Yasamin Mostofi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-03T02:54:06Z","title":"Path Planning for Minimizing the Expected Cost until Success"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00898","kind":"arxiv","version":2},"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:f7d25a55f5a7e4e874669a4e0fc1ae1dc44bca158329eab064e2ec061db0cf36","target":"record","created_at":"2026-05-18T00:07:40Z","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":"39b13ecfd0b2e156fd999814e88bc13cacd37f7d5a951871e96f4a391b2efdca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-02-03T02:54:06Z","title_canon_sha256":"2db7794d47bd1a1e27e6cdc65932acbc705f095c19fcb0262ab1e05b7ea94454"},"schema_version":"1.0","source":{"id":"1802.00898","kind":"arxiv","version":2}},"canonical_sha256":"f1ad7d2c8d537776a53909f6e93e1f7865f783389b5c1a674c321ba9323ec8de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1ad7d2c8d537776a53909f6e93e1f7865f783389b5c1a674c321ba9323ec8de","first_computed_at":"2026-05-18T00:07:40.863729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:40.863729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lvfrwiiLsbxTERlEaRKEJriOraDIpkLRJRIrbi44b4Hu+kRwBHWfiUZI+2G2Uzf4q9LZbcmvF3jcZn7HtC8HBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:40.864199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00898","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7d25a55f5a7e4e874669a4e0fc1ae1dc44bca158329eab064e2ec061db0cf36","sha256:8f2671da56575fbe0f5e29af46c16acbf5915441717a124e5d09c035ff963bc5"],"state_sha256":"7bdfb227e94408fb817a9524fe74d2e778d938984edf53b782068464b1b18a06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6qm/th4L8VmSegqL3LGtzbQFR/8VvMX7sl5QfEfoFIHsn1Wo67buc34eGGhH8m5+4YuHkfAslHL+ANztYv4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:36:20.245305Z","bundle_sha256":"2cf8a37489595443bc0f54bb4dcaa89181f75632286ce1e7061c11fa1704dea0"}}