{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QTBGDOAYCWHFNHYSBG5D5GMH3D","short_pith_number":"pith:QTBGDOAY","schema_version":"1.0","canonical_sha256":"84c261b818158e569f1209ba3e9987d8ca83f00121706fb7ed5a7b58e2bd92b6","source":{"kind":"arxiv","id":"1603.05034","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.05034","created_at":"2026-05-18T01:18:58.153742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05034v1","created_at":"2026-05-18T01:18:58.153742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05034","created_at":"2026-05-18T01:18:58.153742+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTBGDOAYCWHF","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTBGDOAYCWHFNHYS","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTBGDOAY","created_at":"2026-05-18T12:30:41.710351+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/QTBGDOAYCWHFNHYSBG5D5GMH3D","json":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D.json","graph_json":"https://pith.science/api/pith-number/QTBGDOAYCWHFNHYSBG5D5GMH3D/graph.json","events_json":"https://pith.science/api/pith-number/QTBGDOAYCWHFNHYSBG5D5GMH3D/events.json","paper":"https://pith.science/paper/QTBGDOAY"},"agent_actions":{"view_html":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D","download_json":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D.json","view_paper":"https://pith.science/paper/QTBGDOAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05034&json=true","fetch_graph":"https://pith.science/api/pith-number/QTBGDOAYCWHFNHYSBG5D5GMH3D/graph.json","fetch_events":"https://pith.science/api/pith-number/QTBGDOAYCWHFNHYSBG5D5GMH3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/action/storage_attestation","attest_author":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/action/author_attestation","sign_citation":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/action/citation_signature","submit_replication":"https://pith.science/pith/QTBGDOAYCWHFNHYSBG5D5GMH3D/action/replication_record"}},"created_at":"2026-05-18T01:18:58.153742+00:00","updated_at":"2026-05-18T01:18:58.153742+00:00"}