{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JAREKMMOVBWY66CQ72FNME227D","short_pith_number":"pith:JAREKMMO","schema_version":"1.0","canonical_sha256":"482245318ea86d8f7850fe8ad6135af8e9bb775e41eb07498919cb85aa5e1853","source":{"kind":"arxiv","id":"1401.1369","version":1},"attestation_state":"computed","paper":{"title":"Controlling the level of sparsity in MPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill","submitted_at":"2014-01-07T13:32:05Z","abstract_excerpt":"In optimization routines used for on-line Model Predictive Control (MPC), linear systems of equations are usually solved in each iteration. This is true both for Active Set (AS) methods as well as for Interior Point (IP) methods, and for linear MPC as well as for nonlinear MPC and hybrid MPC. The main computational effort is spent while solving these linear systems of equations, and hence, it is of greatest interest to solve them efficiently. Classically, the optimization problem has been formulated in either of two different ways. One of them leading to a sparse linear system of equations inv"},"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":"1401.1369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-07T13:32:05Z","cross_cats_sorted":[],"title_canon_sha256":"84e2927da1e7ed353bbe9df3982e8444e718a7ac15eb1a1d4a9ad7bedc4499ce","abstract_canon_sha256":"7a76b2912f5f2b4715dd1061939126fe09bf59c6d6b2d83a40775eb1591e4942"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:08.662077Z","signature_b64":"jyI2M6pntsf2qTnzIopktZadI2gw3yedbveTT5OfXNDtYQSrRV+KK8OshI6M2GW1k9+s58FRFGhz7qyfuWkvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"482245318ea86d8f7850fe8ad6135af8e9bb775e41eb07498919cb85aa5e1853","last_reissued_at":"2026-05-18T03:03:08.661355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:08.661355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controlling the level of sparsity in MPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill","submitted_at":"2014-01-07T13:32:05Z","abstract_excerpt":"In optimization routines used for on-line Model Predictive Control (MPC), linear systems of equations are usually solved in each iteration. This is true both for Active Set (AS) methods as well as for Interior Point (IP) methods, and for linear MPC as well as for nonlinear MPC and hybrid MPC. The main computational effort is spent while solving these linear systems of equations, and hence, it is of greatest interest to solve them efficiently. Classically, the optimization problem has been formulated in either of two different ways. One of them leading to a sparse linear system of equations inv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1369","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":"1401.1369","created_at":"2026-05-18T03:03:08.661473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1369v1","created_at":"2026-05-18T03:03:08.661473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1369","created_at":"2026-05-18T03:03:08.661473+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAREKMMOVBWY","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAREKMMOVBWY66CQ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAREKMMO","created_at":"2026-05-18T12:28:33.132498+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/JAREKMMOVBWY66CQ72FNME227D","json":"https://pith.science/pith/JAREKMMOVBWY66CQ72FNME227D.json","graph_json":"https://pith.science/api/pith-number/JAREKMMOVBWY66CQ72FNME227D/graph.json","events_json":"https://pith.science/api/pith-number/JAREKMMOVBWY66CQ72FNME227D/events.json","paper":"https://pith.science/paper/JAREKMMO"},"agent_actions":{"view_html":"https://pith.science/pith/JAREKMMOVBWY66CQ72FNME227D","download_json":"https://pith.science/pith/JAREKMMOVBWY66CQ72FNME227D.json","view_paper":"https://pith.science/paper/JAREKMMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1369&json=true","fetch_graph":"https://pith.science/api/pith-number/JAREKMMOVBWY66CQ72FNME227D/graph.json","fetch_events":"https://pith.science/api/pith-number/JAREKMMOVBWY66CQ72FNME227D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAREKMMOVBWY66CQ72FNME227D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAREKMMOVBWY66CQ72FNME227D/action/storage_attestation","attest_author":"https://pith.science/pith/JAREKMMOVBWY66CQ72FNME227D/action/author_attestation","sign_citation":"https://pith.science/pith/JAREKMMOVBWY66CQ72FNME227D/action/citation_signature","submit_replication":"https://pith.science/pith/JAREKMMOVBWY66CQ72FNME227D/action/replication_record"}},"created_at":"2026-05-18T03:03:08.661473+00:00","updated_at":"2026-05-18T03:03:08.661473+00:00"}