{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:M57I3S4QUSAEKRPZCMFIJ5CNZL","short_pith_number":"pith:M57I3S4Q","canonical_record":{"source":{"id":"1902.10994","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-28T10:29:28Z","cross_cats_sorted":[],"title_canon_sha256":"b0664db48e7cb65fc26a341b32cd2eb9c4e9d2a49058498f2b88fea27077c848","abstract_canon_sha256":"0d3cc928fe16088550640c04707577828bdc1935c553592e429f57929799d059"},"schema_version":"1.0"},"canonical_sha256":"677e8dcb90a4804545f9130a84f44dcad61fbee640c8ba8983873ea1c5e75f8f","source":{"kind":"arxiv","id":"1902.10994","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10994","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10994v4","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10994","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"M57I3S4QUSAE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M57I3S4QUSAEKRPZ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M57I3S4Q","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:M57I3S4QUSAEKRPZCMFIJ5CNZL","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10994","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-28T10:29:28Z","cross_cats_sorted":[],"title_canon_sha256":"b0664db48e7cb65fc26a341b32cd2eb9c4e9d2a49058498f2b88fea27077c848","abstract_canon_sha256":"0d3cc928fe16088550640c04707577828bdc1935c553592e429f57929799d059"},"schema_version":"1.0"},"canonical_sha256":"677e8dcb90a4804545f9130a84f44dcad61fbee640c8ba8983873ea1c5e75f8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:42.532245Z","signature_b64":"sHhQB4jbVHZK6+j9yMu215YnYxEPPehhmMFJ8l7SHiYCMEVMFVtElAjfgZh6uUMtCeX/rDthPaEksOoaTWHuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"677e8dcb90a4804545f9130a84f44dcad61fbee640c8ba8983873ea1c5e75f8f","last_reissued_at":"2026-05-17T23:43:42.531597Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:42.531597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10994","source_version":4,"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:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lsd2zFVd7ICjL/Wqfu0K/h75FHZICSsRxlFHxI+QbjBpszy8oHtrUlvBUazChTBVrgVi5AiKTlLuZBI3T/VnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:22:50.176714Z"},"content_sha256":"e00609f4af7d521c20d70064700040b7d8fc297f840721efdab986310ca62627","schema_version":"1.0","event_id":"sha256:e00609f4af7d521c20d70064700040b7d8fc297f840721efdab986310ca62627"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:M57I3S4QUSAEKRPZCMFIJ5CNZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Multiparametric Mixed-integer Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Danylo Malyuta","submitted_at":"2019-02-28T10:29:28Z","abstract_excerpt":"We propose an algorithm for generating explicit solutions of multiparametric mixed-integer convex programs to within a given suboptimality tolerance. The algorithm is applicable to a very general class of optimization problems, but is most useful for hybrid model predictive control, where on-line implementation is hampered by the worst-case exponential complexity of mixed-integer solvers. The output is a simplicial partition which defines a static map from the current state to a suboptimal solution. The primary theoretical contribution of this paper is to introduce a non-zero optimal cost over"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10994","kind":"arxiv","version":4},"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:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XeAzSlJiOkN5hVdD/x8zyo4xLmRn/1dXXV+P2sdIr0ZV2wW+ckdtrY24JkCDW/u1IeKyPNOmavswZlZoToFYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:22:50.177059Z"},"content_sha256":"a58c2698679b5515c73ded33736f5bded70ff91bb16d4aee0303e779dad4129d","schema_version":"1.0","event_id":"sha256:a58c2698679b5515c73ded33736f5bded70ff91bb16d4aee0303e779dad4129d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M57I3S4QUSAEKRPZCMFIJ5CNZL/bundle.json","state_url":"https://pith.science/pith/M57I3S4QUSAEKRPZCMFIJ5CNZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M57I3S4QUSAEKRPZCMFIJ5CNZL/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-07-01T00:22:50Z","links":{"resolver":"https://pith.science/pith/M57I3S4QUSAEKRPZCMFIJ5CNZL","bundle":"https://pith.science/pith/M57I3S4QUSAEKRPZCMFIJ5CNZL/bundle.json","state":"https://pith.science/pith/M57I3S4QUSAEKRPZCMFIJ5CNZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M57I3S4QUSAEKRPZCMFIJ5CNZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M57I3S4QUSAEKRPZCMFIJ5CNZL","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":"0d3cc928fe16088550640c04707577828bdc1935c553592e429f57929799d059","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-28T10:29:28Z","title_canon_sha256":"b0664db48e7cb65fc26a341b32cd2eb9c4e9d2a49058498f2b88fea27077c848"},"schema_version":"1.0","source":{"id":"1902.10994","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10994","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10994v4","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10994","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"M57I3S4QUSAE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M57I3S4QUSAEKRPZ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M57I3S4Q","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:a58c2698679b5515c73ded33736f5bded70ff91bb16d4aee0303e779dad4129d","target":"graph","created_at":"2026-05-17T23:43:42Z","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":"We propose an algorithm for generating explicit solutions of multiparametric mixed-integer convex programs to within a given suboptimality tolerance. The algorithm is applicable to a very general class of optimization problems, but is most useful for hybrid model predictive control, where on-line implementation is hampered by the worst-case exponential complexity of mixed-integer solvers. The output is a simplicial partition which defines a static map from the current state to a suboptimal solution. The primary theoretical contribution of this paper is to introduce a non-zero optimal cost over","authors_text":"Behcet Acikmese, Danylo Malyuta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-28T10:29:28Z","title":"Approximate Multiparametric Mixed-integer Convex Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10994","kind":"arxiv","version":4},"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:e00609f4af7d521c20d70064700040b7d8fc297f840721efdab986310ca62627","target":"record","created_at":"2026-05-17T23:43:42Z","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":"0d3cc928fe16088550640c04707577828bdc1935c553592e429f57929799d059","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-28T10:29:28Z","title_canon_sha256":"b0664db48e7cb65fc26a341b32cd2eb9c4e9d2a49058498f2b88fea27077c848"},"schema_version":"1.0","source":{"id":"1902.10994","kind":"arxiv","version":4}},"canonical_sha256":"677e8dcb90a4804545f9130a84f44dcad61fbee640c8ba8983873ea1c5e75f8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"677e8dcb90a4804545f9130a84f44dcad61fbee640c8ba8983873ea1c5e75f8f","first_computed_at":"2026-05-17T23:43:42.531597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:42.531597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sHhQB4jbVHZK6+j9yMu215YnYxEPPehhmMFJ8l7SHiYCMEVMFVtElAjfgZh6uUMtCeX/rDthPaEksOoaTWHuAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:42.532245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10994","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e00609f4af7d521c20d70064700040b7d8fc297f840721efdab986310ca62627","sha256:a58c2698679b5515c73ded33736f5bded70ff91bb16d4aee0303e779dad4129d"],"state_sha256":"765075c264f0aab3d9879a9f4714a060fd6eb3531f0a9f34c5fce1c19110e884"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jQoWBhDzPwv7XIfrzr4tkdL2F9Ln/C/69bvz4W6ZusTG2DRgpbFIdymSu17eT67YrNKi11In1cEBjb61JzDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T00:22:50.179215Z","bundle_sha256":"4fe5b9ec887f63a0b1c0f6c416791509ccd8bd73bf28af0d8c5591cafb34bd78"}}