{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JAFDSX6AZT6UX3YXSRJS46QXTP","short_pith_number":"pith:JAFDSX6A","schema_version":"1.0","canonical_sha256":"480a395fc0ccfd4bef1794532e7a179be9827684b291a79434378469bbeac21a","source":{"kind":"arxiv","id":"2409.10884","version":1},"attestation_state":"computed","paper":{"title":"3DIOC: Direct Data-Driven Inverse Optimal Control for LTI Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Chendi Qu, Jianping He, Xiaoming Duan","submitted_at":"2024-09-17T04:40:40Z","abstract_excerpt":"This paper develops a direct data-driven inverse optimal control (3DIOC) algorithm for the linear time-invariant (LTI) system who conducts a linear quadratic (LQ) control, where the underlying objective function is learned directly from measured input-output trajectories without system identification. By introducing the Fundamental Lemma, we establish the input-output representation of the LTI system. We accordingly propose a model-free optimality necessary condition for the forward LQ problem to build a connection between the objective function and collected data, with which the inverse optim"},"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":"2409.10884","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-09-17T04:40:40Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"e270000521ac105d940115a5e7b371c13fbb78d4afad8d1e4b30415faefbd47b","abstract_canon_sha256":"6b4809d37a9fd85b8725316d400a5aa921d736d8b43f7025ad2eded6d841ae28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:58.463872Z","signature_b64":"P8wNWPID2EMaEjRCGKunhomED8b1I071AJy7oOTmhPawNhW/ThPnO/d0oT97/qj+DQZ1J92dQxuOTpgnn2CZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"480a395fc0ccfd4bef1794532e7a179be9827684b291a79434378469bbeac21a","last_reissued_at":"2026-07-05T09:07:58.463289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:58.463289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3DIOC: Direct Data-Driven Inverse Optimal Control for LTI Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Chendi Qu, Jianping He, Xiaoming Duan","submitted_at":"2024-09-17T04:40:40Z","abstract_excerpt":"This paper develops a direct data-driven inverse optimal control (3DIOC) algorithm for the linear time-invariant (LTI) system who conducts a linear quadratic (LQ) control, where the underlying objective function is learned directly from measured input-output trajectories without system identification. By introducing the Fundamental Lemma, we establish the input-output representation of the LTI system. We accordingly propose a model-free optimality necessary condition for the forward LQ problem to build a connection between the objective function and collected data, with which the inverse optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10884","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.10884/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.10884","created_at":"2026-07-05T09:07:58.463385+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.10884v1","created_at":"2026-07-05T09:07:58.463385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10884","created_at":"2026-07-05T09:07:58.463385+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAFDSX6AZT6U","created_at":"2026-07-05T09:07:58.463385+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAFDSX6AZT6UX3YX","created_at":"2026-07-05T09:07:58.463385+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAFDSX6A","created_at":"2026-07-05T09:07:58.463385+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19965","citing_title":"A Convex Optimization Approach to Model-Free Inverse Optimal Control with Provable Convergence","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JAFDSX6AZT6UX3YXSRJS46QXTP","json":"https://pith.science/pith/JAFDSX6AZT6UX3YXSRJS46QXTP.json","graph_json":"https://pith.science/api/pith-number/JAFDSX6AZT6UX3YXSRJS46QXTP/graph.json","events_json":"https://pith.science/api/pith-number/JAFDSX6AZT6UX3YXSRJS46QXTP/events.json","paper":"https://pith.science/paper/JAFDSX6A"},"agent_actions":{"view_html":"https://pith.science/pith/JAFDSX6AZT6UX3YXSRJS46QXTP","download_json":"https://pith.science/pith/JAFDSX6AZT6UX3YXSRJS46QXTP.json","view_paper":"https://pith.science/paper/JAFDSX6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.10884&json=true","fetch_graph":"https://pith.science/api/pith-number/JAFDSX6AZT6UX3YXSRJS46QXTP/graph.json","fetch_events":"https://pith.science/api/pith-number/JAFDSX6AZT6UX3YXSRJS46QXTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAFDSX6AZT6UX3YXSRJS46QXTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAFDSX6AZT6UX3YXSRJS46QXTP/action/storage_attestation","attest_author":"https://pith.science/pith/JAFDSX6AZT6UX3YXSRJS46QXTP/action/author_attestation","sign_citation":"https://pith.science/pith/JAFDSX6AZT6UX3YXSRJS46QXTP/action/citation_signature","submit_replication":"https://pith.science/pith/JAFDSX6AZT6UX3YXSRJS46QXTP/action/replication_record"}},"created_at":"2026-07-05T09:07:58.463385+00:00","updated_at":"2026-07-05T09:07:58.463385+00:00"}