{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PMRQI3MPA2IYIQT7OKAJRS3LPC","short_pith_number":"pith:PMRQI3MP","schema_version":"1.0","canonical_sha256":"7b23046d8f069184427f728098cb6b78b2a7e925270f2cac6099542345f0229b","source":{"kind":"arxiv","id":"1312.6533","version":2},"attestation_state":"computed","paper":{"title":"A General, Fast, and Robust Implementation of the Time-Optimal Path Parameterization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Quang-Cuong Pham","submitted_at":"2013-12-23T12:05:43Z","abstract_excerpt":"Finding the Time-Optimal Parameterization of a given Path (TOPP) subject to kinodynamic constraints is an essential component in many robotic theories and applications. The objective of this article is to provide a general, fast and robust implementation of this component. For this, we give a complete solution to the issue of dynamic singularities, which are the main cause of failure in existing implementations. We then present an open-source implementation of the algorithm in C++/Python and demonstrate its robustness and speed in various robotics settings."},"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":"1312.6533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-12-23T12:05:43Z","cross_cats_sorted":[],"title_canon_sha256":"f6185f76fb119d49a98bf35b4db9b7e6c9a4f918c43995765660f305ba00e31e","abstract_canon_sha256":"947339096c2577a8df672d41e2a7832b49ac3476a7c0b3fad55c8803d1fb7dc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:08.159542Z","signature_b64":"kGcBTDQ23NgyOQXz4LdWY/FOFncNVYOF7hGigGCKla0WMlS/0cAoFNur3tu/Q6QhbpeJQLFYNPPBp6ZG764YBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b23046d8f069184427f728098cb6b78b2a7e925270f2cac6099542345f0229b","last_reissued_at":"2026-05-18T02:42:08.158868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:08.158868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General, Fast, and Robust Implementation of the Time-Optimal Path Parameterization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Quang-Cuong Pham","submitted_at":"2013-12-23T12:05:43Z","abstract_excerpt":"Finding the Time-Optimal Parameterization of a given Path (TOPP) subject to kinodynamic constraints is an essential component in many robotic theories and applications. The objective of this article is to provide a general, fast and robust implementation of this component. For this, we give a complete solution to the issue of dynamic singularities, which are the main cause of failure in existing implementations. We then present an open-source implementation of the algorithm in C++/Python and demonstrate its robustness and speed in various robotics settings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6533","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":""},"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":"1312.6533","created_at":"2026-05-18T02:42:08.158982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6533v2","created_at":"2026-05-18T02:42:08.158982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6533","created_at":"2026-05-18T02:42:08.158982+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMRQI3MPA2IY","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMRQI3MPA2IYIQT7","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMRQI3MP","created_at":"2026-05-18T12:27:54.935989+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/PMRQI3MPA2IYIQT7OKAJRS3LPC","json":"https://pith.science/pith/PMRQI3MPA2IYIQT7OKAJRS3LPC.json","graph_json":"https://pith.science/api/pith-number/PMRQI3MPA2IYIQT7OKAJRS3LPC/graph.json","events_json":"https://pith.science/api/pith-number/PMRQI3MPA2IYIQT7OKAJRS3LPC/events.json","paper":"https://pith.science/paper/PMRQI3MP"},"agent_actions":{"view_html":"https://pith.science/pith/PMRQI3MPA2IYIQT7OKAJRS3LPC","download_json":"https://pith.science/pith/PMRQI3MPA2IYIQT7OKAJRS3LPC.json","view_paper":"https://pith.science/paper/PMRQI3MP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6533&json=true","fetch_graph":"https://pith.science/api/pith-number/PMRQI3MPA2IYIQT7OKAJRS3LPC/graph.json","fetch_events":"https://pith.science/api/pith-number/PMRQI3MPA2IYIQT7OKAJRS3LPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMRQI3MPA2IYIQT7OKAJRS3LPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMRQI3MPA2IYIQT7OKAJRS3LPC/action/storage_attestation","attest_author":"https://pith.science/pith/PMRQI3MPA2IYIQT7OKAJRS3LPC/action/author_attestation","sign_citation":"https://pith.science/pith/PMRQI3MPA2IYIQT7OKAJRS3LPC/action/citation_signature","submit_replication":"https://pith.science/pith/PMRQI3MPA2IYIQT7OKAJRS3LPC/action/replication_record"}},"created_at":"2026-05-18T02:42:08.158982+00:00","updated_at":"2026-05-18T02:42:08.158982+00:00"}