{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FCUKLCTAYWEAZP67R5DQBHQNNT","short_pith_number":"pith:FCUKLCTA","canonical_record":{"source":{"id":"1708.06056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-21T02:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"30c7e60ceb6a59ff55e4eb960ffca5e909f5df3f9c890a4bbc383389d6274123","abstract_canon_sha256":"29ba653aafd29619a7189d7e208af6aad0e505527a4ba81f5e086a00fd1deb69"},"schema_version":"1.0"},"canonical_sha256":"28a8a58a60c5880cbfdf8f47009e0d6cd0b8024206545a1d723264b16db69309","source":{"kind":"arxiv","id":"1708.06056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06056","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06056v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06056","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"FCUKLCTAYWEA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCUKLCTAYWEAZP67","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCUKLCTA","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FCUKLCTAYWEAZP67R5DQBHQNNT","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-21T02:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"30c7e60ceb6a59ff55e4eb960ffca5e909f5df3f9c890a4bbc383389d6274123","abstract_canon_sha256":"29ba653aafd29619a7189d7e208af6aad0e505527a4ba81f5e086a00fd1deb69"},"schema_version":"1.0"},"canonical_sha256":"28a8a58a60c5880cbfdf8f47009e0d6cd0b8024206545a1d723264b16db69309","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:43.405027Z","signature_b64":"eXa3RJl2NrbI8duj5xVrG1d8Rev6I2Y9nf+IOMUiZWMePvuFyNvPzPLPl9JH5B5UlnOltOiRQdO12Nc6xxYqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28a8a58a60c5880cbfdf8f47009e0d6cd0b8024206545a1d723264b16db69309","last_reissued_at":"2026-05-18T00:37:43.404411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:43.404411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06056","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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Bzne4nZ6QzCQNlKuuClyBoyI3sF/K7iJ8QggpndAx+i5O7raF6zIlIxFXGFK/ToT2N53D8oaYr0hhg8zWc4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:30:03.087495Z"},"content_sha256":"b409861e38e8db0043f6061aba0ac2c58cc9b2420e53642639234bbcdcee76b7","schema_version":"1.0","event_id":"sha256:b409861e38e8db0043f6061aba0ac2c58cc9b2420e53642639234bbcdcee76b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FCUKLCTAYWEAZP67R5DQBHQNNT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integrating asymptotically-optimal path planning with local optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Richard Green, Scott Paulin, Tom Botterill, XiaoQi Chen","submitted_at":"2017-08-21T02:09:19Z","abstract_excerpt":"Many robots operating in unpredictable environments require an online path planning algorithm that can quickly compute high quality paths. Asymptotically optimal planners are capable of finding the optimal path, but can be slow to converge. Local optimisation algorithms are capable of quickly improving a solution, but are not guaranteed to converge to the optimal solution. In this paper we develop a new way to integrate an asymptotically optimal planners with a local optimiser. We test our approach using RRTConnect* with a short-cutting local optimiser. Our approach results in a significant pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06056","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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0s/Y86HOAw0JrqC8wo8UNNgllYan8VKodn/JMIwaDdw067BMKCfzr51BRXxiFFAv38eJ2UBrHJBBAdP1TplPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:30:03.088171Z"},"content_sha256":"52578c0508df0af5558593d6b975356f282c3d93fb4628d8750c547188ef3fb6","schema_version":"1.0","event_id":"sha256:52578c0508df0af5558593d6b975356f282c3d93fb4628d8750c547188ef3fb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCUKLCTAYWEAZP67R5DQBHQNNT/bundle.json","state_url":"https://pith.science/pith/FCUKLCTAYWEAZP67R5DQBHQNNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCUKLCTAYWEAZP67R5DQBHQNNT/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-05-27T23:30:03Z","links":{"resolver":"https://pith.science/pith/FCUKLCTAYWEAZP67R5DQBHQNNT","bundle":"https://pith.science/pith/FCUKLCTAYWEAZP67R5DQBHQNNT/bundle.json","state":"https://pith.science/pith/FCUKLCTAYWEAZP67R5DQBHQNNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCUKLCTAYWEAZP67R5DQBHQNNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FCUKLCTAYWEAZP67R5DQBHQNNT","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":"29ba653aafd29619a7189d7e208af6aad0e505527a4ba81f5e086a00fd1deb69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-21T02:09:19Z","title_canon_sha256":"30c7e60ceb6a59ff55e4eb960ffca5e909f5df3f9c890a4bbc383389d6274123"},"schema_version":"1.0","source":{"id":"1708.06056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06056","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06056v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06056","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"FCUKLCTAYWEA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCUKLCTAYWEAZP67","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCUKLCTA","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:52578c0508df0af5558593d6b975356f282c3d93fb4628d8750c547188ef3fb6","target":"graph","created_at":"2026-05-18T00:37:43Z","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":"Many robots operating in unpredictable environments require an online path planning algorithm that can quickly compute high quality paths. Asymptotically optimal planners are capable of finding the optimal path, but can be slow to converge. Local optimisation algorithms are capable of quickly improving a solution, but are not guaranteed to converge to the optimal solution. In this paper we develop a new way to integrate an asymptotically optimal planners with a local optimiser. We test our approach using RRTConnect* with a short-cutting local optimiser. Our approach results in a significant pe","authors_text":"Richard Green, Scott Paulin, Tom Botterill, XiaoQi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-21T02:09:19Z","title":"Integrating asymptotically-optimal path planning with local optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06056","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:b409861e38e8db0043f6061aba0ac2c58cc9b2420e53642639234bbcdcee76b7","target":"record","created_at":"2026-05-18T00:37:43Z","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":"29ba653aafd29619a7189d7e208af6aad0e505527a4ba81f5e086a00fd1deb69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-21T02:09:19Z","title_canon_sha256":"30c7e60ceb6a59ff55e4eb960ffca5e909f5df3f9c890a4bbc383389d6274123"},"schema_version":"1.0","source":{"id":"1708.06056","kind":"arxiv","version":1}},"canonical_sha256":"28a8a58a60c5880cbfdf8f47009e0d6cd0b8024206545a1d723264b16db69309","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28a8a58a60c5880cbfdf8f47009e0d6cd0b8024206545a1d723264b16db69309","first_computed_at":"2026-05-18T00:37:43.404411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:43.404411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eXa3RJl2NrbI8duj5xVrG1d8Rev6I2Y9nf+IOMUiZWMePvuFyNvPzPLPl9JH5B5UlnOltOiRQdO12Nc6xxYqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:43.405027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b409861e38e8db0043f6061aba0ac2c58cc9b2420e53642639234bbcdcee76b7","sha256:52578c0508df0af5558593d6b975356f282c3d93fb4628d8750c547188ef3fb6"],"state_sha256":"149ed0ab39ad33b146afafe573f2933eb525b72115bb7bc35271d379a65aff65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDLW7q2QicO4/7nBa7mjNSmuKU6HO2ot20gmawAUHf7qDosiDQ2zQggmr48F0pyNPn5AIJJlFz0cEjbdTWkFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:30:03.091719Z","bundle_sha256":"ce2e30c97c664b7026df057dc567d6983d2fb2ba3b5bef8313f1e7d665e06ba2"}}