{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:V3YEJHP5EN3S4GWWMJFNSAPSPW","short_pith_number":"pith:V3YEJHP5","canonical_record":{"source":{"id":"1612.07333","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-21T21:04:14Z","cross_cats_sorted":[],"title_canon_sha256":"d80b52c7e31404b96a701f09d29d2024b39740f61bd3508e3dd6e7ad14485001","abstract_canon_sha256":"ee019e78a1d71f1f011f95cf03aed8f9fce0f2eaebd9c1513b0b89621e941f31"},"schema_version":"1.0"},"canonical_sha256":"aef0449dfd23772e1ad6624ad901f27daa3a24129aaad197f5fa95f1f91929cf","source":{"kind":"arxiv","id":"1612.07333","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07333","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07333v2","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07333","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"V3YEJHP5EN3S","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V3YEJHP5EN3S4GWW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V3YEJHP5","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:V3YEJHP5EN3S4GWWMJFNSAPSPW","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07333","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-21T21:04:14Z","cross_cats_sorted":[],"title_canon_sha256":"d80b52c7e31404b96a701f09d29d2024b39740f61bd3508e3dd6e7ad14485001","abstract_canon_sha256":"ee019e78a1d71f1f011f95cf03aed8f9fce0f2eaebd9c1513b0b89621e941f31"},"schema_version":"1.0"},"canonical_sha256":"aef0449dfd23772e1ad6624ad901f27daa3a24129aaad197f5fa95f1f91929cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:57.294157Z","signature_b64":"3F8tYfNacJvICbuf5/Lcdze7dCdytqZrs5pk1wDoJKmrAV/56AyFrGXKA8Pn1Tr8g8VzDefA38WIIClZNV8fCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aef0449dfd23772e1ad6624ad901f27daa3a24129aaad197f5fa95f1f91929cf","last_reissued_at":"2026-05-18T00:53:57.293633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:57.293633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07333","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:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qOggzfmjRGuBo4UtSjIvYS6bg2mS965xll+KO6OkakR6FakHDL3Bc8/pPXFxQiLT6tAwyB/NjTMe1FY6oI2LAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:28:47.360086Z"},"content_sha256":"2d356a0b5e3cdd57099f18c4ef6519e76f896b6abaf844b7c6579253e09263c1","schema_version":"1.0","event_id":"sha256:2d356a0b5e3cdd57099f18c4ef6519e76f896b6abaf844b7c6579253e09263c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:V3YEJHP5EN3S4GWWMJFNSAPSPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RRT+ : Fast Planning for High-Dimensional Configuration Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ioannis Rekleitis, Jason M. O'Kane, Marios Xanthidis","submitted_at":"2016-12-21T21:04:14Z","abstract_excerpt":"In this paper we propose a new family of RRT based algorithms, named RRT+ , that are able to find faster solutions in high-dimensional configuration spaces compared to other existing RRT variants by finding paths in lower dimensional subspaces of the configuration space. The method can be easily applied to complex hyper-redundant systems and can be adapted by other RRT based planners. We introduce RRT+ and develop some variants, called PrioritizedRRT+ , PrioritizedRRT+-Connect, and PrioritizedBidirectionalT-RRT+ , that use the new sampling technique and we show that our method provides faster "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07333","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:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hehwE0QY2tSALfAYOQCosmMWANLrQO1vpf9m6unlXYaAZEHu63ZyfKBe71TkM4FO4tkL5qkXHp33Vlf1PxKFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:28:47.360742Z"},"content_sha256":"3e00009b3708e9b9f298e6a8ecf78ddd6582614755d39027e18b2fb0a127c59e","schema_version":"1.0","event_id":"sha256:3e00009b3708e9b9f298e6a8ecf78ddd6582614755d39027e18b2fb0a127c59e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3YEJHP5EN3S4GWWMJFNSAPSPW/bundle.json","state_url":"https://pith.science/pith/V3YEJHP5EN3S4GWWMJFNSAPSPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3YEJHP5EN3S4GWWMJFNSAPSPW/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-28T18:28:47Z","links":{"resolver":"https://pith.science/pith/V3YEJHP5EN3S4GWWMJFNSAPSPW","bundle":"https://pith.science/pith/V3YEJHP5EN3S4GWWMJFNSAPSPW/bundle.json","state":"https://pith.science/pith/V3YEJHP5EN3S4GWWMJFNSAPSPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3YEJHP5EN3S4GWWMJFNSAPSPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:V3YEJHP5EN3S4GWWMJFNSAPSPW","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":"ee019e78a1d71f1f011f95cf03aed8f9fce0f2eaebd9c1513b0b89621e941f31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-21T21:04:14Z","title_canon_sha256":"d80b52c7e31404b96a701f09d29d2024b39740f61bd3508e3dd6e7ad14485001"},"schema_version":"1.0","source":{"id":"1612.07333","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07333","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07333v2","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07333","created_at":"2026-05-18T00:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"V3YEJHP5EN3S","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V3YEJHP5EN3S4GWW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V3YEJHP5","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:3e00009b3708e9b9f298e6a8ecf78ddd6582614755d39027e18b2fb0a127c59e","target":"graph","created_at":"2026-05-18T00:53:57Z","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":"In this paper we propose a new family of RRT based algorithms, named RRT+ , that are able to find faster solutions in high-dimensional configuration spaces compared to other existing RRT variants by finding paths in lower dimensional subspaces of the configuration space. The method can be easily applied to complex hyper-redundant systems and can be adapted by other RRT based planners. We introduce RRT+ and develop some variants, called PrioritizedRRT+ , PrioritizedRRT+-Connect, and PrioritizedBidirectionalT-RRT+ , that use the new sampling technique and we show that our method provides faster ","authors_text":"Ioannis Rekleitis, Jason M. O'Kane, Marios Xanthidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-21T21:04:14Z","title":"RRT+ : Fast Planning for High-Dimensional Configuration Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07333","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:2d356a0b5e3cdd57099f18c4ef6519e76f896b6abaf844b7c6579253e09263c1","target":"record","created_at":"2026-05-18T00:53:57Z","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":"ee019e78a1d71f1f011f95cf03aed8f9fce0f2eaebd9c1513b0b89621e941f31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-12-21T21:04:14Z","title_canon_sha256":"d80b52c7e31404b96a701f09d29d2024b39740f61bd3508e3dd6e7ad14485001"},"schema_version":"1.0","source":{"id":"1612.07333","kind":"arxiv","version":2}},"canonical_sha256":"aef0449dfd23772e1ad6624ad901f27daa3a24129aaad197f5fa95f1f91929cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aef0449dfd23772e1ad6624ad901f27daa3a24129aaad197f5fa95f1f91929cf","first_computed_at":"2026-05-18T00:53:57.293633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:57.293633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3F8tYfNacJvICbuf5/Lcdze7dCdytqZrs5pk1wDoJKmrAV/56AyFrGXKA8Pn1Tr8g8VzDefA38WIIClZNV8fCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:57.294157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07333","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d356a0b5e3cdd57099f18c4ef6519e76f896b6abaf844b7c6579253e09263c1","sha256:3e00009b3708e9b9f298e6a8ecf78ddd6582614755d39027e18b2fb0a127c59e"],"state_sha256":"5f878267fc55353bdc7edbd731a3459af39edfb5c5297afca78d57bcfaf17b07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8p0yW44Kfw2TcFDoLyAkKcu6amQsuLfjTAdZ6AsBgW6M8IUyRK2hQfdRXvq8fBs9wJNM+/rySa/LoFSrFU2ZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:28:47.364847Z","bundle_sha256":"8995b18ad199a1e337a36fb95af7b275e27caf7d1a5b8b8dd99c26139b36251d"}}