{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4GOAVX4MCJGIVMAAGCNAMWABTP","short_pith_number":"pith:4GOAVX4M","schema_version":"1.0","canonical_sha256":"e19c0adf8c124c8ab000309a0658019bdb25925212e61d669f66e1b6186c9852","source":{"kind":"arxiv","id":"1411.4045","version":3},"attestation_state":"computed","paper":{"title":"Admissible Velocity Propagation : Beyond Quasi-Static Path Planning for High-Dimensional Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Puttichai Lertkultanon, Quang-Cuong Pham, St\\'ephane Caron, Yoshihiko Nakamura","submitted_at":"2014-11-14T08:54:27Z","abstract_excerpt":"Path-velocity decomposition is an intuitive yet powerful approach to address the complexity of kinodynamic motion planning. The difficult trajectory planning problem is solved in two separate, simpler, steps: first, find a path in the configuration space that satisfies the geometric constraints (path planning), and second, find a time-parameterization of that path satisfying the kinodynamic constraints. A fundamental requirement is that the path found in the first step should be time-parameterizable. Most existing works fulfill this requirement by enforcing quasi-static constraints in the path"},"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":"1411.4045","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-11-14T08:54:27Z","cross_cats_sorted":[],"title_canon_sha256":"bfb3f0d15873c7ad4d2d1cfa2c92e9d22c7c49265feb4205c8a2a9d66ef7d6a9","abstract_canon_sha256":"ffa5d709270471b1fd00b7f8e902e36ae59ef39bbffb86776da4fc7d79e79b7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:37.042276Z","signature_b64":"N6TLQR4P47GiuwAF/NlLFVr/Xql/G4cIvhw7hyLWMlaDt7wQHWcpwJJhGJgOnaJVyLAMxwGrwLBaOllojxQDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e19c0adf8c124c8ab000309a0658019bdb25925212e61d669f66e1b6186c9852","last_reissued_at":"2026-05-18T01:03:37.041561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:37.041561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Admissible Velocity Propagation : Beyond Quasi-Static Path Planning for High-Dimensional Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Puttichai Lertkultanon, Quang-Cuong Pham, St\\'ephane Caron, Yoshihiko Nakamura","submitted_at":"2014-11-14T08:54:27Z","abstract_excerpt":"Path-velocity decomposition is an intuitive yet powerful approach to address the complexity of kinodynamic motion planning. The difficult trajectory planning problem is solved in two separate, simpler, steps: first, find a path in the configuration space that satisfies the geometric constraints (path planning), and second, find a time-parameterization of that path satisfying the kinodynamic constraints. A fundamental requirement is that the path found in the first step should be time-parameterizable. Most existing works fulfill this requirement by enforcing quasi-static constraints in the path"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4045","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1411.4045","created_at":"2026-05-18T01:03:37.041684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4045v3","created_at":"2026-05-18T01:03:37.041684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4045","created_at":"2026-05-18T01:03:37.041684+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GOAVX4MCJGI","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GOAVX4MCJGIVMAA","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GOAVX4M","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4GOAVX4MCJGIVMAAGCNAMWABTP","json":"https://pith.science/pith/4GOAVX4MCJGIVMAAGCNAMWABTP.json","graph_json":"https://pith.science/api/pith-number/4GOAVX4MCJGIVMAAGCNAMWABTP/graph.json","events_json":"https://pith.science/api/pith-number/4GOAVX4MCJGIVMAAGCNAMWABTP/events.json","paper":"https://pith.science/paper/4GOAVX4M"},"agent_actions":{"view_html":"https://pith.science/pith/4GOAVX4MCJGIVMAAGCNAMWABTP","download_json":"https://pith.science/pith/4GOAVX4MCJGIVMAAGCNAMWABTP.json","view_paper":"https://pith.science/paper/4GOAVX4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4045&json=true","fetch_graph":"https://pith.science/api/pith-number/4GOAVX4MCJGIVMAAGCNAMWABTP/graph.json","fetch_events":"https://pith.science/api/pith-number/4GOAVX4MCJGIVMAAGCNAMWABTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GOAVX4MCJGIVMAAGCNAMWABTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GOAVX4MCJGIVMAAGCNAMWABTP/action/storage_attestation","attest_author":"https://pith.science/pith/4GOAVX4MCJGIVMAAGCNAMWABTP/action/author_attestation","sign_citation":"https://pith.science/pith/4GOAVX4MCJGIVMAAGCNAMWABTP/action/citation_signature","submit_replication":"https://pith.science/pith/4GOAVX4MCJGIVMAAGCNAMWABTP/action/replication_record"}},"created_at":"2026-05-18T01:03:37.041684+00:00","updated_at":"2026-05-18T01:03:37.041684+00:00"}