{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VGRV6EY533YCAJO4YGVSGBMLCC","short_pith_number":"pith:VGRV6EY5","schema_version":"1.0","canonical_sha256":"a9a35f131ddef02025dcc1ab23058b10bea25c965038004e16b83f4bf279cf2a","source":{"kind":"arxiv","id":"1208.1751","version":2},"attestation_state":"computed","paper":{"title":"Convex computation of the region of attraction of polynomial control systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"CTU/FEE), Didier Henrion (LAAS, Milan Korda (EPFL)","submitted_at":"2012-08-08T19:50:39Z","abstract_excerpt":"We address the long-standing problem of computing the region of attraction (ROA) of a target set (e.g., a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input constraints. We show that the ROA can be computed by solving an infinite-dimensional convex linear programming (LP) problem over the space of measures. In turn, this problem can be solved approximately via a classical converging hierarchy of convex finite-dimensional linear matrix inequalities (LMIs). Our approach is genuinely primal in the sense that convexity "},"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":"1208.1751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-08T19:50:39Z","cross_cats_sorted":[],"title_canon_sha256":"28cb8e33380782a0c1fda9eac4fe3c8aa37fad9ac7a63f1e34efcfeec04144b3","abstract_canon_sha256":"52937b799cd432d4734d6fa823c5f51fdcf73f85cf9834b4987e383ad918f081"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:03.614778Z","signature_b64":"aeyCnd0GL5A9QSfUL2LggmJfExhKpSHaS910DVGdiapxt+rSNKwlnDQE9EqJgCsIq+uO3NBjypTJDV7w7+k9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9a35f131ddef02025dcc1ab23058b10bea25c965038004e16b83f4bf279cf2a","last_reissued_at":"2026-05-18T03:06:03.614173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:03.614173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex computation of the region of attraction of polynomial control systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"CTU/FEE), Didier Henrion (LAAS, Milan Korda (EPFL)","submitted_at":"2012-08-08T19:50:39Z","abstract_excerpt":"We address the long-standing problem of computing the region of attraction (ROA) of a target set (e.g., a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input constraints. We show that the ROA can be computed by solving an infinite-dimensional convex linear programming (LP) problem over the space of measures. In turn, this problem can be solved approximately via a classical converging hierarchy of convex finite-dimensional linear matrix inequalities (LMIs). Our approach is genuinely primal in the sense that convexity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1751","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":""},"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":"1208.1751","created_at":"2026-05-18T03:06:03.614262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1751v2","created_at":"2026-05-18T03:06:03.614262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1751","created_at":"2026-05-18T03:06:03.614262+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGRV6EY533YC","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGRV6EY533YCAJO4","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGRV6EY5","created_at":"2026-05-18T12:27:25.539911+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/VGRV6EY533YCAJO4YGVSGBMLCC","json":"https://pith.science/pith/VGRV6EY533YCAJO4YGVSGBMLCC.json","graph_json":"https://pith.science/api/pith-number/VGRV6EY533YCAJO4YGVSGBMLCC/graph.json","events_json":"https://pith.science/api/pith-number/VGRV6EY533YCAJO4YGVSGBMLCC/events.json","paper":"https://pith.science/paper/VGRV6EY5"},"agent_actions":{"view_html":"https://pith.science/pith/VGRV6EY533YCAJO4YGVSGBMLCC","download_json":"https://pith.science/pith/VGRV6EY533YCAJO4YGVSGBMLCC.json","view_paper":"https://pith.science/paper/VGRV6EY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1751&json=true","fetch_graph":"https://pith.science/api/pith-number/VGRV6EY533YCAJO4YGVSGBMLCC/graph.json","fetch_events":"https://pith.science/api/pith-number/VGRV6EY533YCAJO4YGVSGBMLCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGRV6EY533YCAJO4YGVSGBMLCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGRV6EY533YCAJO4YGVSGBMLCC/action/storage_attestation","attest_author":"https://pith.science/pith/VGRV6EY533YCAJO4YGVSGBMLCC/action/author_attestation","sign_citation":"https://pith.science/pith/VGRV6EY533YCAJO4YGVSGBMLCC/action/citation_signature","submit_replication":"https://pith.science/pith/VGRV6EY533YCAJO4YGVSGBMLCC/action/replication_record"}},"created_at":"2026-05-18T03:06:03.614262+00:00","updated_at":"2026-05-18T03:06:03.614262+00:00"}