{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NCFVOCRF3V5WZBOE2OV72CIVHS","short_pith_number":"pith:NCFVOCRF","schema_version":"1.0","canonical_sha256":"688b570a25dd7b6c85c4d3abfd09153cb2003335e9cb6b386b70bf2aaae66fdd","source":{"kind":"arxiv","id":"2504.04870","version":1},"attestation_state":"computed","paper":{"title":"Bilinear Data-Driven Min-Max MPC: Designing Rational Controllers via Sum-of-squares Optimization","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, Robin Str\\\"asser, Yifan Xie","submitted_at":"2025-04-07T09:24:56Z","abstract_excerpt":"We propose a data-driven min-max model predictive control (MPC) scheme to control unknown discrete-time bilinear systems. Based on a sequence of noisy input-state data, we state a set-membership representation for the unknown system dynamics. Then, we derive a sum-of-squares (SOS) program that minimizes an upper bound on the worst-case cost over all bilinear systems consistent with the data. As a crucial technical ingredient, the SOS program involves a rational controller parameterization to improve feasibility and tractability. We prove that the resulting data-driven MPC scheme ensures closed"},"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":"2504.04870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-04-07T09:24:56Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b9b08fe399635143276c221d2627b9b7793f5555a40c2ceff72b95b61302e67a","abstract_canon_sha256":"aed46923461cf0c8c17a38067d2871213b57b0caaa83e16be691d5759f209f70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:30.919183Z","signature_b64":"hsWwdEKGK/jAHjzSro/J6QXtGYrGiw+NDlWkn6HIlgM0lQKaflq9p4lZmsodVUUJYk9cZ31RKDNbQaxFpYIqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"688b570a25dd7b6c85c4d3abfd09153cb2003335e9cb6b386b70bf2aaae66fdd","last_reissued_at":"2026-07-05T10:45:30.918690Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:30.918690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilinear Data-Driven Min-Max MPC: Designing Rational Controllers via Sum-of-squares Optimization","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, Robin Str\\\"asser, Yifan Xie","submitted_at":"2025-04-07T09:24:56Z","abstract_excerpt":"We propose a data-driven min-max model predictive control (MPC) scheme to control unknown discrete-time bilinear systems. Based on a sequence of noisy input-state data, we state a set-membership representation for the unknown system dynamics. Then, we derive a sum-of-squares (SOS) program that minimizes an upper bound on the worst-case cost over all bilinear systems consistent with the data. As a crucial technical ingredient, the SOS program involves a rational controller parameterization to improve feasibility and tractability. We prove that the resulting data-driven MPC scheme ensures closed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04870","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/2504.04870/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":"2504.04870","created_at":"2026-07-05T10:45:30.918748+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04870v1","created_at":"2026-07-05T10:45:30.918748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04870","created_at":"2026-07-05T10:45:30.918748+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCFVOCRF3V5W","created_at":"2026-07-05T10:45:30.918748+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCFVOCRF3V5WZBOE","created_at":"2026-07-05T10:45:30.918748+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCFVOCRF","created_at":"2026-07-05T10:45:30.918748+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24316","citing_title":"Data-Driven Robust MPC for Unknown Nonlinear Systems via Set-Membership Learning","ref_index":96,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NCFVOCRF3V5WZBOE2OV72CIVHS","json":"https://pith.science/pith/NCFVOCRF3V5WZBOE2OV72CIVHS.json","graph_json":"https://pith.science/api/pith-number/NCFVOCRF3V5WZBOE2OV72CIVHS/graph.json","events_json":"https://pith.science/api/pith-number/NCFVOCRF3V5WZBOE2OV72CIVHS/events.json","paper":"https://pith.science/paper/NCFVOCRF"},"agent_actions":{"view_html":"https://pith.science/pith/NCFVOCRF3V5WZBOE2OV72CIVHS","download_json":"https://pith.science/pith/NCFVOCRF3V5WZBOE2OV72CIVHS.json","view_paper":"https://pith.science/paper/NCFVOCRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04870&json=true","fetch_graph":"https://pith.science/api/pith-number/NCFVOCRF3V5WZBOE2OV72CIVHS/graph.json","fetch_events":"https://pith.science/api/pith-number/NCFVOCRF3V5WZBOE2OV72CIVHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCFVOCRF3V5WZBOE2OV72CIVHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCFVOCRF3V5WZBOE2OV72CIVHS/action/storage_attestation","attest_author":"https://pith.science/pith/NCFVOCRF3V5WZBOE2OV72CIVHS/action/author_attestation","sign_citation":"https://pith.science/pith/NCFVOCRF3V5WZBOE2OV72CIVHS/action/citation_signature","submit_replication":"https://pith.science/pith/NCFVOCRF3V5WZBOE2OV72CIVHS/action/replication_record"}},"created_at":"2026-07-05T10:45:30.918748+00:00","updated_at":"2026-07-05T10:45:30.918748+00:00"}