{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6EWJE5TIHOBHRQWFDW34YLV7OA","short_pith_number":"pith:6EWJE5TI","schema_version":"1.0","canonical_sha256":"f12c9276683b8278c2c51db7cc2ebf703d0c84f126f902c19426ab878375ce1f","source":{"kind":"arxiv","id":"1803.07340","version":1},"attestation_state":"computed","paper":{"title":"Efficient Robust Model Predictive Control using Chordality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Sina Khoshfetrat Pakazad","submitted_at":"2018-03-20T09:54:52Z","abstract_excerpt":"In this paper we show that chordal structure can be used to devise efficient optimization methods for robust model predictive control problems. The chordal structure is used both for computing search directions efficiently as well as for distributing all the other computations in an interior-point method for solving the problem. The framework enables efficient parallel computations."},"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":"1803.07340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-20T09:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"e114f7e96ed03d0d08b99c3b3e1012bcf1ade8ee23f780fa591edb0ff5e5e6fc","abstract_canon_sha256":"17e6e8b7a6c6b1ac6e635bebcf92f7e5bfbf7658915a72f49d95be13c44d46bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:33.593060Z","signature_b64":"wriDine5qXSmxGVOH1GoWHsb4dNfXYildIboQ1oW4iuAb+rFrXZHJSrGhJBUrKjjGyyNUf4PCzM8jnzRn16FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f12c9276683b8278c2c51db7cc2ebf703d0c84f126f902c19426ab878375ce1f","last_reissued_at":"2026-05-18T00:20:33.592427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:33.592427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Robust Model Predictive Control using Chordality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Sina Khoshfetrat Pakazad","submitted_at":"2018-03-20T09:54:52Z","abstract_excerpt":"In this paper we show that chordal structure can be used to devise efficient optimization methods for robust model predictive control problems. The chordal structure is used both for computing search directions efficiently as well as for distributing all the other computations in an interior-point method for solving the problem. The framework enables efficient parallel computations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07340","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":"1803.07340","created_at":"2026-05-18T00:20:33.592515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07340v1","created_at":"2026-05-18T00:20:33.592515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07340","created_at":"2026-05-18T00:20:33.592515+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EWJE5TIHOBH","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EWJE5TIHOBHRQWF","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EWJE5TI","created_at":"2026-05-18T12:32:08.215937+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/6EWJE5TIHOBHRQWFDW34YLV7OA","json":"https://pith.science/pith/6EWJE5TIHOBHRQWFDW34YLV7OA.json","graph_json":"https://pith.science/api/pith-number/6EWJE5TIHOBHRQWFDW34YLV7OA/graph.json","events_json":"https://pith.science/api/pith-number/6EWJE5TIHOBHRQWFDW34YLV7OA/events.json","paper":"https://pith.science/paper/6EWJE5TI"},"agent_actions":{"view_html":"https://pith.science/pith/6EWJE5TIHOBHRQWFDW34YLV7OA","download_json":"https://pith.science/pith/6EWJE5TIHOBHRQWFDW34YLV7OA.json","view_paper":"https://pith.science/paper/6EWJE5TI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07340&json=true","fetch_graph":"https://pith.science/api/pith-number/6EWJE5TIHOBHRQWFDW34YLV7OA/graph.json","fetch_events":"https://pith.science/api/pith-number/6EWJE5TIHOBHRQWFDW34YLV7OA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EWJE5TIHOBHRQWFDW34YLV7OA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EWJE5TIHOBHRQWFDW34YLV7OA/action/storage_attestation","attest_author":"https://pith.science/pith/6EWJE5TIHOBHRQWFDW34YLV7OA/action/author_attestation","sign_citation":"https://pith.science/pith/6EWJE5TIHOBHRQWFDW34YLV7OA/action/citation_signature","submit_replication":"https://pith.science/pith/6EWJE5TIHOBHRQWFDW34YLV7OA/action/replication_record"}},"created_at":"2026-05-18T00:20:33.592515+00:00","updated_at":"2026-05-18T00:20:33.592515+00:00"}