{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QNXPUDXHETIIBJVH6WBLF57BXY","short_pith_number":"pith:QNXPUDXH","canonical_record":{"source":{"id":"1704.04585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-15T05:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"458385de067733607db85a4d97cc664d28e7f00b769d577329d99bb0f22134ed","abstract_canon_sha256":"22a41590f176b9964623d9e633ace334c7b5dc8cae57d6d5fb88e5e676a3ef13"},"schema_version":"1.0"},"canonical_sha256":"836efa0ee724d080a6a7f582b2f7e1be2ab6c06572437e318974ee25b5b6646c","source":{"kind":"arxiv","id":"1704.04585","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04585","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04585v1","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04585","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"QNXPUDXHETII","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QNXPUDXHETIIBJVH","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QNXPUDXH","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QNXPUDXHETIIBJVH6WBLF57BXY","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-15T05:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"458385de067733607db85a4d97cc664d28e7f00b769d577329d99bb0f22134ed","abstract_canon_sha256":"22a41590f176b9964623d9e633ace334c7b5dc8cae57d6d5fb88e5e676a3ef13"},"schema_version":"1.0"},"canonical_sha256":"836efa0ee724d080a6a7f582b2f7e1be2ab6c06572437e318974ee25b5b6646c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.150815Z","signature_b64":"FS3TgANuPSbctrxpB585rwroBLGBeftLsycIrw8KqZ31em1fSOBOwZuC81OuUEQlSbJjZZGAjOuAG7kRgsyvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"836efa0ee724d080a6a7f582b2f7e1be2ab6c06572437e318974ee25b5b6646c","last_reissued_at":"2026-05-18T00:46:18.150376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.150376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04585","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-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdlB6cDBanZk7hWVZpKnPZJYPPzsa4K2zxnKG1usMN4n/nEkH8FfEVzLgj60T23o1N9yibky2ZZjfG7pg7cvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:39:13.648931Z"},"content_sha256":"2615d6722e91990f26872a13a5555c85c86c6a45d3f996f27e2d5ac9cf4aa8a0","schema_version":"1.0","event_id":"sha256:2615d6722e91990f26872a13a5555c85c86c6a45d3f996f27e2d5ac9cf4aa8a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QNXPUDXHETIIBJVH6WBLF57BXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Path Planning and Replanning for Mobile Robots using RRT*","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Devin Connell, Hung Manh La","submitted_at":"2017-04-15T05:03:57Z","abstract_excerpt":"It is necessary for a mobile robot to be able to efficiently plan a path from its starting, or current, location to a desired goal location. This is a trivial task when the environment is static. However, the operational environment of the robot is rarely static, and it often has many moving obstacles. The robot may encounter one, or many, of these unknown and unpredictable moving obstacles. The robot will need to decide how to proceed when one of these obstacles is obstructing it's path. A method of dynamic replanning using RRT* is presented. The robot will modify it's current plan when an un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04585","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-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMNDKuHIBxRY60MdquOEaA51Ol4l1zSopayiYcjjf0UFMQB9vJp+qZ2XVEQVNkBv5ztV/gX/YjzdG61YcvWdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:39:13.649584Z"},"content_sha256":"511f5a33578a0f6e3b650058a45b798f21655eae9eba962b81b62e2cc6bef078","schema_version":"1.0","event_id":"sha256:511f5a33578a0f6e3b650058a45b798f21655eae9eba962b81b62e2cc6bef078"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNXPUDXHETIIBJVH6WBLF57BXY/bundle.json","state_url":"https://pith.science/pith/QNXPUDXHETIIBJVH6WBLF57BXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNXPUDXHETIIBJVH6WBLF57BXY/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-08T14:39:13Z","links":{"resolver":"https://pith.science/pith/QNXPUDXHETIIBJVH6WBLF57BXY","bundle":"https://pith.science/pith/QNXPUDXHETIIBJVH6WBLF57BXY/bundle.json","state":"https://pith.science/pith/QNXPUDXHETIIBJVH6WBLF57BXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNXPUDXHETIIBJVH6WBLF57BXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QNXPUDXHETIIBJVH6WBLF57BXY","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":"22a41590f176b9964623d9e633ace334c7b5dc8cae57d6d5fb88e5e676a3ef13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-15T05:03:57Z","title_canon_sha256":"458385de067733607db85a4d97cc664d28e7f00b769d577329d99bb0f22134ed"},"schema_version":"1.0","source":{"id":"1704.04585","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04585","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04585v1","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04585","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"QNXPUDXHETII","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QNXPUDXHETIIBJVH","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QNXPUDXH","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:511f5a33578a0f6e3b650058a45b798f21655eae9eba962b81b62e2cc6bef078","target":"graph","created_at":"2026-05-18T00:46:18Z","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":"It is necessary for a mobile robot to be able to efficiently plan a path from its starting, or current, location to a desired goal location. This is a trivial task when the environment is static. However, the operational environment of the robot is rarely static, and it often has many moving obstacles. The robot may encounter one, or many, of these unknown and unpredictable moving obstacles. The robot will need to decide how to proceed when one of these obstacles is obstructing it's path. A method of dynamic replanning using RRT* is presented. The robot will modify it's current plan when an un","authors_text":"Devin Connell, Hung Manh La","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-15T05:03:57Z","title":"Dynamic Path Planning and Replanning for Mobile Robots using RRT*"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04585","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:2615d6722e91990f26872a13a5555c85c86c6a45d3f996f27e2d5ac9cf4aa8a0","target":"record","created_at":"2026-05-18T00:46:18Z","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":"22a41590f176b9964623d9e633ace334c7b5dc8cae57d6d5fb88e5e676a3ef13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-15T05:03:57Z","title_canon_sha256":"458385de067733607db85a4d97cc664d28e7f00b769d577329d99bb0f22134ed"},"schema_version":"1.0","source":{"id":"1704.04585","kind":"arxiv","version":1}},"canonical_sha256":"836efa0ee724d080a6a7f582b2f7e1be2ab6c06572437e318974ee25b5b6646c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"836efa0ee724d080a6a7f582b2f7e1be2ab6c06572437e318974ee25b5b6646c","first_computed_at":"2026-05-18T00:46:18.150376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:18.150376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FS3TgANuPSbctrxpB585rwroBLGBeftLsycIrw8KqZ31em1fSOBOwZuC81OuUEQlSbJjZZGAjOuAG7kRgsyvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:18.150815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04585","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2615d6722e91990f26872a13a5555c85c86c6a45d3f996f27e2d5ac9cf4aa8a0","sha256:511f5a33578a0f6e3b650058a45b798f21655eae9eba962b81b62e2cc6bef078"],"state_sha256":"9c928ca0e92b2d58635c3359e85fb58521b0ef469fed73aecc93acd4d13f69bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1vSSGBqhe30PoU6kQ+XYBIRw9MMLe9TPUJNSKYxomWH0gOIvB2o7n1qnEREOukw6CHk2EMPPvXDTgWmK45zAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:39:13.652892Z","bundle_sha256":"7928b58cd36336a11051b0fa927ea2c03c06e4dd000b297e943d46a9cae5d599"}}