{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LJUXLQRPAQRW6KBQ4QXKNOHA3V","short_pith_number":"pith:LJUXLQRP","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"},"canonical_sha256":"5a6975c22f04236f2830e42ea6b8e0dd73db33287167451502853f2d7264e372","source":{"kind":"arxiv","id":"1303.6469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6469","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6469v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6469","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"LJUXLQRPAQRW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LJUXLQRPAQRW6KBQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LJUXLQRP","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LJUXLQRPAQRW6KBQ4QXKNOHA3V","target":"record","payload":{"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"},"canonical_sha256":"5a6975c22f04236f2830e42ea6b8e0dd73db33287167451502853f2d7264e372","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"},"source_kind":"arxiv","source_id":"1303.6469","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:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WC1chNtZ5xmpL5eBF46H9d/BpkVnb6I71nueYi5FDVImag4hEAEWYsjTf0dY+6lP85FjoghC9ADkV7J1SlzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:48:39.712093Z"},"content_sha256":"c8768cb83e753c9ac096b81c3a979721f303bee0ac1b3e80e51524eaaa0c216a","schema_version":"1.0","event_id":"sha256:c8768cb83e753c9ac096b81c3a979721f303bee0ac1b3e80e51524eaaa0c216a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LJUXLQRPAQRW6KBQ4QXKNOHA3V","target":"graph","payload":{"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"},"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:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXvOM/rcxO987EIENKit2ESBdKMJCmQ713LrVEO2xxQ35PdcVLMVN0bl2+g+ZYEGOTthSRS7QgAFgnAEkNvzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:48:39.712489Z"},"content_sha256":"709797bc984639a8c7d63fab6a905849d30528543ca3909ac960300799c67976","schema_version":"1.0","event_id":"sha256:709797bc984639a8c7d63fab6a905849d30528543ca3909ac960300799c67976"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/bundle.json","state_url":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/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-29T06:48:39Z","links":{"resolver":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V","bundle":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/bundle.json","state":"https://pith.science/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJUXLQRPAQRW6KBQ4QXKNOHA3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LJUXLQRPAQRW6KBQ4QXKNOHA3V","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":"d6b77222c9809fcb4d9bdcb3e73a300f044dae43c42d0ff9259ad3b6979682b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-26T13:06:04Z","title_canon_sha256":"7fd613a4ec72c9d5795d6207ffeceb150406d532b23ea3efd2286b421f20c122"},"schema_version":"1.0","source":{"id":"1303.6469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6469","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6469v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6469","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"LJUXLQRPAQRW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LJUXLQRPAQRW6KBQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LJUXLQRP","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:709797bc984639a8c7d63fab6a905849d30528543ca3909ac960300799c67976","target":"graph","created_at":"2026-05-18T03:29:49Z","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 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","authors_text":"Colin N. Jones (EPFL), CTU/FEE), Didier Henrion (LAAS, Milan Korda (EPFL)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-26T13:06:04Z","title":"Convex computation of the maximum controlled invariant set for polynomial control systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6469","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:c8768cb83e753c9ac096b81c3a979721f303bee0ac1b3e80e51524eaaa0c216a","target":"record","created_at":"2026-05-18T03:29:49Z","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":"d6b77222c9809fcb4d9bdcb3e73a300f044dae43c42d0ff9259ad3b6979682b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-26T13:06:04Z","title_canon_sha256":"7fd613a4ec72c9d5795d6207ffeceb150406d532b23ea3efd2286b421f20c122"},"schema_version":"1.0","source":{"id":"1303.6469","kind":"arxiv","version":1}},"canonical_sha256":"5a6975c22f04236f2830e42ea6b8e0dd73db33287167451502853f2d7264e372","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a6975c22f04236f2830e42ea6b8e0dd73db33287167451502853f2d7264e372","first_computed_at":"2026-05-18T03:29:49.395948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:49.395948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WuCMHENT25ih3BfNCyH4kOBpKVb+yisVYgmwwLc9zhT106jghEO2O2AyT6VmG0kUDRS43F+AthjA8kgfWeRgAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:49.396733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8768cb83e753c9ac096b81c3a979721f303bee0ac1b3e80e51524eaaa0c216a","sha256:709797bc984639a8c7d63fab6a905849d30528543ca3909ac960300799c67976"],"state_sha256":"9d5444fc7d921360699cb4d54c0b42ffd77a41c3aef20b63091c79e32c5a29a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7t4jG2PW4Uay7hMdE9d93f513jIiBoUlNSUeyAG4J2cOigNxKwh/aVgkAMneMXDtG/c1VYAJFzjzz12HeQc9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T06:48:39.714763Z","bundle_sha256":"279e48330175500b50b7c811de140cbaec5178ea22187609d89b3f4bb4fec2af"}}