{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FTEGGSACSUMDHTAP5DMJUARBVY","short_pith_number":"pith:FTEGGSAC","schema_version":"1.0","canonical_sha256":"2cc8634802951833cc0fe8d89a0221ae316ada994921b998a3a0382c2c9d9198","source":{"kind":"arxiv","id":"1903.09117","version":1},"attestation_state":"computed","paper":{"title":"A Structure Exploiting Branch-and-Bound Algorithm for Mixed-Integer Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Pedro Hespanhol, Rien Quirynen, Stefano Di Cairano","submitted_at":"2019-03-21T17:22:07Z","abstract_excerpt":"Mixed-integer model predictive control (MI-MPC) requires the solution of a mixed-integer quadratic program (MIQP) at each sampling instant under strict timing constraints, where part of the state and control variables can only assume a discrete set of values. Several applications in automotive, aerospace and hybrid systems are practical examples of how such discrete-valued variables arise. We utilize the sequential nature and the problem structure of MI-MPC in order to provide a branch-and-bound algorithm that can exploit not only the block-sparse optimal control structure of the problem but t"},"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":"1903.09117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-21T17:22:07Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a6e4e6fb16a3c1f25d342444c36579fdfff680d2f681941a2354a48c3303077a","abstract_canon_sha256":"9681be5bcff8113eb746d4aebcde5eb7221f5a66378f0090cf09f8910fba7d21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:43.208156Z","signature_b64":"13oNHWIc+LvaD2wsUVpruS6vOuBSqOYq6M7ha4aNZoOZcwDIHhMjPCt0YpxeAoD3F6uCNgfnb6s/fmuge4ezBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc8634802951833cc0fe8d89a0221ae316ada994921b998a3a0382c2c9d9198","last_reissued_at":"2026-05-17T23:50:43.207772Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:43.207772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Structure Exploiting Branch-and-Bound Algorithm for Mixed-Integer Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Pedro Hespanhol, Rien Quirynen, Stefano Di Cairano","submitted_at":"2019-03-21T17:22:07Z","abstract_excerpt":"Mixed-integer model predictive control (MI-MPC) requires the solution of a mixed-integer quadratic program (MIQP) at each sampling instant under strict timing constraints, where part of the state and control variables can only assume a discrete set of values. Several applications in automotive, aerospace and hybrid systems are practical examples of how such discrete-valued variables arise. We utilize the sequential nature and the problem structure of MI-MPC in order to provide a branch-and-bound algorithm that can exploit not only the block-sparse optimal control structure of the problem but t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09117","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":""},"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":"1903.09117","created_at":"2026-05-17T23:50:43.207833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09117v1","created_at":"2026-05-17T23:50:43.207833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09117","created_at":"2026-05-17T23:50:43.207833+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTEGGSACSUMD","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTEGGSACSUMDHTAP","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTEGGSAC","created_at":"2026-05-18T12:33:15.570797+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/FTEGGSACSUMDHTAP5DMJUARBVY","json":"https://pith.science/pith/FTEGGSACSUMDHTAP5DMJUARBVY.json","graph_json":"https://pith.science/api/pith-number/FTEGGSACSUMDHTAP5DMJUARBVY/graph.json","events_json":"https://pith.science/api/pith-number/FTEGGSACSUMDHTAP5DMJUARBVY/events.json","paper":"https://pith.science/paper/FTEGGSAC"},"agent_actions":{"view_html":"https://pith.science/pith/FTEGGSACSUMDHTAP5DMJUARBVY","download_json":"https://pith.science/pith/FTEGGSACSUMDHTAP5DMJUARBVY.json","view_paper":"https://pith.science/paper/FTEGGSAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09117&json=true","fetch_graph":"https://pith.science/api/pith-number/FTEGGSACSUMDHTAP5DMJUARBVY/graph.json","fetch_events":"https://pith.science/api/pith-number/FTEGGSACSUMDHTAP5DMJUARBVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTEGGSACSUMDHTAP5DMJUARBVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTEGGSACSUMDHTAP5DMJUARBVY/action/storage_attestation","attest_author":"https://pith.science/pith/FTEGGSACSUMDHTAP5DMJUARBVY/action/author_attestation","sign_citation":"https://pith.science/pith/FTEGGSACSUMDHTAP5DMJUARBVY/action/citation_signature","submit_replication":"https://pith.science/pith/FTEGGSACSUMDHTAP5DMJUARBVY/action/replication_record"}},"created_at":"2026-05-17T23:50:43.207833+00:00","updated_at":"2026-05-17T23:50:43.207833+00:00"}