{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LJUXLQRPAQRW6KBQ4QXKNOHA3V","short_pith_number":"pith:LJUXLQRP","schema_version":"1.0","canonical_sha256":"5a6975c22f04236f2830e42ea6b8e0dd73db33287167451502853f2d7264e372","source":{"kind":"arxiv","id":"1303.6469","version":1},"attestation_state":"computed","paper":{"title":"Convex computation of the maximum controlled invariant set for polynomial control systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones (EPFL), CTU/FEE), Didier Henrion (LAAS, Milan Korda (EPFL)","submitted_at":"2013-03-26T13:06:04Z","abstract_excerpt":"We characterize the maximum controlled invariant (MCI) set for discrete- as well as continuous-time nonlinear dynamical systems as the solution of an infinite-dimensional linear programming problem. For systems with polynomial dynamics and compact semialgebraic state and control constraints, we describe a hierarchy of finite-dimensional linear matrix inequality (LMI) relaxations whose optimal values converge to the volume of the MCI set; dual to these LMI relaxations are sum-of-squares (SOS) problems providing a converging sequence of outer approximations to the MCI set. The approach is simple"},"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":"1303.6469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-26T13:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"7fd613a4ec72c9d5795d6207ffeceb150406d532b23ea3efd2286b421f20c122","abstract_canon_sha256":"d6b77222c9809fcb4d9bdcb3e73a300f044dae43c42d0ff9259ad3b6979682b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:49.396733Z","signature_b64":"WuCMHENT25ih3BfNCyH4kOBpKVb+yisVYgmwwLc9zhT106jghEO2O2AyT6VmG0kUDRS43F+AthjA8kgfWeRgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a6975c22f04236f2830e42ea6b8e0dd73db33287167451502853f2d7264e372","last_reissued_at":"2026-05-18T03:29:49.395948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:49.395948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex computation of the maximum controlled invariant set for polynomial control systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones (EPFL), CTU/FEE), Didier Henrion (LAAS, Milan Korda (EPFL)","submitted_at":"2013-03-26T13:06:04Z","abstract_excerpt":"We characterize the maximum controlled invariant (MCI) set for discrete- as well as continuous-time nonlinear dynamical systems as the solution of an infinite-dimensional linear programming problem. For systems with polynomial dynamics and compact semialgebraic state and control constraints, we describe a hierarchy of finite-dimensional linear matrix inequality (LMI) relaxations whose optimal values converge to the volume of the MCI set; dual to these LMI relaxations are sum-of-squares (SOS) problems providing a converging sequence of outer approximations to the MCI set. The approach is simple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6469","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":"1303.6469","created_at":"2026-05-18T03:29:49.396053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.6469v1","created_at":"2026-05-18T03:29:49.396053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6469","created_at":"2026-05-18T03:29:49.396053+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJUXLQRPAQRW","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJUXLQRPAQRW6KBQ","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJUXLQRP","created_at":"2026-05-18T12:27:51.066281+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/LJUXLQRPAQRW6KBQ4QXKNOHA3V","json":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V.json","graph_json":"https://pith.science/api/pith-number/LJUXLQRPAQRW6KBQ4QXKNOHA3V/graph.json","events_json":"https://pith.science/api/pith-number/LJUXLQRPAQRW6KBQ4QXKNOHA3V/events.json","paper":"https://pith.science/paper/LJUXLQRP"},"agent_actions":{"view_html":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V","download_json":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V.json","view_paper":"https://pith.science/paper/LJUXLQRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.6469&json=true","fetch_graph":"https://pith.science/api/pith-number/LJUXLQRPAQRW6KBQ4QXKNOHA3V/graph.json","fetch_events":"https://pith.science/api/pith-number/LJUXLQRPAQRW6KBQ4QXKNOHA3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/action/storage_attestation","attest_author":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/action/author_attestation","sign_citation":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/action/citation_signature","submit_replication":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/action/replication_record"}},"created_at":"2026-05-18T03:29:49.396053+00:00","updated_at":"2026-05-18T03:29:49.396053+00:00"}