{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XUYAPIQNWOU6WXT62JSTRPQGZC","short_pith_number":"pith:XUYAPIQN","schema_version":"1.0","canonical_sha256":"bd3007a20db3a9eb5e7ed26538be06c8a1e45759f6a1539996afab13317ce242","source":{"kind":"arxiv","id":"2210.04361","version":3},"attestation_state":"computed","paper":{"title":"Iterative Convex Optimization for Model Predictive Control with Discrete-Time High-Order Control Barrier Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY","math.DS"],"primary_cat":"math.OC","authors_text":"Calin A. Belta, Jun Zeng, Koushil Sreenath, Shuo Liu","submitted_at":"2022-10-09T22:12:50Z","abstract_excerpt":"Safety is one of the fundamental challenges in control theory. Recently, multi-step optimal control problems for discrete-time dynamical systems were formulated to enforce stability, while subject to input constraints as well as safety-critical requirements using discrete-time control barrier functions within a model predictive control (MPC) framework. Existing work usually focus on the feasibility or the safety for the optimization problem, and the majority of the existing work restrict the discussions to relative-degree one control barrier functions. Additionally, the real-time computation i"},"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":"2210.04361","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-09T22:12:50Z","cross_cats_sorted":["cs.RO","cs.SY","eess.SY","math.DS"],"title_canon_sha256":"e1b872e4ddb6e6f07ddb0293bc0fdaba49600c14b04d6394eb1abd349cd3a5d6","abstract_canon_sha256":"61fbd3c18b1052d1bdeda5cb318245f033f38ab563ce8ba48750216fc450d279"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:26.251754Z","signature_b64":"c0bhIzy4YH7Ycb1XoiYG9i7P5tui25K7PNcWdJpZbySpvBqs+xQd6a0l0HjTxwG259dJ4PJnaG9NWlHETBMlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd3007a20db3a9eb5e7ed26538be06c8a1e45759f6a1539996afab13317ce242","last_reissued_at":"2026-07-05T06:30:26.251260Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:26.251260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Convex Optimization for Model Predictive Control with Discrete-Time High-Order Control Barrier Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY","math.DS"],"primary_cat":"math.OC","authors_text":"Calin A. Belta, Jun Zeng, Koushil Sreenath, Shuo Liu","submitted_at":"2022-10-09T22:12:50Z","abstract_excerpt":"Safety is one of the fundamental challenges in control theory. Recently, multi-step optimal control problems for discrete-time dynamical systems were formulated to enforce stability, while subject to input constraints as well as safety-critical requirements using discrete-time control barrier functions within a model predictive control (MPC) framework. Existing work usually focus on the feasibility or the safety for the optimization problem, and the majority of the existing work restrict the discussions to relative-degree one control barrier functions. Additionally, the real-time computation i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04361","kind":"arxiv","version":3},"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/2210.04361/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":"2210.04361","created_at":"2026-07-05T06:30:26.251330+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.04361v3","created_at":"2026-07-05T06:30:26.251330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04361","created_at":"2026-07-05T06:30:26.251330+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUYAPIQNWOU6","created_at":"2026-07-05T06:30:26.251330+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUYAPIQNWOU6WXT6","created_at":"2026-07-05T06:30:26.251330+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUYAPIQN","created_at":"2026-07-05T06:30:26.251330+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.23863","citing_title":"Cooptimizing Safety and Performance Using Safety Value-Constrained Model Predictive Control","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00388","citing_title":"First-Order Optimality Conditions for Mathematical Programming with Equilibrium Constraints","ref_index":85,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00387","citing_title":"Introduction to Exact Penalization for Mathematical Programming with Equilibrium Constraints","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00386","citing_title":"Introduction to Mathematical Programming with Equilibrium Constraints (MPECs) and Bilevel Optimization","ref_index":87,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XUYAPIQNWOU6WXT62JSTRPQGZC","json":"https://pith.science/pith/XUYAPIQNWOU6WXT62JSTRPQGZC.json","graph_json":"https://pith.science/api/pith-number/XUYAPIQNWOU6WXT62JSTRPQGZC/graph.json","events_json":"https://pith.science/api/pith-number/XUYAPIQNWOU6WXT62JSTRPQGZC/events.json","paper":"https://pith.science/paper/XUYAPIQN"},"agent_actions":{"view_html":"https://pith.science/pith/XUYAPIQNWOU6WXT62JSTRPQGZC","download_json":"https://pith.science/pith/XUYAPIQNWOU6WXT62JSTRPQGZC.json","view_paper":"https://pith.science/paper/XUYAPIQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.04361&json=true","fetch_graph":"https://pith.science/api/pith-number/XUYAPIQNWOU6WXT62JSTRPQGZC/graph.json","fetch_events":"https://pith.science/api/pith-number/XUYAPIQNWOU6WXT62JSTRPQGZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUYAPIQNWOU6WXT62JSTRPQGZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUYAPIQNWOU6WXT62JSTRPQGZC/action/storage_attestation","attest_author":"https://pith.science/pith/XUYAPIQNWOU6WXT62JSTRPQGZC/action/author_attestation","sign_citation":"https://pith.science/pith/XUYAPIQNWOU6WXT62JSTRPQGZC/action/citation_signature","submit_replication":"https://pith.science/pith/XUYAPIQNWOU6WXT62JSTRPQGZC/action/replication_record"}},"created_at":"2026-07-05T06:30:26.251330+00:00","updated_at":"2026-07-05T06:30:26.251330+00:00"}