{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FNPHEK2KBWNCXBWLOECNE73EOT","short_pith_number":"pith:FNPHEK2K","schema_version":"1.0","canonical_sha256":"2b5e722b4a0d9a2b86cb7104d27f6474f588fc63958ec7dd02d36f7d1d3e3cb2","source":{"kind":"arxiv","id":"2404.19096","version":2},"attestation_state":"computed","paper":{"title":"Data-Driven Min-Max MPC for Linear Systems: Robustness and Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Frank Allg\\\"ower, Julian Berberich, Yifan Xie","submitted_at":"2024-04-29T20:22:33Z","abstract_excerpt":"Data-driven controllers design is an important research problem, in particular when data is corrupted by the noise. In this paper, we propose a data-driven min-max model predictive control (MPC) scheme using noisy input-state data for unknown linear time-invariant (LTI) system. The unknown system matrices are characterized by a set-membership representation using the noisy input-state data. Leveraging this representation, we derive an upper bound on the worst-case cost and determine the corresponding optimal state-feedback control law through a semidefinite program (SDP). We prove that the res"},"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":"2404.19096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-04-29T20:22:33Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e5474d5cd03144a9d51776c239db55d24101f02b498c70b753a010b4365a75bc","abstract_canon_sha256":"f5da67686426309c3b9a5c89fb3f6f386e226c3185ac4cf3608f45047ac7de6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:24.550688Z","signature_b64":"qOeLiZnNCQbzTq20nUybw6oeFbHtUtORaZWSu+wcZjG9NRiup44kDK/WXlwpM1tEmTBh3GmYyumPGX6h1uJfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b5e722b4a0d9a2b86cb7104d27f6474f588fc63958ec7dd02d36f7d1d3e3cb2","last_reissued_at":"2026-07-05T10:07:24.550269Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:24.550269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Min-Max MPC for Linear Systems: Robustness and Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Frank Allg\\\"ower, Julian Berberich, Yifan Xie","submitted_at":"2024-04-29T20:22:33Z","abstract_excerpt":"Data-driven controllers design is an important research problem, in particular when data is corrupted by the noise. In this paper, we propose a data-driven min-max model predictive control (MPC) scheme using noisy input-state data for unknown linear time-invariant (LTI) system. The unknown system matrices are characterized by a set-membership representation using the noisy input-state data. Leveraging this representation, we derive an upper bound on the worst-case cost and determine the corresponding optimal state-feedback control law through a semidefinite program (SDP). We prove that the res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19096","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.19096/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":"2404.19096","created_at":"2026-07-05T10:07:24.550341+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.19096v2","created_at":"2026-07-05T10:07:24.550341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19096","created_at":"2026-07-05T10:07:24.550341+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNPHEK2KBWNC","created_at":"2026-07-05T10:07:24.550341+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNPHEK2KBWNCXBWL","created_at":"2026-07-05T10:07:24.550341+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNPHEK2K","created_at":"2026-07-05T10:07:24.550341+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.17350","citing_title":"On Min-Max Robust Data-Driven Predictive Control Considering Non-Unique Solutions to Behavioral Representation","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FNPHEK2KBWNCXBWLOECNE73EOT","json":"https://pith.science/pith/FNPHEK2KBWNCXBWLOECNE73EOT.json","graph_json":"https://pith.science/api/pith-number/FNPHEK2KBWNCXBWLOECNE73EOT/graph.json","events_json":"https://pith.science/api/pith-number/FNPHEK2KBWNCXBWLOECNE73EOT/events.json","paper":"https://pith.science/paper/FNPHEK2K"},"agent_actions":{"view_html":"https://pith.science/pith/FNPHEK2KBWNCXBWLOECNE73EOT","download_json":"https://pith.science/pith/FNPHEK2KBWNCXBWLOECNE73EOT.json","view_paper":"https://pith.science/paper/FNPHEK2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.19096&json=true","fetch_graph":"https://pith.science/api/pith-number/FNPHEK2KBWNCXBWLOECNE73EOT/graph.json","fetch_events":"https://pith.science/api/pith-number/FNPHEK2KBWNCXBWLOECNE73EOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNPHEK2KBWNCXBWLOECNE73EOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNPHEK2KBWNCXBWLOECNE73EOT/action/storage_attestation","attest_author":"https://pith.science/pith/FNPHEK2KBWNCXBWLOECNE73EOT/action/author_attestation","sign_citation":"https://pith.science/pith/FNPHEK2KBWNCXBWLOECNE73EOT/action/citation_signature","submit_replication":"https://pith.science/pith/FNPHEK2KBWNCXBWLOECNE73EOT/action/replication_record"}},"created_at":"2026-07-05T10:07:24.550341+00:00","updated_at":"2026-07-05T10:07:24.550341+00:00"}