{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N43PQHKKZUV7MZWVQAJB4LBH4D","short_pith_number":"pith:N43PQHKK","schema_version":"1.0","canonical_sha256":"6f36f81d4acd2bf666d580121e2c27e0e55cb2bc8d93e406156e305b58b72854","source":{"kind":"arxiv","id":"1407.6898","version":1},"attestation_state":"computed","paper":{"title":"A Parallel Riccati Factorization Algorithm with Applications to Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill, Isak Nielsen","submitted_at":"2014-07-25T13:57:44Z","abstract_excerpt":"Model Predictive Control (MPC) is increasing in popularity in industry as more efficient algorithms for solving the related optimization problem are developed. The main computational bottle-neck in on-line MPC is often the computation of the search step direction, i.e. the Newton step, which is often done using generic sparsity exploiting algorithms or Riccati recursions. However, as parallel hardware is becoming increasingly popular the demand for efficient parallel algorithms for solving the Newton step is increasing. In this paper a tailored, non-iterative parallel algorithm for computing t"},"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":"1407.6898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-25T13:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"707685d29f8cfa8aad5bd43c49401b1bf0b1fc7a49f050771ee51dc8b56e9284","abstract_canon_sha256":"f8cfd4954d7106874086e8db2b5270aa3fc89c9a3968572a75b860f11b03397f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:32.076941Z","signature_b64":"AaxSiGLLWjhRz/s7wt08tGc5priKjSKMS7nM20nXcrf9/LBKvOSwALnLk19N2Nzc72aDEwgXjM6fTWW2xPPGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f36f81d4acd2bf666d580121e2c27e0e55cb2bc8d93e406156e305b58b72854","last_reissued_at":"2026-05-18T02:46:32.076517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:32.076517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Riccati Factorization Algorithm with Applications to Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill, Isak Nielsen","submitted_at":"2014-07-25T13:57:44Z","abstract_excerpt":"Model Predictive Control (MPC) is increasing in popularity in industry as more efficient algorithms for solving the related optimization problem are developed. The main computational bottle-neck in on-line MPC is often the computation of the search step direction, i.e. the Newton step, which is often done using generic sparsity exploiting algorithms or Riccati recursions. However, as parallel hardware is becoming increasingly popular the demand for efficient parallel algorithms for solving the Newton step is increasing. In this paper a tailored, non-iterative parallel algorithm for computing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6898","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":"1407.6898","created_at":"2026-05-18T02:46:32.076570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6898v1","created_at":"2026-05-18T02:46:32.076570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6898","created_at":"2026-05-18T02:46:32.076570+00:00"},{"alias_kind":"pith_short_12","alias_value":"N43PQHKKZUV7","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N43PQHKKZUV7MZWV","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N43PQHKK","created_at":"2026-05-18T12:28:41.024544+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/N43PQHKKZUV7MZWVQAJB4LBH4D","json":"https://pith.science/pith/N43PQHKKZUV7MZWVQAJB4LBH4D.json","graph_json":"https://pith.science/api/pith-number/N43PQHKKZUV7MZWVQAJB4LBH4D/graph.json","events_json":"https://pith.science/api/pith-number/N43PQHKKZUV7MZWVQAJB4LBH4D/events.json","paper":"https://pith.science/paper/N43PQHKK"},"agent_actions":{"view_html":"https://pith.science/pith/N43PQHKKZUV7MZWVQAJB4LBH4D","download_json":"https://pith.science/pith/N43PQHKKZUV7MZWVQAJB4LBH4D.json","view_paper":"https://pith.science/paper/N43PQHKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6898&json=true","fetch_graph":"https://pith.science/api/pith-number/N43PQHKKZUV7MZWVQAJB4LBH4D/graph.json","fetch_events":"https://pith.science/api/pith-number/N43PQHKKZUV7MZWVQAJB4LBH4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N43PQHKKZUV7MZWVQAJB4LBH4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N43PQHKKZUV7MZWVQAJB4LBH4D/action/storage_attestation","attest_author":"https://pith.science/pith/N43PQHKKZUV7MZWVQAJB4LBH4D/action/author_attestation","sign_citation":"https://pith.science/pith/N43PQHKKZUV7MZWVQAJB4LBH4D/action/citation_signature","submit_replication":"https://pith.science/pith/N43PQHKKZUV7MZWVQAJB4LBH4D/action/replication_record"}},"created_at":"2026-05-18T02:46:32.076570+00:00","updated_at":"2026-05-18T02:46:32.076570+00:00"}