{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CQRKSZP7PD3UCGNUZWFWLHURNM","short_pith_number":"pith:CQRKSZP7","schema_version":"1.0","canonical_sha256":"1422a965ff78f74119b4cd8b659e916b3e26f88c7708b1ba3d809eac5f2aeff8","source":{"kind":"arxiv","id":"1902.10989","version":1},"attestation_state":"computed","paper":{"title":"Partition-based Feasible Integer Solution Pre-computation for Hybrid Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Danylo Malyuta, David S. Bayard, Martin Cacan","submitted_at":"2019-02-28T10:14:29Z","abstract_excerpt":"For multiparametric mixed-integer convex programming problems such as those encountered in hybrid model predictive control, we propose an algorithm for generating a feasible partition of a subset of the parameter space. The result is a static map from the current parameter to a suboptimal integer solution such that the remaining convex program is feasible. Convergence is proven with a new insight that the overlap among the feasible parameter sets of each integer solution governs the partition complexity. The partition is stored as a tree which makes querying the feasible solution efficient. Th"},"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":"1902.10989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-28T10:14:29Z","cross_cats_sorted":[],"title_canon_sha256":"1dc9c31fa9a829b3df26410872118d2fe4c646cf128fd16e779ef5429654799a","abstract_canon_sha256":"16b63af33981292585b9685de23a73ae34fdbb64baeab68fc948e3805685ba37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:26.168580Z","signature_b64":"wLe6ECKw0XrYUn6k/LHpAFG79sG4u6aSk9JsLMwnBXxwjXsIpa/ts9DohMXXIRxgm5etu194AQS7xGd337hJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1422a965ff78f74119b4cd8b659e916b3e26f88c7708b1ba3d809eac5f2aeff8","last_reissued_at":"2026-05-17T23:52:26.168052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:26.168052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partition-based Feasible Integer Solution Pre-computation for Hybrid Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Danylo Malyuta, David S. Bayard, Martin Cacan","submitted_at":"2019-02-28T10:14:29Z","abstract_excerpt":"For multiparametric mixed-integer convex programming problems such as those encountered in hybrid model predictive control, we propose an algorithm for generating a feasible partition of a subset of the parameter space. The result is a static map from the current parameter to a suboptimal integer solution such that the remaining convex program is feasible. Convergence is proven with a new insight that the overlap among the feasible parameter sets of each integer solution governs the partition complexity. The partition is stored as a tree which makes querying the feasible solution efficient. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10989","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":"1902.10989","created_at":"2026-05-17T23:52:26.168126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10989v1","created_at":"2026-05-17T23:52:26.168126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10989","created_at":"2026-05-17T23:52:26.168126+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQRKSZP7PD3U","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQRKSZP7PD3UCGNU","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQRKSZP7","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/CQRKSZP7PD3UCGNUZWFWLHURNM","json":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM.json","graph_json":"https://pith.science/api/pith-number/CQRKSZP7PD3UCGNUZWFWLHURNM/graph.json","events_json":"https://pith.science/api/pith-number/CQRKSZP7PD3UCGNUZWFWLHURNM/events.json","paper":"https://pith.science/paper/CQRKSZP7"},"agent_actions":{"view_html":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM","download_json":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM.json","view_paper":"https://pith.science/paper/CQRKSZP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10989&json=true","fetch_graph":"https://pith.science/api/pith-number/CQRKSZP7PD3UCGNUZWFWLHURNM/graph.json","fetch_events":"https://pith.science/api/pith-number/CQRKSZP7PD3UCGNUZWFWLHURNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/action/storage_attestation","attest_author":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/action/author_attestation","sign_citation":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/action/citation_signature","submit_replication":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/action/replication_record"}},"created_at":"2026-05-17T23:52:26.168126+00:00","updated_at":"2026-05-17T23:52:26.168126+00:00"}