{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2IK47LW45F7AMKV5IWAKMTN3PT","short_pith_number":"pith:2IK47LW4","schema_version":"1.0","canonical_sha256":"d215cfaedce97e062abd4580a64dbb7ce6dafba6ec3c132d64f6d1ceb62bb2f0","source":{"kind":"arxiv","id":"1709.05101","version":2},"attestation_state":"computed","paper":{"title":"Time-Optimal Path Tracking via 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-09-15T08:28:50Z","abstract_excerpt":"Given a geometric path, the Time-Optimal Path Tracking problem consists in finding the control strategy to traverse the path time-optimally while regulating tracking errors. A simple yet effective approach to this problem is to decompose the controller into two components: (i)~a path controller, which modulates the parameterization of the desired path in an online manner, yielding a reference trajectory; and (ii)~a tracking controller, which takes the reference trajectory and outputs joint torques for tracking. However, there is one major difficulty: the path controller might not find any feas"},"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":"1709.05101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-15T08:28:50Z","cross_cats_sorted":[],"title_canon_sha256":"c0c2a5b42aab67cc99da82896631ada587642f5fad434176b1faee8bbcbf7d65","abstract_canon_sha256":"71d86973c2484e2d1126690b1b4f1a933c1d08bde73aef86550cb41f3b489bff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:46.748841Z","signature_b64":"InkDTZGe2p5Zp2A5285K9oE0OUe63AFqZIkZGue48rugyWgrVlx4tPwFhWcg9/8DjoJZQX5FPMyAcJl4UANGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d215cfaedce97e062abd4580a64dbb7ce6dafba6ec3c132d64f6d1ceb62bb2f0","last_reissued_at":"2026-05-18T00:20:46.747794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:46.747794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Optimal Path Tracking via 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-09-15T08:28:50Z","abstract_excerpt":"Given a geometric path, the Time-Optimal Path Tracking problem consists in finding the control strategy to traverse the path time-optimally while regulating tracking errors. A simple yet effective approach to this problem is to decompose the controller into two components: (i)~a path controller, which modulates the parameterization of the desired path in an online manner, yielding a reference trajectory; and (ii)~a tracking controller, which takes the reference trajectory and outputs joint torques for tracking. However, there is one major difficulty: the path controller might not find any feas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05101","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":"1709.05101","created_at":"2026-05-18T00:20:46.748296+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05101v2","created_at":"2026-05-18T00:20:46.748296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05101","created_at":"2026-05-18T00:20:46.748296+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IK47LW45F7A","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IK47LW45F7AMKV5","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IK47LW4","created_at":"2026-05-18T12:30:55.937587+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/2IK47LW45F7AMKV5IWAKMTN3PT","json":"https://pith.science/pith/2IK47LW45F7AMKV5IWAKMTN3PT.json","graph_json":"https://pith.science/api/pith-number/2IK47LW45F7AMKV5IWAKMTN3PT/graph.json","events_json":"https://pith.science/api/pith-number/2IK47LW45F7AMKV5IWAKMTN3PT/events.json","paper":"https://pith.science/paper/2IK47LW4"},"agent_actions":{"view_html":"https://pith.science/pith/2IK47LW45F7AMKV5IWAKMTN3PT","download_json":"https://pith.science/pith/2IK47LW45F7AMKV5IWAKMTN3PT.json","view_paper":"https://pith.science/paper/2IK47LW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05101&json=true","fetch_graph":"https://pith.science/api/pith-number/2IK47LW45F7AMKV5IWAKMTN3PT/graph.json","fetch_events":"https://pith.science/api/pith-number/2IK47LW45F7AMKV5IWAKMTN3PT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IK47LW45F7AMKV5IWAKMTN3PT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IK47LW45F7AMKV5IWAKMTN3PT/action/storage_attestation","attest_author":"https://pith.science/pith/2IK47LW45F7AMKV5IWAKMTN3PT/action/author_attestation","sign_citation":"https://pith.science/pith/2IK47LW45F7AMKV5IWAKMTN3PT/action/citation_signature","submit_replication":"https://pith.science/pith/2IK47LW45F7AMKV5IWAKMTN3PT/action/replication_record"}},"created_at":"2026-05-18T00:20:46.748296+00:00","updated_at":"2026-05-18T00:20:46.748296+00:00"}