{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WKJHR7J5MJEFEVYHT53BZL2GMG","short_pith_number":"pith:WKJHR7J5","canonical_record":{"source":{"id":"1704.00264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-02T08:21:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c91f204c25c2d11204c867472f398bf802ad64c2ad9d0b6244036a3e8076b7d2","abstract_canon_sha256":"1e90d3e2f50a5e0f4201faf784ee990bc76e4d7e2c46a9adbaf93c5d817400a8"},"schema_version":"1.0"},"canonical_sha256":"b29278fd3d62485257079f761caf46619ce1adbbf1321ea4d65d722cea8c555a","source":{"kind":"arxiv","id":"1704.00264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00264","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00264v1","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00264","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"pith_short_12","alias_value":"WKJHR7J5MJEF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WKJHR7J5MJEFEVYH","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WKJHR7J5","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WKJHR7J5MJEFEVYHT53BZL2GMG","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-02T08:21:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c91f204c25c2d11204c867472f398bf802ad64c2ad9d0b6244036a3e8076b7d2","abstract_canon_sha256":"1e90d3e2f50a5e0f4201faf784ee990bc76e4d7e2c46a9adbaf93c5d817400a8"},"schema_version":"1.0"},"canonical_sha256":"b29278fd3d62485257079f761caf46619ce1adbbf1321ea4d65d722cea8c555a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:24.988064Z","signature_b64":"5FV62WU1HquYqcmnjin16/22FtxxEgiSIGOFFBejzq7Gxe+PzLYDjQS3jk6g3GLpLFN+9noVHaqWAcTqtFTXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b29278fd3d62485257079f761caf46619ce1adbbf1321ea4d65d722cea8c555a","last_reissued_at":"2026-05-18T00:47:24.987398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:24.987398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00264","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:47:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPcRiCbL/7YnIg8ncqN02IZ4KSQ4uut6wKBoLx/EE1plEeKGNCiog3rh1iRnIz708sKb8IoaDBY5/cUu+6srCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:22:32.117577Z"},"content_sha256":"51e144b42a6ce29bdb101186539279019db9d126f489a5ff3fb852aea7f131b7","schema_version":"1.0","event_id":"sha256:51e144b42a6ce29bdb101186539279019db9d126f489a5ff3fb852aea7f131b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WKJHR7J5MJEFEVYHT53BZL2GMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Potential Functions based Sampling Heuristic For Optimal Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Ahmed Hussain Qureshi, Yasar Ayaz","submitted_at":"2017-04-02T08:21:30Z","abstract_excerpt":"Rapidly-exploring Random Tree Star(RRT*) is a recently proposed extension of Rapidly-exploring Random Tree (RRT) algorithm that provides a collision-free, asymptotically optimal path regardless of obstacle's geometry in a given environment. However, one of the limitations in the RRT* algorithm is slow convergence to optimal path solution. As a result, it consumes high memory as well as time due to a large number of iterations utilised in achieving optimal path solution. To overcome these limitations, we propose the Potential Function Based-RRT* (P-RRT*) that incorporates the Artificial Potenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00264","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:47:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtDXD/P+OTz8X2OlUay5e7tXlaBr8eOo6bqlt4EcEAZT5DCBF9GZKgjxzvgn377QBb2xAWIrFMfut2h7hIEmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:22:32.117939Z"},"content_sha256":"f835807c2ddb09917bfa06dc1654d067a9ad20e66453f9446b8fa19c7c02caa2","schema_version":"1.0","event_id":"sha256:f835807c2ddb09917bfa06dc1654d067a9ad20e66453f9446b8fa19c7c02caa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKJHR7J5MJEFEVYHT53BZL2GMG/bundle.json","state_url":"https://pith.science/pith/WKJHR7J5MJEFEVYHT53BZL2GMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKJHR7J5MJEFEVYHT53BZL2GMG/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-08-17T01:22:32Z","links":{"resolver":"https://pith.science/pith/WKJHR7J5MJEFEVYHT53BZL2GMG","bundle":"https://pith.science/pith/WKJHR7J5MJEFEVYHT53BZL2GMG/bundle.json","state":"https://pith.science/pith/WKJHR7J5MJEFEVYHT53BZL2GMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKJHR7J5MJEFEVYHT53BZL2GMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WKJHR7J5MJEFEVYHT53BZL2GMG","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":"1e90d3e2f50a5e0f4201faf784ee990bc76e4d7e2c46a9adbaf93c5d817400a8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-02T08:21:30Z","title_canon_sha256":"c91f204c25c2d11204c867472f398bf802ad64c2ad9d0b6244036a3e8076b7d2"},"schema_version":"1.0","source":{"id":"1704.00264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00264","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00264v1","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00264","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"pith_short_12","alias_value":"WKJHR7J5MJEF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WKJHR7J5MJEFEVYH","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WKJHR7J5","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:f835807c2ddb09917bfa06dc1654d067a9ad20e66453f9446b8fa19c7c02caa2","target":"graph","created_at":"2026-05-18T00:47:24Z","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":"Rapidly-exploring Random Tree Star(RRT*) is a recently proposed extension of Rapidly-exploring Random Tree (RRT) algorithm that provides a collision-free, asymptotically optimal path regardless of obstacle's geometry in a given environment. However, one of the limitations in the RRT* algorithm is slow convergence to optimal path solution. As a result, it consumes high memory as well as time due to a large number of iterations utilised in achieving optimal path solution. To overcome these limitations, we propose the Potential Function Based-RRT* (P-RRT*) that incorporates the Artificial Potenti","authors_text":"Ahmed Hussain Qureshi, Yasar Ayaz","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-02T08:21:30Z","title":"Potential Functions based Sampling Heuristic For Optimal Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00264","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:51e144b42a6ce29bdb101186539279019db9d126f489a5ff3fb852aea7f131b7","target":"record","created_at":"2026-05-18T00:47:24Z","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":"1e90d3e2f50a5e0f4201faf784ee990bc76e4d7e2c46a9adbaf93c5d817400a8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-04-02T08:21:30Z","title_canon_sha256":"c91f204c25c2d11204c867472f398bf802ad64c2ad9d0b6244036a3e8076b7d2"},"schema_version":"1.0","source":{"id":"1704.00264","kind":"arxiv","version":1}},"canonical_sha256":"b29278fd3d62485257079f761caf46619ce1adbbf1321ea4d65d722cea8c555a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b29278fd3d62485257079f761caf46619ce1adbbf1321ea4d65d722cea8c555a","first_computed_at":"2026-05-18T00:47:24.987398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:24.987398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5FV62WU1HquYqcmnjin16/22FtxxEgiSIGOFFBejzq7Gxe+PzLYDjQS3jk6g3GLpLFN+9noVHaqWAcTqtFTXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:24.988064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51e144b42a6ce29bdb101186539279019db9d126f489a5ff3fb852aea7f131b7","sha256:f835807c2ddb09917bfa06dc1654d067a9ad20e66453f9446b8fa19c7c02caa2"],"state_sha256":"b946ecac527fdf76ba25f25b65ae9f9f828769a39c86cabfe95571e996ac79c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPZchW+BDx0snuz6yiBOPAWlhw8OxaRBk/ymceZR9nTMaZxDB8f90P9TUAPDUTUCfjNbsjgbq1yapogBEA24Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T01:22:32.120747Z","bundle_sha256":"169b892295fb2e63d5f6cc5c0d8a6414e8583b8bf08c5c4ce1f6f888436af3db"}}