{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6FTE4MAFBJ3FPVDGCTESEKIEIQ","short_pith_number":"pith:6FTE4MAF","schema_version":"1.0","canonical_sha256":"f1664e30050a7657d46614c92229044424024cb29c1defd789b00c583a38bd52","source":{"kind":"arxiv","id":"2109.05777","version":2},"attestation_state":"computed","paper":{"title":"A distributed framework for linear adaptive MPC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Ahmed Aboudonia, Andrea Iannelli, Anilkumar Parsi, John Lygeros, Roy S. Smith","submitted_at":"2021-09-13T08:55:56Z","abstract_excerpt":"Adaptive model predictive control (MPC) robustly ensures safety while reducing uncertainty during operation. In this paper, a distributed version is proposed to deal with network systems featuring multiple agents and limited communication. To solve the problem in a distributed manner, structure is imposed on the control design ingredients without sacrificing performance. Decentralized and distributed adaptation schemes that allow for a reduction of the uncertainty online compatibly with the network topology are also proposed. The algorithm ensures robust constraint satisfaction, recursive feas"},"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":"2109.05777","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2021-09-13T08:55:56Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"9e00ae8f47447235e8f93770c10f2a86bbb10d5db3d1d412abf94d4b527f3f10","abstract_canon_sha256":"523af64d5f617d8a73e5204231491ee697d62eeabe7ccc0cb05c98d293c48729"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:14.550868Z","signature_b64":"sZLZ/s7et2DaKB5gwm6uKvIShjS4BrpHIzdsFcVvmNQtqXoxLqkYpykMiLecSSqaMyc8HkTEsQzzEDGXxLkUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1664e30050a7657d46614c92229044424024cb29c1defd789b00c583a38bd52","last_reissued_at":"2026-07-05T08:08:14.550461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:14.550461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A distributed framework for linear adaptive MPC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Ahmed Aboudonia, Andrea Iannelli, Anilkumar Parsi, John Lygeros, Roy S. Smith","submitted_at":"2021-09-13T08:55:56Z","abstract_excerpt":"Adaptive model predictive control (MPC) robustly ensures safety while reducing uncertainty during operation. In this paper, a distributed version is proposed to deal with network systems featuring multiple agents and limited communication. To solve the problem in a distributed manner, structure is imposed on the control design ingredients without sacrificing performance. Decentralized and distributed adaptation schemes that allow for a reduction of the uncertainty online compatibly with the network topology are also proposed. The algorithm ensures robust constraint satisfaction, recursive feas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.05777","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.05777/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.05777","created_at":"2026-07-05T08:08:14.550516+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.05777v2","created_at":"2026-07-05T08:08:14.550516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.05777","created_at":"2026-07-05T08:08:14.550516+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FTE4MAFBJ3F","created_at":"2026-07-05T08:08:14.550516+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FTE4MAFBJ3FPVDG","created_at":"2026-07-05T08:08:14.550516+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FTE4MAF","created_at":"2026-07-05T08:08:14.550516+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/6FTE4MAFBJ3FPVDGCTESEKIEIQ","json":"https://pith.science/pith/6FTE4MAFBJ3FPVDGCTESEKIEIQ.json","graph_json":"https://pith.science/api/pith-number/6FTE4MAFBJ3FPVDGCTESEKIEIQ/graph.json","events_json":"https://pith.science/api/pith-number/6FTE4MAFBJ3FPVDGCTESEKIEIQ/events.json","paper":"https://pith.science/paper/6FTE4MAF"},"agent_actions":{"view_html":"https://pith.science/pith/6FTE4MAFBJ3FPVDGCTESEKIEIQ","download_json":"https://pith.science/pith/6FTE4MAFBJ3FPVDGCTESEKIEIQ.json","view_paper":"https://pith.science/paper/6FTE4MAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.05777&json=true","fetch_graph":"https://pith.science/api/pith-number/6FTE4MAFBJ3FPVDGCTESEKIEIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6FTE4MAFBJ3FPVDGCTESEKIEIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FTE4MAFBJ3FPVDGCTESEKIEIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FTE4MAFBJ3FPVDGCTESEKIEIQ/action/storage_attestation","attest_author":"https://pith.science/pith/6FTE4MAFBJ3FPVDGCTESEKIEIQ/action/author_attestation","sign_citation":"https://pith.science/pith/6FTE4MAFBJ3FPVDGCTESEKIEIQ/action/citation_signature","submit_replication":"https://pith.science/pith/6FTE4MAFBJ3FPVDGCTESEKIEIQ/action/replication_record"}},"created_at":"2026-07-05T08:08:14.550516+00:00","updated_at":"2026-07-05T08:08:14.550516+00:00"}