{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NK5YGZFGSMMQHXVLCTI25UYZWT","short_pith_number":"pith:NK5YGZFG","schema_version":"1.0","canonical_sha256":"6abb8364a6931903deab14d1aed319b4d27e6399b5bbd4cdeae417b17ffc6dba","source":{"kind":"arxiv","id":"2605.14846","version":1},"attestation_state":"computed","paper":{"title":"Successive convex optimization for transformer encoder model predictive control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mark Cannon, Xingxiao Chen","submitted_at":"2026-05-14T13:54:54Z","abstract_excerpt":"We propose a data-driven Model Predictive Control (MPC) framework that employs a transformer encoder to generate multi-step predictions. To handle the nonconvex attention mechanism, we derive difference of convex (DC) representations of the transformer encoder components and embed them in a successive convex programming (SCP) iteration. Recursive feasibility and convergence of the SCP iterates are guaranteed, and each iterate yields a solution estimate satisfying the problem constraints. Under mild assumptions, the SCP iteration converges to a locally optimal solution of the MPC problem. The a"},"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":"2605.14846","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T13:54:54Z","cross_cats_sorted":[],"title_canon_sha256":"e389aad930d11d724eb192228d73f5de8830fd6a772cb93bbc47e9342563501e","abstract_canon_sha256":"4d8ff2cfb961b335754ed831722a6c959af8bd531a91d4fc1786886c14084a8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:56.369069Z","signature_b64":"sUeyQSHImc5mHNgyLOolxO623nG3hiGUYT3najSnmFL7W3TdPziRbgDdfpZo9svndir4Sac5dq0iHZUI+SXJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6abb8364a6931903deab14d1aed319b4d27e6399b5bbd4cdeae417b17ffc6dba","last_reissued_at":"2026-05-17T23:38:56.368455Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:56.368455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive convex optimization for transformer encoder model predictive control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mark Cannon, Xingxiao Chen","submitted_at":"2026-05-14T13:54:54Z","abstract_excerpt":"We propose a data-driven Model Predictive Control (MPC) framework that employs a transformer encoder to generate multi-step predictions. To handle the nonconvex attention mechanism, we derive difference of convex (DC) representations of the transformer encoder components and embed them in a successive convex programming (SCP) iteration. Recursive feasibility and convergence of the SCP iterates are guaranteed, and each iterate yields a solution estimate satisfying the problem constraints. Under mild assumptions, the SCP iteration converges to a locally optimal solution of the MPC problem. The a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14846","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":"2605.14846","created_at":"2026-05-17T23:38:56.368551+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14846v1","created_at":"2026-05-17T23:38:56.368551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14846","created_at":"2026-05-17T23:38:56.368551+00:00"},{"alias_kind":"pith_short_12","alias_value":"NK5YGZFGSMMQ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"NK5YGZFGSMMQHXVL","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"NK5YGZFG","created_at":"2026-05-18T12:33:37.589309+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/NK5YGZFGSMMQHXVLCTI25UYZWT","json":"https://pith.science/pith/NK5YGZFGSMMQHXVLCTI25UYZWT.json","graph_json":"https://pith.science/api/pith-number/NK5YGZFGSMMQHXVLCTI25UYZWT/graph.json","events_json":"https://pith.science/api/pith-number/NK5YGZFGSMMQHXVLCTI25UYZWT/events.json","paper":"https://pith.science/paper/NK5YGZFG"},"agent_actions":{"view_html":"https://pith.science/pith/NK5YGZFGSMMQHXVLCTI25UYZWT","download_json":"https://pith.science/pith/NK5YGZFGSMMQHXVLCTI25UYZWT.json","view_paper":"https://pith.science/paper/NK5YGZFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14846&json=true","fetch_graph":"https://pith.science/api/pith-number/NK5YGZFGSMMQHXVLCTI25UYZWT/graph.json","fetch_events":"https://pith.science/api/pith-number/NK5YGZFGSMMQHXVLCTI25UYZWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NK5YGZFGSMMQHXVLCTI25UYZWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NK5YGZFGSMMQHXVLCTI25UYZWT/action/storage_attestation","attest_author":"https://pith.science/pith/NK5YGZFGSMMQHXVLCTI25UYZWT/action/author_attestation","sign_citation":"https://pith.science/pith/NK5YGZFGSMMQHXVLCTI25UYZWT/action/citation_signature","submit_replication":"https://pith.science/pith/NK5YGZFGSMMQHXVLCTI25UYZWT/action/replication_record"}},"created_at":"2026-05-17T23:38:56.368551+00:00","updated_at":"2026-05-17T23:38:56.368551+00:00"}