{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QTBGDOAYCWHFNHYSBG5D5GMH3D","short_pith_number":"pith:QTBGDOAY","canonical_record":{"source":{"id":"1603.05034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T11:10:06Z","cross_cats_sorted":[],"title_canon_sha256":"c4219a72daa28e0b24364c82b97980e104382ee1f5d9bc74825a7be6372211b6","abstract_canon_sha256":"13dbe94283ea24ed1efea4f80db0980c957125c7b56d04103e645d281ccd1036"},"schema_version":"1.0"},"canonical_sha256":"84c261b818158e569f1209ba3e9987d8ca83f00121706fb7ed5a7b58e2bd92b6","source":{"kind":"arxiv","id":"1603.05034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05034","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05034v1","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05034","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"QTBGDOAYCWHF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QTBGDOAYCWHFNHYS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QTBGDOAY","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QTBGDOAYCWHFNHYSBG5D5GMH3D","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T11:10:06Z","cross_cats_sorted":[],"title_canon_sha256":"c4219a72daa28e0b24364c82b97980e104382ee1f5d9bc74825a7be6372211b6","abstract_canon_sha256":"13dbe94283ea24ed1efea4f80db0980c957125c7b56d04103e645d281ccd1036"},"schema_version":"1.0"},"canonical_sha256":"84c261b818158e569f1209ba3e9987d8ca83f00121706fb7ed5a7b58e2bd92b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:58.154100Z","signature_b64":"nzQ5lW0oW3927Kkh8usJSjzi7TFnkB5fhTxTKlpHGHaOWjLg48gaOgumIMobhn+pF6IZUc/C3YpO3rTW5IAcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84c261b818158e569f1209ba3e9987d8ca83f00121706fb7ed5a7b58e2bd92b6","last_reissued_at":"2026-05-18T01:18:58.153675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:58.153675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05034","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-18T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaqVJF14saiY+xy8JK6OVM0mpMoJ74lke0rCrVQOODrw1sZteWIwsXbwkN/r9vOkt14c9pS6boQkvXzK3s1PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:22:35.970250Z"},"content_sha256":"049add2437fafaa6634fa1de20ec1826ad37b6bc02a6f0164f52ca2e9bc6aa33","schema_version":"1.0","event_id":"sha256:049add2437fafaa6634fa1de20ec1826ad37b6bc02a6f0164f52ca2e9bc6aa33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QTBGDOAYCWHFNHYSBG5D5GMH3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduced Memory Footprint in Multiparametric Quadratic Programming by Exploiting Low Rank Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill, Isak Nielsen","submitted_at":"2016-03-16T11:10:06Z","abstract_excerpt":"In multiparametric programming an optimization problem which is dependent on a parameter vector is solved parametrically. In control, multiparametric quadratic programming (mp-QP) problems have become increasingly important since the optimization problem arising in Model Predictive Control (MPC) can be cast as an mp-QP problem, which is referred to as explicit MPC. One of the main limitations with mp-QP and explicit MPC is the amount of memory required to store the parametric solution and the critical regions. In this paper, a method for exploiting low rank structure in the parametric solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05034","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-18T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yL5O29RclQR/NPW49pBGKnF8mRAqAi7fNAKFKiQpx5OBh/FyNNUuQ2xm0F+e6bqiSyarY3t7mpd9v0v6OO3dCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:22:35.970984Z"},"content_sha256":"5e6c6b072298d3974a048ae502330970f75097e464963ff753a543eba36182ec","schema_version":"1.0","event_id":"sha256:5e6c6b072298d3974a048ae502330970f75097e464963ff753a543eba36182ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/bundle.json","state_url":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/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-12T03:22:35Z","links":{"resolver":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D","bundle":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/bundle.json","state":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QTBGDOAYCWHFNHYSBG5D5GMH3D","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":"13dbe94283ea24ed1efea4f80db0980c957125c7b56d04103e645d281ccd1036","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T11:10:06Z","title_canon_sha256":"c4219a72daa28e0b24364c82b97980e104382ee1f5d9bc74825a7be6372211b6"},"schema_version":"1.0","source":{"id":"1603.05034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05034","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05034v1","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05034","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"QTBGDOAYCWHF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QTBGDOAYCWHFNHYS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QTBGDOAY","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:5e6c6b072298d3974a048ae502330970f75097e464963ff753a543eba36182ec","target":"graph","created_at":"2026-05-18T01:18:58Z","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":"In multiparametric programming an optimization problem which is dependent on a parameter vector is solved parametrically. In control, multiparametric quadratic programming (mp-QP) problems have become increasingly important since the optimization problem arising in Model Predictive Control (MPC) can be cast as an mp-QP problem, which is referred to as explicit MPC. One of the main limitations with mp-QP and explicit MPC is the amount of memory required to store the parametric solution and the critical regions. In this paper, a method for exploiting low rank structure in the parametric solution","authors_text":"Daniel Axehill, Isak Nielsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T11:10:06Z","title":"Reduced Memory Footprint in Multiparametric Quadratic Programming by Exploiting Low Rank Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05034","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:049add2437fafaa6634fa1de20ec1826ad37b6bc02a6f0164f52ca2e9bc6aa33","target":"record","created_at":"2026-05-18T01:18:58Z","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":"13dbe94283ea24ed1efea4f80db0980c957125c7b56d04103e645d281ccd1036","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T11:10:06Z","title_canon_sha256":"c4219a72daa28e0b24364c82b97980e104382ee1f5d9bc74825a7be6372211b6"},"schema_version":"1.0","source":{"id":"1603.05034","kind":"arxiv","version":1}},"canonical_sha256":"84c261b818158e569f1209ba3e9987d8ca83f00121706fb7ed5a7b58e2bd92b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84c261b818158e569f1209ba3e9987d8ca83f00121706fb7ed5a7b58e2bd92b6","first_computed_at":"2026-05-18T01:18:58.153675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:58.153675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nzQ5lW0oW3927Kkh8usJSjzi7TFnkB5fhTxTKlpHGHaOWjLg48gaOgumIMobhn+pF6IZUc/C3YpO3rTW5IAcCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:58.154100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:049add2437fafaa6634fa1de20ec1826ad37b6bc02a6f0164f52ca2e9bc6aa33","sha256:5e6c6b072298d3974a048ae502330970f75097e464963ff753a543eba36182ec"],"state_sha256":"e2a161c20bf70b04d40e98addd1cf07e5315a6b13f38d365c3082f1cb38cd2c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PN81p8/215yt4n9XU3PYFgQjAKaEciw7VIl+k1+xRtHEat372so6YcR2hlzB7vbmrzGpcCTEYfB9SiztH9iAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:22:35.975457Z","bundle_sha256":"6ff49d16e2b1c417ef2e45dab4b7d96b8af2e61fb47a22d7ef77af6f9e198d2f"}}