{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MEQTT24E333RQBUPFASCVUVENV","short_pith_number":"pith:MEQTT24E","canonical_record":{"source":{"id":"2111.00383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-10-31T02:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"b0d6b9ab1bd5e5350fbfa02280778ef3a9ec2de0a9789175bc95151a26d94a58","abstract_canon_sha256":"e5d986aec4aeae7d72da0cbbcd44c18eee1e2aaf052ce91a12c43d8059334764"},"schema_version":"1.0"},"canonical_sha256":"612139eb84def718068f28242ad2a46d563e2370db90fae54fa6f70c367d2e52","source":{"kind":"arxiv","id":"2111.00383","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00383","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00383v2","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00383","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"MEQTT24E333R","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"pith_short_16","alias_value":"MEQTT24E333RQBUP","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"pith_short_8","alias_value":"MEQTT24E","created_at":"2026-07-05T06:13:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MEQTT24E333RQBUPFASCVUVENV","target":"record","payload":{"canonical_record":{"source":{"id":"2111.00383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-10-31T02:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"b0d6b9ab1bd5e5350fbfa02280778ef3a9ec2de0a9789175bc95151a26d94a58","abstract_canon_sha256":"e5d986aec4aeae7d72da0cbbcd44c18eee1e2aaf052ce91a12c43d8059334764"},"schema_version":"1.0"},"canonical_sha256":"612139eb84def718068f28242ad2a46d563e2370db90fae54fa6f70c367d2e52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:35.887635Z","signature_b64":"26zFKyXS81iu8rTPaX788RaxX+9Wk6YGhCdrCxSJywo3UgK1UJNgjXDKggl9EnRPEwNmxeJ1yUdlOiZWx1inBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"612139eb84def718068f28242ad2a46d563e2370db90fae54fa6f70c367d2e52","last_reissued_at":"2026-07-05T06:13:35.887221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:35.887221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.00383","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-07-05T06:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrOn154DymhwDyN4TkYl3AK21NcndrKr+Fvgg6LekX/pSdISnsVQGcpt4c5AGKyYnCURqmYTTku4ysCH8VE7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:01:02.901188Z"},"content_sha256":"108f6c1fc9723bd8dfee5c844d392156a17db73b4d02f5d7f2022e514dac93d5","schema_version":"1.0","event_id":"sha256:108f6c1fc9723bd8dfee5c844d392156a17db73b4d02f5d7f2022e514dac93d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MEQTT24E333RQBUPFASCVUVENV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relevant Region Sampling Strategy with Adaptive Heuristic for Asymptotically Optimal Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chenming Li, Fei Meng, Han Ma, Jiankun Wang, Max Q.-H. Meng","submitted_at":"2021-10-31T02:35:19Z","abstract_excerpt":"Sampling-based planning algorithm is a powerful tool for solving planning problems in high-dimensional state spaces. In this article, we present a novel approach to sampling in the most promising regions, which significantly reduces planning time-consumption. The RRT# algorithm defines the Relevant Region based on the cost-to-come provided by the optimal forward-searching tree. However, it uses the cumulative cost of a direct connection between the current state and the goal state as the cost-to-go. To improve the path planning efficiency, we propose a batch sampling method that samples in a r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00383","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.00383/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqtFlNSJWKhNBXHFknzXP0s57m3FiWLZ4xf6PwY1RxpC28BbwD7gUmeW8I60/AQ02DEBI4nRAZfhXWIwsnsnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:01:02.901579Z"},"content_sha256":"fb16c2efc17189958d12b43c285b392c2e40b3bf4910ad49a14d93171631053f","schema_version":"1.0","event_id":"sha256:fb16c2efc17189958d12b43c285b392c2e40b3bf4910ad49a14d93171631053f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEQTT24E333RQBUPFASCVUVENV/bundle.json","state_url":"https://pith.science/pith/MEQTT24E333RQBUPFASCVUVENV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEQTT24E333RQBUPFASCVUVENV/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-07-09T06:01:02Z","links":{"resolver":"https://pith.science/pith/MEQTT24E333RQBUPFASCVUVENV","bundle":"https://pith.science/pith/MEQTT24E333RQBUPFASCVUVENV/bundle.json","state":"https://pith.science/pith/MEQTT24E333RQBUPFASCVUVENV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEQTT24E333RQBUPFASCVUVENV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MEQTT24E333RQBUPFASCVUVENV","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":"e5d986aec4aeae7d72da0cbbcd44c18eee1e2aaf052ce91a12c43d8059334764","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-10-31T02:35:19Z","title_canon_sha256":"b0d6b9ab1bd5e5350fbfa02280778ef3a9ec2de0a9789175bc95151a26d94a58"},"schema_version":"1.0","source":{"id":"2111.00383","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00383","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00383v2","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00383","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"MEQTT24E333R","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"pith_short_16","alias_value":"MEQTT24E333RQBUP","created_at":"2026-07-05T06:13:35Z"},{"alias_kind":"pith_short_8","alias_value":"MEQTT24E","created_at":"2026-07-05T06:13:35Z"}],"graph_snapshots":[{"event_id":"sha256:fb16c2efc17189958d12b43c285b392c2e40b3bf4910ad49a14d93171631053f","target":"graph","created_at":"2026-07-05T06:13:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.00383/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sampling-based planning algorithm is a powerful tool for solving planning problems in high-dimensional state spaces. In this article, we present a novel approach to sampling in the most promising regions, which significantly reduces planning time-consumption. The RRT# algorithm defines the Relevant Region based on the cost-to-come provided by the optimal forward-searching tree. However, it uses the cumulative cost of a direct connection between the current state and the goal state as the cost-to-go. To improve the path planning efficiency, we propose a batch sampling method that samples in a r","authors_text":"Chenming Li, Fei Meng, Han Ma, Jiankun Wang, Max Q.-H. Meng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-10-31T02:35:19Z","title":"Relevant Region Sampling Strategy with Adaptive Heuristic for Asymptotically Optimal Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00383","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:108f6c1fc9723bd8dfee5c844d392156a17db73b4d02f5d7f2022e514dac93d5","target":"record","created_at":"2026-07-05T06:13:35Z","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":"e5d986aec4aeae7d72da0cbbcd44c18eee1e2aaf052ce91a12c43d8059334764","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-10-31T02:35:19Z","title_canon_sha256":"b0d6b9ab1bd5e5350fbfa02280778ef3a9ec2de0a9789175bc95151a26d94a58"},"schema_version":"1.0","source":{"id":"2111.00383","kind":"arxiv","version":2}},"canonical_sha256":"612139eb84def718068f28242ad2a46d563e2370db90fae54fa6f70c367d2e52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"612139eb84def718068f28242ad2a46d563e2370db90fae54fa6f70c367d2e52","first_computed_at":"2026-07-05T06:13:35.887221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:13:35.887221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"26zFKyXS81iu8rTPaX788RaxX+9Wk6YGhCdrCxSJywo3UgK1UJNgjXDKggl9EnRPEwNmxeJ1yUdlOiZWx1inBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:13:35.887635Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.00383","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:108f6c1fc9723bd8dfee5c844d392156a17db73b4d02f5d7f2022e514dac93d5","sha256:fb16c2efc17189958d12b43c285b392c2e40b3bf4910ad49a14d93171631053f"],"state_sha256":"1222f79738aa150ac5fe3476288853013cae70bc8e6deec027333616d242b669"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ipEdBQiR4Bscn9c+tJt64nwENGbEct97mOy5mvxtrtZ+9bX6ka4mPqib1M181gssmYy+WB1b7xFMC3jwB5xaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:01:02.903666Z","bundle_sha256":"a42e79d83ac01b9c3aef5970a37da071782016982bdc925d4528b36cff5e39ff"}}