{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:D4NPM5QDGYPCEIISPWJFQUBUPQ","short_pith_number":"pith:D4NPM5QD","schema_version":"1.0","canonical_sha256":"1f1af67603361e2221127d925850347c05ddf9d474f8b9534715f5f9a0cfeba2","source":{"kind":"arxiv","id":"2511.13588","version":2},"attestation_state":"computed","paper":{"title":"Data-driven Acceleration of MPC with Guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","math.DS"],"primary_cat":"eess.SY","authors_text":"Agustin Castellano, Enrique Mallada, Shijie Pan","submitted_at":"2025-11-17T16:51:23Z","abstract_excerpt":"Model Predictive Control (MPC) is a powerful framework for optimal control but can be too slow for low-latency applications. We present a data-driven framework to accelerate MPC by replacing online optimization with a nonparametric policy constructed from offline MPC solutions. Our policy is greedy with respect to a constructed upper bound on the optimal cost-to-go, and can be implemented as a nonparametric lookup rule that is orders of magnitude faster than solving MPC online. Our analysis shows that under sufficient coverage conditions of the offline data, the policy is recursively feasible "},"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":"2511.13588","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2025-11-17T16:51:23Z","cross_cats_sorted":["cs.AI","cs.SY","math.DS"],"title_canon_sha256":"eae6850bfd3b028467943a98f0c6c95f14e1394d26ff93e80e7699da845fbc35","abstract_canon_sha256":"b4cb798148c64ba2f03964b434d0a2a0038282fe0ab818f4614f9f9bced21e09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:01.970349Z","signature_b64":"wo3b05CMZqUmbV0IYXqN411HwLlRDkvsHXluNv0ZKLvc3VdrNOnxcZ2TQZbpy/zfuyY9nj8pr5kZZokTMNHQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f1af67603361e2221127d925850347c05ddf9d474f8b9534715f5f9a0cfeba2","last_reissued_at":"2026-05-20T01:05:01.969454Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:01.969454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-driven Acceleration of MPC with Guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","math.DS"],"primary_cat":"eess.SY","authors_text":"Agustin Castellano, Enrique Mallada, Shijie Pan","submitted_at":"2025-11-17T16:51:23Z","abstract_excerpt":"Model Predictive Control (MPC) is a powerful framework for optimal control but can be too slow for low-latency applications. We present a data-driven framework to accelerate MPC by replacing online optimization with a nonparametric policy constructed from offline MPC solutions. Our policy is greedy with respect to a constructed upper bound on the optimal cost-to-go, and can be implemented as a nonparametric lookup rule that is orders of magnitude faster than solving MPC online. Our analysis shows that under sufficient coverage conditions of the offline data, the policy is recursively feasible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.13588","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/2511.13588/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":"2511.13588","created_at":"2026-05-20T01:05:01.969550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.13588v2","created_at":"2026-05-20T01:05:01.969550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.13588","created_at":"2026-05-20T01:05:01.969550+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4NPM5QDGYPC","created_at":"2026-05-20T01:05:01.969550+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4NPM5QDGYPCEIIS","created_at":"2026-05-20T01:05:01.969550+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4NPM5QD","created_at":"2026-05-20T01:05:01.969550+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/D4NPM5QDGYPCEIISPWJFQUBUPQ","json":"https://pith.science/pith/D4NPM5QDGYPCEIISPWJFQUBUPQ.json","graph_json":"https://pith.science/api/pith-number/D4NPM5QDGYPCEIISPWJFQUBUPQ/graph.json","events_json":"https://pith.science/api/pith-number/D4NPM5QDGYPCEIISPWJFQUBUPQ/events.json","paper":"https://pith.science/paper/D4NPM5QD"},"agent_actions":{"view_html":"https://pith.science/pith/D4NPM5QDGYPCEIISPWJFQUBUPQ","download_json":"https://pith.science/pith/D4NPM5QDGYPCEIISPWJFQUBUPQ.json","view_paper":"https://pith.science/paper/D4NPM5QD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.13588&json=true","fetch_graph":"https://pith.science/api/pith-number/D4NPM5QDGYPCEIISPWJFQUBUPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/D4NPM5QDGYPCEIISPWJFQUBUPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4NPM5QDGYPCEIISPWJFQUBUPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4NPM5QDGYPCEIISPWJFQUBUPQ/action/storage_attestation","attest_author":"https://pith.science/pith/D4NPM5QDGYPCEIISPWJFQUBUPQ/action/author_attestation","sign_citation":"https://pith.science/pith/D4NPM5QDGYPCEIISPWJFQUBUPQ/action/citation_signature","submit_replication":"https://pith.science/pith/D4NPM5QDGYPCEIISPWJFQUBUPQ/action/replication_record"}},"created_at":"2026-05-20T01:05:01.969550+00:00","updated_at":"2026-05-20T01:05:01.969550+00:00"}