{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IRNLTAP6J4XG4ZCWV7WKKS2WUT","short_pith_number":"pith:IRNLTAP6","canonical_record":{"source":{"id":"1707.07239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-23T02:54:37Z","cross_cats_sorted":[],"title_canon_sha256":"c86708efa4953c01d8b426901fcf26a1dd732fe003138f8a50489c517dd6bc9c","abstract_canon_sha256":"020f6d28e39f3992ce8abeb97699ef86e5056bf7d9227abe7a4e7807329984ec"},"schema_version":"1.0"},"canonical_sha256":"445ab981fe4f2e6e6456afeca54b56a4c33010a5266e552dafdf12d7afd3540c","source":{"kind":"arxiv","id":"1707.07239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07239","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07239v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07239","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"IRNLTAP6J4XG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IRNLTAP6J4XG4ZCW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IRNLTAP6","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IRNLTAP6J4XG4ZCWV7WKKS2WUT","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-23T02:54:37Z","cross_cats_sorted":[],"title_canon_sha256":"c86708efa4953c01d8b426901fcf26a1dd732fe003138f8a50489c517dd6bc9c","abstract_canon_sha256":"020f6d28e39f3992ce8abeb97699ef86e5056bf7d9227abe7a4e7807329984ec"},"schema_version":"1.0"},"canonical_sha256":"445ab981fe4f2e6e6456afeca54b56a4c33010a5266e552dafdf12d7afd3540c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.453947Z","signature_b64":"mDNAUTY4Qj/Q8oOuGGXACtV/PS1NKgozc0BVAv1oYRvTSNLy6SFXo+t7vwjB5DERKFyyKCOrxzpCoNAVT7PjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"445ab981fe4f2e6e6456afeca54b56a4c33010a5266e552dafdf12d7afd3540c","last_reissued_at":"2026-05-18T00:29:51.453454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.453454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07239","source_version":2,"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-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+eoEo926Dd3G5ZobT2eNaTJGpNrcDtJ6mNyCbk7RnAaSVieDDRCI4lqPLApger7tCIJ140j+c/f45k75+Oq4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:45:55.936212Z"},"content_sha256":"31d7397e5c63dc9b4b00c8c28209693ddbd0c1bdaae05ace748493bca5de73dc","schema_version":"1.0","event_id":"sha256:31d7397e5c63dc9b4b00c8c28209693ddbd0c1bdaae05ace748493bca5de73dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IRNLTAP6J4XG4ZCWV7WKKS2WUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Approach to Time-Optimal Path Parameterization based on Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hung Pham, Quang-Cuong Pham","submitted_at":"2017-07-23T02:54:37Z","abstract_excerpt":"Time-Optimal Path Parameterization (TOPP) is a well-studied problem in robotics and has a wide range of applications. There are two main families of methods to address TOPP: Numerical Integration (NI) and Convex Optimization (CO). NI-based methods are fast but difficult to implement and suffer from robustness issues, while CO-based approaches are more robust but at the same time significantly slower. Here we propose a new approach to TOPP based on Reachability Analysis (RA). The key insight is to recursively compute reachable and controllable sets at discretized positions on the path by solvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07239","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"},"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-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97CPqmxGF3eKNoBs3Q88SNVzecgPzQ2e3meCNZLMaD12EkaewEupl//CsY9PvV26seoKh0lubx3jO9cSVyPyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:45:55.936680Z"},"content_sha256":"ae6391878fdfa466da3142c8a4435ca1bbebc2130fcf28d60f42c14bdc2dff12","schema_version":"1.0","event_id":"sha256:ae6391878fdfa466da3142c8a4435ca1bbebc2130fcf28d60f42c14bdc2dff12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/bundle.json","state_url":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/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-25T22:45:55Z","links":{"resolver":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT","bundle":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/bundle.json","state":"https://pith.science/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRNLTAP6J4XG4ZCWV7WKKS2WUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IRNLTAP6J4XG4ZCWV7WKKS2WUT","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":"020f6d28e39f3992ce8abeb97699ef86e5056bf7d9227abe7a4e7807329984ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-23T02:54:37Z","title_canon_sha256":"c86708efa4953c01d8b426901fcf26a1dd732fe003138f8a50489c517dd6bc9c"},"schema_version":"1.0","source":{"id":"1707.07239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07239","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07239v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07239","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"IRNLTAP6J4XG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IRNLTAP6J4XG4ZCW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IRNLTAP6","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:ae6391878fdfa466da3142c8a4435ca1bbebc2130fcf28d60f42c14bdc2dff12","target":"graph","created_at":"2026-05-18T00:29:51Z","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 Parameterization (TOPP) is a well-studied problem in robotics and has a wide range of applications. There are two main families of methods to address TOPP: Numerical Integration (NI) and Convex Optimization (CO). NI-based methods are fast but difficult to implement and suffer from robustness issues, while CO-based approaches are more robust but at the same time significantly slower. Here we propose a new approach to TOPP based on Reachability Analysis (RA). The key insight is to recursively compute reachable and controllable sets at discretized positions on the path by solvin","authors_text":"Hung Pham, Quang-Cuong Pham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-23T02:54:37Z","title":"A New Approach to Time-Optimal Path Parameterization based on Reachability Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07239","kind":"arxiv","version":2},"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:31d7397e5c63dc9b4b00c8c28209693ddbd0c1bdaae05ace748493bca5de73dc","target":"record","created_at":"2026-05-18T00:29:51Z","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":"020f6d28e39f3992ce8abeb97699ef86e5056bf7d9227abe7a4e7807329984ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-23T02:54:37Z","title_canon_sha256":"c86708efa4953c01d8b426901fcf26a1dd732fe003138f8a50489c517dd6bc9c"},"schema_version":"1.0","source":{"id":"1707.07239","kind":"arxiv","version":2}},"canonical_sha256":"445ab981fe4f2e6e6456afeca54b56a4c33010a5266e552dafdf12d7afd3540c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"445ab981fe4f2e6e6456afeca54b56a4c33010a5266e552dafdf12d7afd3540c","first_computed_at":"2026-05-18T00:29:51.453454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:51.453454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mDNAUTY4Qj/Q8oOuGGXACtV/PS1NKgozc0BVAv1oYRvTSNLy6SFXo+t7vwjB5DERKFyyKCOrxzpCoNAVT7PjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:51.453947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31d7397e5c63dc9b4b00c8c28209693ddbd0c1bdaae05ace748493bca5de73dc","sha256:ae6391878fdfa466da3142c8a4435ca1bbebc2130fcf28d60f42c14bdc2dff12"],"state_sha256":"d708d61eb7065d31c5d710d29d9b0ed58ae98fb15aa6704af0a4e18b8b6b461e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9qP9pQ22fKHQwo+sSI06DIfkNp0q/Gi76ABcs0Azx5WuX1AJIolb9kwWxb2YgI92Nbg0ZUASrvBf//Qv6GADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:45:55.939771Z","bundle_sha256":"b25e38db0608b09dbf5ffab78f03062806ecdf49962a3a54db17a9b49bcc4a3e"}}