{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2FJCFFR6FZ6WUKPZFNVEW52SBF","short_pith_number":"pith:2FJCFFR6","schema_version":"1.0","canonical_sha256":"d15222963e2e7d6a29f92b6a4b7752096505ab9e895da28f33e8535030e8fac2","source":{"kind":"arxiv","id":"2309.14545","version":2},"attestation_state":"computed","paper":{"title":"Motions in Microseconds via Vectorized Sampling-Based Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Lydia E. Kavraki, Wil Thomason, Zachary Kingston","submitted_at":"2023-09-25T21:42:35Z","abstract_excerpt":"Modern sampling-based motion planning algorithms typically take between hundreds of milliseconds to dozens of seconds to find collision-free motions for high degree-of-freedom problems. This paper presents performance improvements of more than 500x over the state-of-the-art, bringing planning times into the range of microseconds and solution rates into the range of kilohertz, without specialized hardware. Our key insight is how to exploit fine-grained parallelism within sampling-based planners, providing generality-preserving algorithmic improvements to any such planner and significantly accel"},"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.14545","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-25T21:42:35Z","cross_cats_sorted":[],"title_canon_sha256":"3bb78b0e2770cb31810a517539d670f43534ac31441987888cfa3027092a47b7","abstract_canon_sha256":"75431266a3b7fabed4e77314228c5e7496975637a7be29aaef9d7f33af203404"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:25.248662Z","signature_b64":"YFqunBnsNDx7q4Dh8NE4ZJKtwc/FwJzCR+UzOat9UVXYfGZqY4SWVZ7C/YbHr1az0H1VLQ5Yu8YF8QbVXtVXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15222963e2e7d6a29f92b6a4b7752096505ab9e895da28f33e8535030e8fac2","last_reissued_at":"2026-07-05T06:55:25.248192Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:25.248192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Motions in Microseconds via Vectorized Sampling-Based Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Lydia E. Kavraki, Wil Thomason, Zachary Kingston","submitted_at":"2023-09-25T21:42:35Z","abstract_excerpt":"Modern sampling-based motion planning algorithms typically take between hundreds of milliseconds to dozens of seconds to find collision-free motions for high degree-of-freedom problems. This paper presents performance improvements of more than 500x over the state-of-the-art, bringing planning times into the range of microseconds and solution rates into the range of kilohertz, without specialized hardware. Our key insight is how to exploit fine-grained parallelism within sampling-based planners, providing generality-preserving algorithmic improvements to any such planner and significantly accel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14545","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/2309.14545/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.14545","created_at":"2026-07-05T06:55:25.248250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.14545v2","created_at":"2026-07-05T06:55:25.248250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14545","created_at":"2026-07-05T06:55:25.248250+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FJCFFR6FZ6W","created_at":"2026-07-05T06:55:25.248250+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FJCFFR6FZ6WUKPZ","created_at":"2026-07-05T06:55:25.248250+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FJCFFR6","created_at":"2026-07-05T06:55:25.248250+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21001","citing_title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2FJCFFR6FZ6WUKPZFNVEW52SBF","json":"https://pith.science/pith/2FJCFFR6FZ6WUKPZFNVEW52SBF.json","graph_json":"https://pith.science/api/pith-number/2FJCFFR6FZ6WUKPZFNVEW52SBF/graph.json","events_json":"https://pith.science/api/pith-number/2FJCFFR6FZ6WUKPZFNVEW52SBF/events.json","paper":"https://pith.science/paper/2FJCFFR6"},"agent_actions":{"view_html":"https://pith.science/pith/2FJCFFR6FZ6WUKPZFNVEW52SBF","download_json":"https://pith.science/pith/2FJCFFR6FZ6WUKPZFNVEW52SBF.json","view_paper":"https://pith.science/paper/2FJCFFR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.14545&json=true","fetch_graph":"https://pith.science/api/pith-number/2FJCFFR6FZ6WUKPZFNVEW52SBF/graph.json","fetch_events":"https://pith.science/api/pith-number/2FJCFFR6FZ6WUKPZFNVEW52SBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FJCFFR6FZ6WUKPZFNVEW52SBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FJCFFR6FZ6WUKPZFNVEW52SBF/action/storage_attestation","attest_author":"https://pith.science/pith/2FJCFFR6FZ6WUKPZFNVEW52SBF/action/author_attestation","sign_citation":"https://pith.science/pith/2FJCFFR6FZ6WUKPZFNVEW52SBF/action/citation_signature","submit_replication":"https://pith.science/pith/2FJCFFR6FZ6WUKPZFNVEW52SBF/action/replication_record"}},"created_at":"2026-07-05T06:55:25.248250+00:00","updated_at":"2026-07-05T06:55:25.248250+00:00"}