{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VBJCVMGBQ5CPBMJV6TJX2HTURP","short_pith_number":"pith:VBJCVMGB","schema_version":"1.0","canonical_sha256":"a8522ab0c18744f0b135f4d37d1e748bde85f406d8ac616d9573468138d0160d","source":{"kind":"arxiv","id":"2111.14728","version":1},"attestation_state":"computed","paper":{"title":"Incremental Proximal Multi-Forecast Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stephen Boyd, Xinyue Shen","submitted_at":"2021-11-29T17:33:20Z","abstract_excerpt":"Multi-forecast model predictive control (MF-MPC) is a control policy that creates a plan of actions over a horizon for each of a given set of forecasted scenarios or contingencies, with the constraint that the first action in all plans be the same. In this note we show how these coupled plans can be found by solving a sequence of single plans, using an incremental proximal method. We refer to this policy as incremental proximal model predictive control (IP-MPC). We have observed that even when the iterations in IP-MPC are not carried out to convergence, we obtain a policy that achieves much of"},"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":"2111.14728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-11-29T17:33:20Z","cross_cats_sorted":[],"title_canon_sha256":"c132004e5dd5546c57f95d32ae2f9f9858b262abab4faab412f71fe9eceb1141","abstract_canon_sha256":"1fb9871f5161808d0bf705a5e506177ecd286240290cc93fc7565d853199ee13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:54.976945Z","signature_b64":"PiVcBE7ydMcekOfdpZsIJmNNW1xPrKn3y4+mVcSOC597dd+e6c1GG8yYQtCBz00H13PQ1MaeLWwJGUaauQ0XCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8522ab0c18744f0b135f4d37d1e748bde85f406d8ac616d9573468138d0160d","last_reissued_at":"2026-07-05T03:35:54.976571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:54.976571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Proximal Multi-Forecast Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stephen Boyd, Xinyue Shen","submitted_at":"2021-11-29T17:33:20Z","abstract_excerpt":"Multi-forecast model predictive control (MF-MPC) is a control policy that creates a plan of actions over a horizon for each of a given set of forecasted scenarios or contingencies, with the constraint that the first action in all plans be the same. In this note we show how these coupled plans can be found by solving a sequence of single plans, using an incremental proximal method. We refer to this policy as incremental proximal model predictive control (IP-MPC). We have observed that even when the iterations in IP-MPC are not carried out to convergence, we obtain a policy that achieves much of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14728","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.14728/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":"2111.14728","created_at":"2026-07-05T03:35:54.976628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.14728v1","created_at":"2026-07-05T03:35:54.976628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14728","created_at":"2026-07-05T03:35:54.976628+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBJCVMGBQ5CP","created_at":"2026-07-05T03:35:54.976628+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBJCVMGBQ5CPBMJV","created_at":"2026-07-05T03:35:54.976628+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBJCVMGB","created_at":"2026-07-05T03:35:54.976628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.09030","citing_title":"Aging-Aware Battery Control via Convex Optimization","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBJCVMGBQ5CPBMJV6TJX2HTURP","json":"https://pith.science/pith/VBJCVMGBQ5CPBMJV6TJX2HTURP.json","graph_json":"https://pith.science/api/pith-number/VBJCVMGBQ5CPBMJV6TJX2HTURP/graph.json","events_json":"https://pith.science/api/pith-number/VBJCVMGBQ5CPBMJV6TJX2HTURP/events.json","paper":"https://pith.science/paper/VBJCVMGB"},"agent_actions":{"view_html":"https://pith.science/pith/VBJCVMGBQ5CPBMJV6TJX2HTURP","download_json":"https://pith.science/pith/VBJCVMGBQ5CPBMJV6TJX2HTURP.json","view_paper":"https://pith.science/paper/VBJCVMGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.14728&json=true","fetch_graph":"https://pith.science/api/pith-number/VBJCVMGBQ5CPBMJV6TJX2HTURP/graph.json","fetch_events":"https://pith.science/api/pith-number/VBJCVMGBQ5CPBMJV6TJX2HTURP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBJCVMGBQ5CPBMJV6TJX2HTURP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBJCVMGBQ5CPBMJV6TJX2HTURP/action/storage_attestation","attest_author":"https://pith.science/pith/VBJCVMGBQ5CPBMJV6TJX2HTURP/action/author_attestation","sign_citation":"https://pith.science/pith/VBJCVMGBQ5CPBMJV6TJX2HTURP/action/citation_signature","submit_replication":"https://pith.science/pith/VBJCVMGBQ5CPBMJV6TJX2HTURP/action/replication_record"}},"created_at":"2026-07-05T03:35:54.976628+00:00","updated_at":"2026-07-05T03:35:54.976628+00:00"}