{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JMHOAKBJVU2YD22Q4FIRAYMR6O","short_pith_number":"pith:JMHOAKBJ","schema_version":"1.0","canonical_sha256":"4b0ee02829ad3581eb50e151106191f38a957391f8f71257ed3348b422d83a26","source":{"kind":"arxiv","id":"2504.10783","version":1},"attestation_state":"computed","paper":{"title":"Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Daniela Rus, Peter Werner, Richard Cheng, Russ Tedrake, Tom Stewart","submitted_at":"2025-04-15T00:54:55Z","abstract_excerpt":"In this work, we leverage GPUs to construct probabilistically collision-free convex sets in robot configuration space on the fly. This extends the use of modern motion planning algorithms that leverage such representations to changing environments. These planners rapidly and reliably optimize high-quality trajectories, without the burden of challenging nonconvex collision-avoidance constraints. We present an algorithm that inflates collision-free piecewise linear paths into sequences of convex sets (SCS) that are probabilistically collision-free using massive parallelism. We then integrate thi"},"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":"2504.10783","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2025-04-15T00:54:55Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"ada0a9d609ee7df42b06f585a23fb99bb60f0ae7da40aaac51361e662572abc9","abstract_canon_sha256":"35409eaa875eb33a1ef10cc483f7ab0ba5b4eefc53375db208d2b49cc6b6d082"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:24.280913Z","signature_b64":"+fSOC1nhsKD85BTmMNqlGA5K2WE/MpjTc6npR3RSHPAkBbc3KfNAlAtD0NeMschn8pwX62MjVRYqBBFhFPxeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b0ee02829ad3581eb50e151106191f38a957391f8f71257ed3348b422d83a26","last_reissued_at":"2026-07-05T10:49:24.280442Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:24.280442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Daniela Rus, Peter Werner, Richard Cheng, Russ Tedrake, Tom Stewart","submitted_at":"2025-04-15T00:54:55Z","abstract_excerpt":"In this work, we leverage GPUs to construct probabilistically collision-free convex sets in robot configuration space on the fly. This extends the use of modern motion planning algorithms that leverage such representations to changing environments. These planners rapidly and reliably optimize high-quality trajectories, without the burden of challenging nonconvex collision-avoidance constraints. We present an algorithm that inflates collision-free piecewise linear paths into sequences of convex sets (SCS) that are probabilistically collision-free using massive parallelism. We then integrate thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10783","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/2504.10783/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":"2504.10783","created_at":"2026-07-05T10:49:24.280500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.10783v1","created_at":"2026-07-05T10:49:24.280500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10783","created_at":"2026-07-05T10:49:24.280500+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMHOAKBJVU2Y","created_at":"2026-07-05T10:49:24.280500+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMHOAKBJVU2YD22Q","created_at":"2026-07-05T10:49:24.280500+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMHOAKBJ","created_at":"2026-07-05T10:49:24.280500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00444","citing_title":"Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets","ref_index":75,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07038","citing_title":"Learning Material-Aware Hamiltonian Risk Fields for Safe Navigation","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07038","citing_title":"Learning Material-Aware Hamiltonian Risk Fields for Safe Navigation","ref_index":152,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JMHOAKBJVU2YD22Q4FIRAYMR6O","json":"https://pith.science/pith/JMHOAKBJVU2YD22Q4FIRAYMR6O.json","graph_json":"https://pith.science/api/pith-number/JMHOAKBJVU2YD22Q4FIRAYMR6O/graph.json","events_json":"https://pith.science/api/pith-number/JMHOAKBJVU2YD22Q4FIRAYMR6O/events.json","paper":"https://pith.science/paper/JMHOAKBJ"},"agent_actions":{"view_html":"https://pith.science/pith/JMHOAKBJVU2YD22Q4FIRAYMR6O","download_json":"https://pith.science/pith/JMHOAKBJVU2YD22Q4FIRAYMR6O.json","view_paper":"https://pith.science/paper/JMHOAKBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.10783&json=true","fetch_graph":"https://pith.science/api/pith-number/JMHOAKBJVU2YD22Q4FIRAYMR6O/graph.json","fetch_events":"https://pith.science/api/pith-number/JMHOAKBJVU2YD22Q4FIRAYMR6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMHOAKBJVU2YD22Q4FIRAYMR6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMHOAKBJVU2YD22Q4FIRAYMR6O/action/storage_attestation","attest_author":"https://pith.science/pith/JMHOAKBJVU2YD22Q4FIRAYMR6O/action/author_attestation","sign_citation":"https://pith.science/pith/JMHOAKBJVU2YD22Q4FIRAYMR6O/action/citation_signature","submit_replication":"https://pith.science/pith/JMHOAKBJVU2YD22Q4FIRAYMR6O/action/replication_record"}},"created_at":"2026-07-05T10:49:24.280500+00:00","updated_at":"2026-07-05T10:49:24.280500+00:00"}