{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:I6SE5VC5CJU4G27FCQPSETUZLA","short_pith_number":"pith:I6SE5VC5","schema_version":"1.0","canonical_sha256":"47a44ed45d1269c36be5141f224e99580b34deb483db0ae40612258d53ba8db5","source":{"kind":"arxiv","id":"2309.13119","version":1},"attestation_state":"computed","paper":{"title":"Sampling-Based Motion Planning: A Comparative Review","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Andreas Orthey, Constantinos Chamzas, Lydia E. Kavraki","submitted_at":"2023-09-22T18:00:35Z","abstract_excerpt":"Sampling-based motion planning is one of the fundamental paradigms to generate robot motions, and a cornerstone of robotics research. This comparative review provides an up-to-date guideline and reference manual for the use of sampling-based motion planning algorithms. This includes a history of motion planning, an overview about the most successful planners, and a discussion on their properties. It is also shown how planners can handle special cases and how extensions of motion planning can be accommodated. To put sampling-based motion planning into a larger context, a discussion of alternati"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.13119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-22T18:00:35Z","cross_cats_sorted":[],"title_canon_sha256":"b8bf6e625297e1737670888528be0be52f21b6c0449d9aac1971705a2a45a643","abstract_canon_sha256":"f8b94f31b1c33710bc340d303183fe7c6b52d332e68693405500797951ef3568"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:47.340617Z","signature_b64":"SDHkpl1GG/xyZubnbHOMq2LwQXHcho/2r445vBj7S+sYXfu7VxJlH4ZM3Fs8BNrwQmD7v+UcLpbwkgR5fQvyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47a44ed45d1269c36be5141f224e99580b34deb483db0ae40612258d53ba8db5","last_reissued_at":"2026-07-05T06:53:47.340099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:47.340099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling-Based Motion Planning: A Comparative Review","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Andreas Orthey, Constantinos Chamzas, Lydia E. Kavraki","submitted_at":"2023-09-22T18:00:35Z","abstract_excerpt":"Sampling-based motion planning is one of the fundamental paradigms to generate robot motions, and a cornerstone of robotics research. This comparative review provides an up-to-date guideline and reference manual for the use of sampling-based motion planning algorithms. This includes a history of motion planning, an overview about the most successful planners, and a discussion on their properties. It is also shown how planners can handle special cases and how extensions of motion planning can be accommodated. To put sampling-based motion planning into a larger context, a discussion of alternati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.13119","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.13119/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.13119","created_at":"2026-07-05T06:53:47.340161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.13119v1","created_at":"2026-07-05T06:53:47.340161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.13119","created_at":"2026-07-05T06:53:47.340161+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6SE5VC5CJU4","created_at":"2026-07-05T06:53:47.340161+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6SE5VC5CJU4G27F","created_at":"2026-07-05T06:53:47.340161+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6SE5VC5","created_at":"2026-07-05T06:53:47.340161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08521","citing_title":"FMT$^{\\mathrm{X}}$: Lazy Wavefront Search for Dynamic Replanning","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I6SE5VC5CJU4G27FCQPSETUZLA","json":"https://pith.science/pith/I6SE5VC5CJU4G27FCQPSETUZLA.json","graph_json":"https://pith.science/api/pith-number/I6SE5VC5CJU4G27FCQPSETUZLA/graph.json","events_json":"https://pith.science/api/pith-number/I6SE5VC5CJU4G27FCQPSETUZLA/events.json","paper":"https://pith.science/paper/I6SE5VC5"},"agent_actions":{"view_html":"https://pith.science/pith/I6SE5VC5CJU4G27FCQPSETUZLA","download_json":"https://pith.science/pith/I6SE5VC5CJU4G27FCQPSETUZLA.json","view_paper":"https://pith.science/paper/I6SE5VC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.13119&json=true","fetch_graph":"https://pith.science/api/pith-number/I6SE5VC5CJU4G27FCQPSETUZLA/graph.json","fetch_events":"https://pith.science/api/pith-number/I6SE5VC5CJU4G27FCQPSETUZLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6SE5VC5CJU4G27FCQPSETUZLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6SE5VC5CJU4G27FCQPSETUZLA/action/storage_attestation","attest_author":"https://pith.science/pith/I6SE5VC5CJU4G27FCQPSETUZLA/action/author_attestation","sign_citation":"https://pith.science/pith/I6SE5VC5CJU4G27FCQPSETUZLA/action/citation_signature","submit_replication":"https://pith.science/pith/I6SE5VC5CJU4G27FCQPSETUZLA/action/replication_record"}},"created_at":"2026-07-05T06:53:47.340161+00:00","updated_at":"2026-07-05T06:53:47.340161+00:00"}