{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7PMRNH4YXQHBSSMONUZVEBEKCB","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":"400b8f07da04436ea95762d7cbcf51d9b7b902768e7669d51d7ddfd323f6251a","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-12-10T01:55:21Z","title_canon_sha256":"3fc066c607216795d1305bdb027ab903ad3d9ea7fa13d9bb6583b8b53bd32ffb"},"schema_version":"1.0","source":{"id":"2312.05724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.05724","created_at":"2026-07-05T07:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"2312.05724v1","created_at":"2026-07-05T07:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05724","created_at":"2026-07-05T07:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"7PMRNH4YXQHB","created_at":"2026-07-05T07:22:31Z"},{"alias_kind":"pith_short_16","alias_value":"7PMRNH4YXQHBSSMO","created_at":"2026-07-05T07:22:31Z"},{"alias_kind":"pith_short_8","alias_value":"7PMRNH4Y","created_at":"2026-07-05T07:22:31Z"}],"graph_snapshots":[{"event_id":"sha256:137181bd6448ae0e075f88a95837f760b5afb21a423c9d2a4d3f8a7d42cb76fd","target":"graph","created_at":"2026-07-05T07:22:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.05724/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we develop a computationally-efficient approach to minimum-time trajectory optimization using input-output data-based models, to produce an end-to-end data-to-control solution to time-optimal planning/control of dynamic systems and hence facilitate their autonomous operation. The approach integrates a non-parametric data-based model for trajectory prediction and a continuous optimization formulation based on an exponential weighting scheme for minimum-time trajectory planning. The optimization problem in its final form is a linear program and is easy to solve. We validate the ap","authors_text":"Dimitar Filev, Ehsan Taheri, Ilya Kolmanovsky, Nan Li","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-12-10T01:55:21Z","title":"Minimum-Time Trajectory Optimization With Data-Based Models: A Linear Programming Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05724","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:9da9eae5cf62b8d39f24ee0024f6b401007fe962a78d91010ed37294cc001bfd","target":"record","created_at":"2026-07-05T07:22:31Z","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":"400b8f07da04436ea95762d7cbcf51d9b7b902768e7669d51d7ddfd323f6251a","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-12-10T01:55:21Z","title_canon_sha256":"3fc066c607216795d1305bdb027ab903ad3d9ea7fa13d9bb6583b8b53bd32ffb"},"schema_version":"1.0","source":{"id":"2312.05724","kind":"arxiv","version":1}},"canonical_sha256":"fbd9169f98bc0e19498e6d3352048a107bc8953a8d731a0e992340cd1fe2e533","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbd9169f98bc0e19498e6d3352048a107bc8953a8d731a0e992340cd1fe2e533","first_computed_at":"2026-07-05T07:22:31.618037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:22:31.618037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QAryvjNJEhCnR2qtvB1HQ5UKddROfbYtSyaVVdwhc6Ib0mzcuvZ1fo9mo9oKR/2x87agqcM5GtphQF2/voCLAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:22:31.618493Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.05724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9da9eae5cf62b8d39f24ee0024f6b401007fe962a78d91010ed37294cc001bfd","sha256:137181bd6448ae0e075f88a95837f760b5afb21a423c9d2a4d3f8a7d42cb76fd"],"state_sha256":"38822654f30650bc7268826bd8385bfd2cf87acb3f2d80225dbb09bfc47278ac"}