{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QZE5IEPRSSWUUKNAWHMUD25V2J","short_pith_number":"pith:QZE5IEPR","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"},"canonical_sha256":"8649d411f194ad4a29a0b1d941ebb5d25384ec414ca1109e7e0714c6cd488528","source":{"kind":"arxiv","id":"1904.04968","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04968","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04968v1","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04968","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"pith_short_12","alias_value":"QZE5IEPRSSWU","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QZE5IEPRSSWUUKNA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QZE5IEPR","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QZE5IEPRSSWUUKNAWHMUD25V2J","target":"record","payload":{"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"},"canonical_sha256":"8649d411f194ad4a29a0b1d941ebb5d25384ec414ca1109e7e0714c6cd488528","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"},"source_kind":"arxiv","source_id":"1904.04968","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+akBGJgaBQNOSQmhIWoPIgBWQZrD7tYmMOihAYhpJFwoBQScBcLJnFtDKW43IZrXmyLhip0UFMgE6X4w9SMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:52:48.019705Z"},"content_sha256":"db062c1052b6dfb8f62bc08042ca0e0026256ae8397aa37ba9e05fc23e0b477c","schema_version":"1.0","event_id":"sha256:db062c1052b6dfb8f62bc08042ca0e0026256ae8397aa37ba9e05fc23e0b477c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QZE5IEPRSSWUUKNAWHMUD25V2J","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRmagVzLxLiHh/J844AsXdhorN0wgUoAQKJloC62U+zjGfHMkD0E9aS1jyWoEaNqBRp3P5et7dHgNrzsSrnyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:52:48.020345Z"},"content_sha256":"a2a600af7afd456c8fbc686f15e6faed2c34dcaf2148b536203b4b9732cab727","schema_version":"1.0","event_id":"sha256:a2a600af7afd456c8fbc686f15e6faed2c34dcaf2148b536203b4b9732cab727"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/bundle.json","state_url":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T11:52:48Z","links":{"resolver":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J","bundle":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/bundle.json","state":"https://pith.science/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZE5IEPRSSWUUKNAWHMUD25V2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QZE5IEPRSSWUUKNAWHMUD25V2J","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"205a708a5d611e1ccb325cdf68b83b6e819e875223e5887d4d9a2afc1c5e401e","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-10T01:38:15Z","title_canon_sha256":"171b8afb4a1d1408d311d8b35a314ffb1cde6674fa8cb689c312b4205982ca7d"},"schema_version":"1.0","source":{"id":"1904.04968","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04968","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04968v1","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04968","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"pith_short_12","alias_value":"QZE5IEPRSSWU","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QZE5IEPRSSWUUKNA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QZE5IEPR","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:a2a600af7afd456c8fbc686f15e6faed2c34dcaf2148b536203b4b9732cab727","target":"graph","created_at":"2026-05-17T23:42:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Igor Spasojevic, Sertac Karaman, Varun Murali","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-10T01:38:15Z","title":"Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04968","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:db062c1052b6dfb8f62bc08042ca0e0026256ae8397aa37ba9e05fc23e0b477c","target":"record","created_at":"2026-05-17T23:42:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"205a708a5d611e1ccb325cdf68b83b6e819e875223e5887d4d9a2afc1c5e401e","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-10T01:38:15Z","title_canon_sha256":"171b8afb4a1d1408d311d8b35a314ffb1cde6674fa8cb689c312b4205982ca7d"},"schema_version":"1.0","source":{"id":"1904.04968","kind":"arxiv","version":1}},"canonical_sha256":"8649d411f194ad4a29a0b1d941ebb5d25384ec414ca1109e7e0714c6cd488528","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8649d411f194ad4a29a0b1d941ebb5d25384ec414ca1109e7e0714c6cd488528","first_computed_at":"2026-05-17T23:42:48.212276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:48.212276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yj68pdgzTCsKvcNOcmNmP+9cU8+Y8aLn0jsOzpcV1lqQ6hheozuGM18kXBrPCNNF9z46ohKY7L5zQZExfAMbAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:48.212901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04968","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db062c1052b6dfb8f62bc08042ca0e0026256ae8397aa37ba9e05fc23e0b477c","sha256:a2a600af7afd456c8fbc686f15e6faed2c34dcaf2148b536203b4b9732cab727"],"state_sha256":"0a066d940cb9ccfe7aec7ff7575f8d59fcfa195e58c5515c6f574f69639015dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DicMYo2yAmBnAu32hDAv+yTRX7ntK3K5vr5loDEw05OE4Yv1DCxP6d8wk1LyqK89B0EfPJHYqEbEHpY8PhUbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:52:48.023781Z","bundle_sha256":"701bf1740e20fc1bf99fbb8096073ace9548306c10d455d2680b0418eca44803"}}