{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VHN32YIPIJ3XNVSOKSXJ3SCEG2","short_pith_number":"pith:VHN32YIP","schema_version":"1.0","canonical_sha256":"a9dbbd610f427776d64e54ae9dc844368ae42667f9e914ebecc2059b63081f2f","source":{"kind":"arxiv","id":"2403.10745","version":1},"attestation_state":"computed","paper":{"title":"iDb-RRT: Sampling-based Kinodynamic Motion Planning with Motion Primitives and Trajectory Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Joaquim Ortiz-Haro, Ludovic Righetti, Marc Toussaint, Valentin N. Hartmann, Wolfgang H\\\"onig","submitted_at":"2024-03-16T00:34:00Z","abstract_excerpt":"Rapidly-exploring Random Trees (RRT) and its variations have emerged as a robust and efficient tool for finding collision-free paths in robotic systems. However, adding dynamic constraints makes the motion planning problem significantly harder, as it requires solving two-value boundary problems (computationally expensive) or propagating random control inputs (uninformative). Alternatively, Iterative Discontinuity Bounded A* (iDb-A*), introduced in our previous study, combines search and optimization iteratively. The search step connects short trajectories (motion primitives) while allowing a b"},"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":"2403.10745","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-16T00:34:00Z","cross_cats_sorted":[],"title_canon_sha256":"2529e71c88f0aa27cfbd156831277803756638aa93b0e74d5f68b3979609331f","abstract_canon_sha256":"76d73f4c898f5dcdfd2c26f0a5736fa3f188998d1561f55327530f5b9c0b7b60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:06.022981Z","signature_b64":"gm7Fy8RmAVSmsX/jfc+uTcIfOdfMCv5UAHQSwvusLJczgO5LS7NLlOzqoXMXyDL7hc0pE/jq6vaTReL9aVVzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9dbbd610f427776d64e54ae9dc844368ae42667f9e914ebecc2059b63081f2f","last_reissued_at":"2026-07-05T07:57:06.022498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:06.022498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"iDb-RRT: Sampling-based Kinodynamic Motion Planning with Motion Primitives and Trajectory Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Joaquim Ortiz-Haro, Ludovic Righetti, Marc Toussaint, Valentin N. Hartmann, Wolfgang H\\\"onig","submitted_at":"2024-03-16T00:34:00Z","abstract_excerpt":"Rapidly-exploring Random Trees (RRT) and its variations have emerged as a robust and efficient tool for finding collision-free paths in robotic systems. However, adding dynamic constraints makes the motion planning problem significantly harder, as it requires solving two-value boundary problems (computationally expensive) or propagating random control inputs (uninformative). Alternatively, Iterative Discontinuity Bounded A* (iDb-A*), introduced in our previous study, combines search and optimization iteratively. The search step connects short trajectories (motion primitives) while allowing a b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10745","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/2403.10745/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":"2403.10745","created_at":"2026-07-05T07:57:06.022563+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.10745v1","created_at":"2026-07-05T07:57:06.022563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10745","created_at":"2026-07-05T07:57:06.022563+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHN32YIPIJ3X","created_at":"2026-07-05T07:57:06.022563+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHN32YIPIJ3XNVSO","created_at":"2026-07-05T07:57:06.022563+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHN32YIP","created_at":"2026-07-05T07:57:06.022563+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.20009","citing_title":"Kinodynamic Trajectory Following with STELA: Simultaneous Trajectory Estimation & Local Adaptation","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHN32YIPIJ3XNVSOKSXJ3SCEG2","json":"https://pith.science/pith/VHN32YIPIJ3XNVSOKSXJ3SCEG2.json","graph_json":"https://pith.science/api/pith-number/VHN32YIPIJ3XNVSOKSXJ3SCEG2/graph.json","events_json":"https://pith.science/api/pith-number/VHN32YIPIJ3XNVSOKSXJ3SCEG2/events.json","paper":"https://pith.science/paper/VHN32YIP"},"agent_actions":{"view_html":"https://pith.science/pith/VHN32YIPIJ3XNVSOKSXJ3SCEG2","download_json":"https://pith.science/pith/VHN32YIPIJ3XNVSOKSXJ3SCEG2.json","view_paper":"https://pith.science/paper/VHN32YIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.10745&json=true","fetch_graph":"https://pith.science/api/pith-number/VHN32YIPIJ3XNVSOKSXJ3SCEG2/graph.json","fetch_events":"https://pith.science/api/pith-number/VHN32YIPIJ3XNVSOKSXJ3SCEG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHN32YIPIJ3XNVSOKSXJ3SCEG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHN32YIPIJ3XNVSOKSXJ3SCEG2/action/storage_attestation","attest_author":"https://pith.science/pith/VHN32YIPIJ3XNVSOKSXJ3SCEG2/action/author_attestation","sign_citation":"https://pith.science/pith/VHN32YIPIJ3XNVSOKSXJ3SCEG2/action/citation_signature","submit_replication":"https://pith.science/pith/VHN32YIPIJ3XNVSOKSXJ3SCEG2/action/replication_record"}},"created_at":"2026-07-05T07:57:06.022563+00:00","updated_at":"2026-07-05T07:57:06.022563+00:00"}