{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7HPCIWJSCV5EBH3LPVGOHOPCG4","short_pith_number":"pith:7HPCIWJS","canonical_record":{"source":{"id":"1303.1988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-08T13:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"afbd2ed7a2bd7872753b894e8dd2dd4975e5035dc6572edf144c332e62d4eda9","abstract_canon_sha256":"ad994fd617ab081c07616bc32f50a1b239e18d6dd09701ac34c67b57c8693cab"},"schema_version":"1.0"},"canonical_sha256":"f9de245932157a409f6b7d4ce3b9e2372a2da7faad97091e8884e404f7170897","source":{"kind":"arxiv","id":"1303.1988","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1988","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1988v1","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1988","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"7HPCIWJSCV5E","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7HPCIWJSCV5EBH3L","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7HPCIWJS","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7HPCIWJSCV5EBH3LPVGOHOPCG4","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-08T13:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"afbd2ed7a2bd7872753b894e8dd2dd4975e5035dc6572edf144c332e62d4eda9","abstract_canon_sha256":"ad994fd617ab081c07616bc32f50a1b239e18d6dd09701ac34c67b57c8693cab"},"schema_version":"1.0"},"canonical_sha256":"f9de245932157a409f6b7d4ce3b9e2372a2da7faad97091e8884e404f7170897","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:31.749353Z","signature_b64":"9uKHo/1wqEr/WIOqkSjxI+GtHbk9lZRS0LgwmsHAaJN+4A72BXGfD2yIu8de/OoG46WN9w1geektIMu4YTFFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9de245932157a409f6b7d4ce3b9e2372a2da7faad97091e8884e404f7170897","last_reissued_at":"2026-05-18T03:31:31.748507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:31.748507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1988","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rg4PmnyXmOvJupX+dmRA4zgMSMxjiaD1gpDnRAG+RPGFA3Fy3RRZ3GMbqzFLQCzUfp2VrjKhLhHgePMuFHd7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:01:05.198941Z"},"content_sha256":"25df0e46ff6c853aaa9d449c985787ea208e4c9c1877fa601fe143f7eecd4997","schema_version":"1.0","event_id":"sha256:25df0e46ff6c853aaa9d449c985787ea208e4c9c1877fa601fe143f7eecd4997"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7HPCIWJSCV5EBH3LPVGOHOPCG4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal switching control design for polynomial systems: an LMI approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"CTU/FEE), Didier Henrion (LAAS, IUF), Jamal Daafouz (CRAN, Mathieu Claeys (LAAS)","submitted_at":"2013-03-08T13:42:40Z","abstract_excerpt":"We propose a new LMI approach to the design of optimal switching sequences for polynomial dynamical systems with state constraints. We formulate the switching design problem as an optimal control problem which is then relaxed to a linear programming (LP) problem in the space of occupation measures. This infinite-dimensional LP can be solved numerically and approximately with a hierarchy of convex finite-dimensional LMIs. In contrast with most of the existing work on LMI methods, we have a guarantee of global optimality, in the sense that we obtain an asympotically converging (i.e. with vanishi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1988","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JdMTczCoimcIhVnSBL1EBo7/UiPwhG9CJ9mlkz5Kv3C7oog9djQy0b06vyCHFi6sSv0ALj+SKH0pMqqUdABIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:01:05.199537Z"},"content_sha256":"b5f7d2b4ab86deef965db5351f5eed9f9ef9bf3f4c91c503222f25bcc1eb1d5a","schema_version":"1.0","event_id":"sha256:b5f7d2b4ab86deef965db5351f5eed9f9ef9bf3f4c91c503222f25bcc1eb1d5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HPCIWJSCV5EBH3LPVGOHOPCG4/bundle.json","state_url":"https://pith.science/pith/7HPCIWJSCV5EBH3LPVGOHOPCG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HPCIWJSCV5EBH3LPVGOHOPCG4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T06:01:05Z","links":{"resolver":"https://pith.science/pith/7HPCIWJSCV5EBH3LPVGOHOPCG4","bundle":"https://pith.science/pith/7HPCIWJSCV5EBH3LPVGOHOPCG4/bundle.json","state":"https://pith.science/pith/7HPCIWJSCV5EBH3LPVGOHOPCG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HPCIWJSCV5EBH3LPVGOHOPCG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7HPCIWJSCV5EBH3LPVGOHOPCG4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ad994fd617ab081c07616bc32f50a1b239e18d6dd09701ac34c67b57c8693cab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-08T13:42:40Z","title_canon_sha256":"afbd2ed7a2bd7872753b894e8dd2dd4975e5035dc6572edf144c332e62d4eda9"},"schema_version":"1.0","source":{"id":"1303.1988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1988","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1988v1","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1988","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"7HPCIWJSCV5E","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7HPCIWJSCV5EBH3L","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7HPCIWJS","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:b5f7d2b4ab86deef965db5351f5eed9f9ef9bf3f4c91c503222f25bcc1eb1d5a","target":"graph","created_at":"2026-05-18T03:31:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose a new LMI approach to the design of optimal switching sequences for polynomial dynamical systems with state constraints. We formulate the switching design problem as an optimal control problem which is then relaxed to a linear programming (LP) problem in the space of occupation measures. This infinite-dimensional LP can be solved numerically and approximately with a hierarchy of convex finite-dimensional LMIs. In contrast with most of the existing work on LMI methods, we have a guarantee of global optimality, in the sense that we obtain an asympotically converging (i.e. with vanishi","authors_text":"CTU/FEE), Didier Henrion (LAAS, IUF), Jamal Daafouz (CRAN, Mathieu Claeys (LAAS)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-08T13:42:40Z","title":"Optimal switching control design for polynomial systems: an LMI approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1988","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:25df0e46ff6c853aaa9d449c985787ea208e4c9c1877fa601fe143f7eecd4997","target":"record","created_at":"2026-05-18T03:31:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ad994fd617ab081c07616bc32f50a1b239e18d6dd09701ac34c67b57c8693cab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-08T13:42:40Z","title_canon_sha256":"afbd2ed7a2bd7872753b894e8dd2dd4975e5035dc6572edf144c332e62d4eda9"},"schema_version":"1.0","source":{"id":"1303.1988","kind":"arxiv","version":1}},"canonical_sha256":"f9de245932157a409f6b7d4ce3b9e2372a2da7faad97091e8884e404f7170897","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9de245932157a409f6b7d4ce3b9e2372a2da7faad97091e8884e404f7170897","first_computed_at":"2026-05-18T03:31:31.748507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:31.748507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9uKHo/1wqEr/WIOqkSjxI+GtHbk9lZRS0LgwmsHAaJN+4A72BXGfD2yIu8de/OoG46WN9w1geektIMu4YTFFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:31.749353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25df0e46ff6c853aaa9d449c985787ea208e4c9c1877fa601fe143f7eecd4997","sha256:b5f7d2b4ab86deef965db5351f5eed9f9ef9bf3f4c91c503222f25bcc1eb1d5a"],"state_sha256":"fecb08945ef7d6bee3d869ba67e077bed2b40e0177d36c9cec122fc9f8e87ced"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyze23N/ijj6fzXHs807jgfVnVtWzLT3OWF7IVCwN1ncuz5EbYv7p3mM8z+nHKW7ARstiEZqJrujNSESzrlnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:01:05.202934Z","bundle_sha256":"a8a5669ca1b0091d911af7d06c23526f28da5e75de971ec2910d01bc649c163b"}}