{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:T2OVSADYZMG7NOAQDGZU55SHA3","short_pith_number":"pith:T2OVSADY","schema_version":"1.0","canonical_sha256":"9e9d590078cb0df6b81019b34ef64706f300a1a2b0f0551098283523be3cb41f","source":{"kind":"arxiv","id":"1107.1580","version":1},"attestation_state":"computed","paper":{"title":"Controller Synthesis for Robust Invariance of Polynomial Dynamical Systems using Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Antoine Girard, Mohamed Amin Ben Sassi","submitted_at":"2011-07-08T09:10:29Z","abstract_excerpt":"In this paper, we consider a control synthesis problem for a class of polynomial dynamical systems subject to bounded disturbances and with input constraints. More precisely, we aim at synthesizing at the same time a controller and an invariant set for the controlled system under all admissible disturbances. We propose a computational method to solve this problem. Given a candidate polyhedral invariant, we show that controller synthesis can be formulated as an optimization problem involving polynomial cost functions over bounded polytopes for which effective linear programming relaxations can "},"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":"1107.1580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-08T09:10:29Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"26114e67416554e21f80881e0176d31f10c32ace065f8dcb59e3c067256af003","abstract_canon_sha256":"78d33c32abe2700a14770781e698863130707b3f04bf4bb9b6cb44d9f88e8e4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:35.380846Z","signature_b64":"Jn2ffE+jMykq0X7FWiBRrjOCwLZ9ILMBiT9UkThjfDAtOxx9oTiWRNsbvQ57kCJUS8HJIafDkMGbHZRZchNADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e9d590078cb0df6b81019b34ef64706f300a1a2b0f0551098283523be3cb41f","last_reissued_at":"2026-05-18T04:18:35.380309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:35.380309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controller Synthesis for Robust Invariance of Polynomial Dynamical Systems using Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Antoine Girard, Mohamed Amin Ben Sassi","submitted_at":"2011-07-08T09:10:29Z","abstract_excerpt":"In this paper, we consider a control synthesis problem for a class of polynomial dynamical systems subject to bounded disturbances and with input constraints. More precisely, we aim at synthesizing at the same time a controller and an invariant set for the controlled system under all admissible disturbances. We propose a computational method to solve this problem. Given a candidate polyhedral invariant, we show that controller synthesis can be formulated as an optimization problem involving polynomial cost functions over bounded polytopes for which effective linear programming relaxations can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1580","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":"1107.1580","created_at":"2026-05-18T04:18:35.380378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1580v1","created_at":"2026-05-18T04:18:35.380378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1580","created_at":"2026-05-18T04:18:35.380378+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2OVSADYZMG7","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2OVSADYZMG7NOAQ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2OVSADY","created_at":"2026-05-18T12:26:41.206345+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/T2OVSADYZMG7NOAQDGZU55SHA3","json":"https://pith.science/pith/T2OVSADYZMG7NOAQDGZU55SHA3.json","graph_json":"https://pith.science/api/pith-number/T2OVSADYZMG7NOAQDGZU55SHA3/graph.json","events_json":"https://pith.science/api/pith-number/T2OVSADYZMG7NOAQDGZU55SHA3/events.json","paper":"https://pith.science/paper/T2OVSADY"},"agent_actions":{"view_html":"https://pith.science/pith/T2OVSADYZMG7NOAQDGZU55SHA3","download_json":"https://pith.science/pith/T2OVSADYZMG7NOAQDGZU55SHA3.json","view_paper":"https://pith.science/paper/T2OVSADY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1580&json=true","fetch_graph":"https://pith.science/api/pith-number/T2OVSADYZMG7NOAQDGZU55SHA3/graph.json","fetch_events":"https://pith.science/api/pith-number/T2OVSADYZMG7NOAQDGZU55SHA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2OVSADYZMG7NOAQDGZU55SHA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2OVSADYZMG7NOAQDGZU55SHA3/action/storage_attestation","attest_author":"https://pith.science/pith/T2OVSADYZMG7NOAQDGZU55SHA3/action/author_attestation","sign_citation":"https://pith.science/pith/T2OVSADYZMG7NOAQDGZU55SHA3/action/citation_signature","submit_replication":"https://pith.science/pith/T2OVSADYZMG7NOAQDGZU55SHA3/action/replication_record"}},"created_at":"2026-05-18T04:18:35.380378+00:00","updated_at":"2026-05-18T04:18:35.380378+00:00"}