{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QZE5IEPRSSWUUKNAWHMUD25V2J","short_pith_number":"pith:QZE5IEPR","schema_version":"1.0","canonical_sha256":"8649d411f194ad4a29a0b1d941ebb5d25384ec414ca1109e7e0714c6cd488528","source":{"kind":"arxiv","id":"1904.04968","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Igor Spasojevic, Sertac Karaman, Varun Murali","submitted_at":"2019-04-10T01:38:15Z","abstract_excerpt":"Time Optimal Path Parametrization is the problem of minimizing the time interval during which an actuation constrained agent can traverse a given path. Recently, an efficient linear-time algorithm for solving this problem was proposed. However, its optimality was proved for only a strict subclass of problems solved optimally by more computationally intensive approaches based on convex programming. In this paper, we prove that the same linear-time algorithm is asymptotically optimal for all problems solved optimally by convex optimization approaches. We also characterize the optimum of the Time"},"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":"1904.04968","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-10T01:38:15Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"171b8afb4a1d1408d311d8b35a314ffb1cde6674fa8cb689c312b4205982ca7d","abstract_canon_sha256":"205a708a5d611e1ccb325cdf68b83b6e819e875223e5887d4d9a2afc1c5e401e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:48.212901Z","signature_b64":"yj68pdgzTCsKvcNOcmNmP+9cU8+Y8aLn0jsOzpcV1lqQ6hheozuGM18kXBrPCNNF9z46ohKY7L5zQZExfAMbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8649d411f194ad4a29a0b1d941ebb5d25384ec414ca1109e7e0714c6cd488528","last_reissued_at":"2026-05-17T23:42:48.212276Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:48.212276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Igor Spasojevic, Sertac Karaman, Varun Murali","submitted_at":"2019-04-10T01:38:15Z","abstract_excerpt":"Time Optimal Path Parametrization is the problem of minimizing the time interval during which an actuation constrained agent can traverse a given path. Recently, an efficient linear-time algorithm for solving this problem was proposed. However, its optimality was proved for only a strict subclass of problems solved optimally by more computationally intensive approaches based on convex programming. In this paper, we prove that the same linear-time algorithm is asymptotically optimal for all problems solved optimally by convex optimization approaches. We also characterize the optimum of the Time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04968","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":""},"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":"1904.04968","created_at":"2026-05-17T23:42:48.212372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04968v1","created_at":"2026-05-17T23:42:48.212372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04968","created_at":"2026-05-17T23:42:48.212372+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZE5IEPRSSWU","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZE5IEPRSSWUUKNA","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZE5IEPR","created_at":"2026-05-18T12:33:27.125529+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/QZE5IEPRSSWUUKNAWHMUD25V2J","json":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J.json","graph_json":"https://pith.science/api/pith-number/QZE5IEPRSSWUUKNAWHMUD25V2J/graph.json","events_json":"https://pith.science/api/pith-number/QZE5IEPRSSWUUKNAWHMUD25V2J/events.json","paper":"https://pith.science/paper/QZE5IEPR"},"agent_actions":{"view_html":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J","download_json":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J.json","view_paper":"https://pith.science/paper/QZE5IEPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04968&json=true","fetch_graph":"https://pith.science/api/pith-number/QZE5IEPRSSWUUKNAWHMUD25V2J/graph.json","fetch_events":"https://pith.science/api/pith-number/QZE5IEPRSSWUUKNAWHMUD25V2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/action/storage_attestation","attest_author":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/action/author_attestation","sign_citation":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/action/citation_signature","submit_replication":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/action/replication_record"}},"created_at":"2026-05-17T23:42:48.212372+00:00","updated_at":"2026-05-17T23:42:48.212372+00:00"}