{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CQRKSZP7PD3UCGNUZWFWLHURNM","short_pith_number":"pith:CQRKSZP7","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"},"canonical_sha256":"1422a965ff78f74119b4cd8b659e916b3e26f88c7708b1ba3d809eac5f2aeff8","source":{"kind":"arxiv","id":"1902.10989","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10989","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10989v1","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10989","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"CQRKSZP7PD3U","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CQRKSZP7PD3UCGNU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CQRKSZP7","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CQRKSZP7PD3UCGNUZWFWLHURNM","target":"record","payload":{"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"},"canonical_sha256":"1422a965ff78f74119b4cd8b659e916b3e26f88c7708b1ba3d809eac5f2aeff8","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"},"source_kind":"arxiv","source_id":"1902.10989","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAu7yM+yg9OU1MKUzhtZyC13RTsz0eP7Yv7bWtCuWWMIHI+CqSylQSPF1E2xMiUQXXUa6Zc0F5PNmhTJEqXBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:28:03.695845Z"},"content_sha256":"2a9ef234a2454755534be9daef977106a1b70d57e30cc9b80deba2df3f5f6a15","schema_version":"1.0","event_id":"sha256:2a9ef234a2454755534be9daef977106a1b70d57e30cc9b80deba2df3f5f6a15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CQRKSZP7PD3UCGNUZWFWLHURNM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQM5kWfBIeFC4qwWu+xTVKDVyeyqNKopkiNPPM7OTvSaDs0rL4YQ2U8ETYVavmcSlGC0GZKK2jblRq0aY7jNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:28:03.696186Z"},"content_sha256":"897626eba718a19e8e99b949e9fc62e17bced8398ed4143895c12706de889799","schema_version":"1.0","event_id":"sha256:897626eba718a19e8e99b949e9fc62e17bced8398ed4143895c12706de889799"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/bundle.json","state_url":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T04:28:03Z","links":{"resolver":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM","bundle":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/bundle.json","state":"https://pith.science/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQRKSZP7PD3UCGNUZWFWLHURNM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CQRKSZP7PD3UCGNUZWFWLHURNM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"16b63af33981292585b9685de23a73ae34fdbb64baeab68fc948e3805685ba37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-28T10:14:29Z","title_canon_sha256":"1dc9c31fa9a829b3df26410872118d2fe4c646cf128fd16e779ef5429654799a"},"schema_version":"1.0","source":{"id":"1902.10989","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10989","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10989v1","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10989","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"CQRKSZP7PD3U","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CQRKSZP7PD3UCGNU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CQRKSZP7","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:897626eba718a19e8e99b949e9fc62e17bced8398ed4143895c12706de889799","target":"graph","created_at":"2026-05-17T23:52:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Behcet Acikmese, Danylo Malyuta, David S. Bayard, Martin Cacan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-28T10:14:29Z","title":"Partition-based Feasible Integer Solution Pre-computation for Hybrid Model Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10989","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2a9ef234a2454755534be9daef977106a1b70d57e30cc9b80deba2df3f5f6a15","target":"record","created_at":"2026-05-17T23:52:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"16b63af33981292585b9685de23a73ae34fdbb64baeab68fc948e3805685ba37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-28T10:14:29Z","title_canon_sha256":"1dc9c31fa9a829b3df26410872118d2fe4c646cf128fd16e779ef5429654799a"},"schema_version":"1.0","source":{"id":"1902.10989","kind":"arxiv","version":1}},"canonical_sha256":"1422a965ff78f74119b4cd8b659e916b3e26f88c7708b1ba3d809eac5f2aeff8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1422a965ff78f74119b4cd8b659e916b3e26f88c7708b1ba3d809eac5f2aeff8","first_computed_at":"2026-05-17T23:52:26.168052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:26.168052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wLe6ECKw0XrYUn6k/LHpAFG79sG4u6aSk9JsLMwnBXxwjXsIpa/ts9DohMXXIRxgm5etu194AQS7xGd337hJBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:26.168580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10989","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a9ef234a2454755534be9daef977106a1b70d57e30cc9b80deba2df3f5f6a15","sha256:897626eba718a19e8e99b949e9fc62e17bced8398ed4143895c12706de889799"],"state_sha256":"4bad779f504fd7196863fa4578c6a1451c9a5f29dcd5b2b9219bc7f6cae02013"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c78uXiWrrMIs1W2fT5VFs4uXtewKiby7RXndy9/2tr8SbMrrFqR2trOhvPFXmQTFFNhnmYjKHBUFHGFg9Zj8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:28:03.698097Z","bundle_sha256":"09b207dd4198adb1f5e6b06a5a9cb82ce486aa6f499713f5483d47788b67991c"}}