{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EAMWNJW6OP67CKSR7UTNVGXQAP","short_pith_number":"pith:EAMWNJW6","canonical_record":{"source":{"id":"1303.5740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"d199f78111876f335b316c7d66309baa280830e4d379758002ff3b65be0547ae","abstract_canon_sha256":"dd1c4b0af9fb0f5ddde347970313e60862350ad48ce4acc23e8ca2274681078a"},"schema_version":"1.0"},"canonical_sha256":"201966a6de73fdf12a51fd26da9af003fa68c99462e274833817b6db408f23aa","source":{"kind":"arxiv","id":"1303.5740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5740","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5740v1","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5740","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"EAMWNJW6OP67","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EAMWNJW6OP67CKSR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EAMWNJW6","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EAMWNJW6OP67CKSR7UTNVGXQAP","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"d199f78111876f335b316c7d66309baa280830e4d379758002ff3b65be0547ae","abstract_canon_sha256":"dd1c4b0af9fb0f5ddde347970313e60862350ad48ce4acc23e8ca2274681078a"},"schema_version":"1.0"},"canonical_sha256":"201966a6de73fdf12a51fd26da9af003fa68c99462e274833817b6db408f23aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:01.468547Z","signature_b64":"TiSP1NhX5m5j/I8uZbqIWr+qklmprU/D8xmgcJaYn9E9Fi1aF1sthAjvMlR4cguy+/Js5ngmRT13DlhrYPQWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201966a6de73fdf12a51fd26da9af003fa68c99462e274833817b6db408f23aa","last_reissued_at":"2026-05-18T03:30:01.467968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:01.467968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5740","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:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wePGt9nhYFIwbY4AiLV01NitDPhy9Sx0HbP593m+ulFV+PjuLMKgXE1KI1O/YwANS44b7hge/S3RC5VW1iPpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:44:23.436758Z"},"content_sha256":"2947d6c81c9ee81292b0301809b9603be223fe91c601bf31980ed6e9fdbb70df","schema_version":"1.0","event_id":"sha256:2947d6c81c9ee81292b0301809b9603be223fe91c601bf31980ed6e9fdbb70df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EAMWNJW6OP67CKSR7UTNVGXQAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High Level Path Planning with Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David L. Poole, Runping Qi","submitted_at":"2013-03-20T15:32:32Z","abstract_excerpt":"For high level path planning, environments are usually modeled as distance graphs, and path planning problems are reduced to computing the shortest path in distance graphs. One major drawback of this modeling is the inability to model uncertainties, which are often encountered in practice.  In this paper, a new tool, called U-yraph, is proposed for environment modeling.  A U-graph is an extension of distance graphs with the ability to handle a kind of uncertainty.  By modeling an uncertain environment as a U-graph, and a navigation problem as a Markovian decision process, we can precisely defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5740","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:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/E/qJwfxxfUFoZsBNyJtbWwma4D+XZ2iPthJ8zhyLfkLTsY2JwIlHkuuRGyeA3fo1XSVhgQQbtLNAj8y9SWCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:44:23.437095Z"},"content_sha256":"ed9861e8356073871872a702b42b0418e7d5a469fb7616d09ae073741f4d5345","schema_version":"1.0","event_id":"sha256:ed9861e8356073871872a702b42b0418e7d5a469fb7616d09ae073741f4d5345"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAMWNJW6OP67CKSR7UTNVGXQAP/bundle.json","state_url":"https://pith.science/pith/EAMWNJW6OP67CKSR7UTNVGXQAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAMWNJW6OP67CKSR7UTNVGXQAP/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-27T04:44:23Z","links":{"resolver":"https://pith.science/pith/EAMWNJW6OP67CKSR7UTNVGXQAP","bundle":"https://pith.science/pith/EAMWNJW6OP67CKSR7UTNVGXQAP/bundle.json","state":"https://pith.science/pith/EAMWNJW6OP67CKSR7UTNVGXQAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAMWNJW6OP67CKSR7UTNVGXQAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EAMWNJW6OP67CKSR7UTNVGXQAP","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":"dd1c4b0af9fb0f5ddde347970313e60862350ad48ce4acc23e8ca2274681078a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:32:32Z","title_canon_sha256":"d199f78111876f335b316c7d66309baa280830e4d379758002ff3b65be0547ae"},"schema_version":"1.0","source":{"id":"1303.5740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5740","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5740v1","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5740","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"EAMWNJW6OP67","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EAMWNJW6OP67CKSR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EAMWNJW6","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:ed9861e8356073871872a702b42b0418e7d5a469fb7616d09ae073741f4d5345","target":"graph","created_at":"2026-05-18T03:30:01Z","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":"For high level path planning, environments are usually modeled as distance graphs, and path planning problems are reduced to computing the shortest path in distance graphs. One major drawback of this modeling is the inability to model uncertainties, which are often encountered in practice.  In this paper, a new tool, called U-yraph, is proposed for environment modeling.  A U-graph is an extension of distance graphs with the ability to handle a kind of uncertainty.  By modeling an uncertain environment as a U-graph, and a navigation problem as a Markovian decision process, we can precisely defi","authors_text":"David L. Poole, Runping Qi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:32:32Z","title":"High Level Path Planning with Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5740","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:2947d6c81c9ee81292b0301809b9603be223fe91c601bf31980ed6e9fdbb70df","target":"record","created_at":"2026-05-18T03:30:01Z","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":"dd1c4b0af9fb0f5ddde347970313e60862350ad48ce4acc23e8ca2274681078a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:32:32Z","title_canon_sha256":"d199f78111876f335b316c7d66309baa280830e4d379758002ff3b65be0547ae"},"schema_version":"1.0","source":{"id":"1303.5740","kind":"arxiv","version":1}},"canonical_sha256":"201966a6de73fdf12a51fd26da9af003fa68c99462e274833817b6db408f23aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"201966a6de73fdf12a51fd26da9af003fa68c99462e274833817b6db408f23aa","first_computed_at":"2026-05-18T03:30:01.467968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:01.467968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TiSP1NhX5m5j/I8uZbqIWr+qklmprU/D8xmgcJaYn9E9Fi1aF1sthAjvMlR4cguy+/Js5ngmRT13DlhrYPQWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:01.468547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2947d6c81c9ee81292b0301809b9603be223fe91c601bf31980ed6e9fdbb70df","sha256:ed9861e8356073871872a702b42b0418e7d5a469fb7616d09ae073741f4d5345"],"state_sha256":"f69c6b595f7a82f2b3be6903b177c1b70b60cddf507d4c01698ac1e20522e591"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bve5QTydw0Ltd7UscONF0YFCKd8TFcFZGpBj4YCkjr9RvRl8hyWRhgLwownB0rdUALbDfMAsRz1DRoloP2/tAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:44:23.439022Z","bundle_sha256":"d3fbc4bcad3c6feacd7d4bdda75d90cb6d8e21ba2a9ece36e0f352c7dfc640b6"}}