{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SF46W7XBQVBJI5E46HXXKUNVGY","short_pith_number":"pith:SF46W7XB","schema_version":"1.0","canonical_sha256":"9179eb7ee1854294749cf1ef7551b53622558c841ca11f3b53cf68e8d6ead3c6","source":{"kind":"arxiv","id":"1012.1256","version":3},"attestation_state":"computed","paper":{"title":"Computation of Polytopic Invariants for Polynomial Dynamical Systems using Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.DS"],"primary_cat":"math.OC","authors_text":"Antoine Girard, Mohamed Amin Ben Sassi","submitted_at":"2010-12-06T17:47:49Z","abstract_excerpt":"This paper deals with the computation of polytopic invariant sets for polynomial dynamical systems. An invariant set of a dynamical system is a subset of the state space such that if the state of the system belongs to the set at a given instant, it will remain in the set forever in the future. Polytopic invariants for polynomial systems can be verified by solving a set of optimization problems involving multivariate polynomials on bounded polytopes. Using the blossoming principle together with properties of multi-affine functions on rectangles and Lagrangian duality, we show that certified low"},"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":"1012.1256","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-12-06T17:47:49Z","cross_cats_sorted":["cs.SY","math.DS"],"title_canon_sha256":"717a7e2f2a849a1f2620baa483e0f3c209087e29d16ace7ac6fff5f919ecad63","abstract_canon_sha256":"222adf4ffa36445d3da7a06941888e0f06183bd8a794581eb66a35858f26b170"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:15.200347Z","signature_b64":"f36tFDv+yiZgQ5M6TLP9Okb5gOgKqxw2LDXXQcPtmzUdZlqu9isF54FX5zuOeXQ4RtEMFoNEjDFqrVyY4W5oAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9179eb7ee1854294749cf1ef7551b53622558c841ca11f3b53cf68e8d6ead3c6","last_reissued_at":"2026-05-18T02:23:15.199854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:15.199854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computation of Polytopic Invariants for Polynomial Dynamical Systems using Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.DS"],"primary_cat":"math.OC","authors_text":"Antoine Girard, Mohamed Amin Ben Sassi","submitted_at":"2010-12-06T17:47:49Z","abstract_excerpt":"This paper deals with the computation of polytopic invariant sets for polynomial dynamical systems. An invariant set of a dynamical system is a subset of the state space such that if the state of the system belongs to the set at a given instant, it will remain in the set forever in the future. Polytopic invariants for polynomial systems can be verified by solving a set of optimization problems involving multivariate polynomials on bounded polytopes. Using the blossoming principle together with properties of multi-affine functions on rectangles and Lagrangian duality, we show that certified low"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1256","kind":"arxiv","version":3},"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":"1012.1256","created_at":"2026-05-18T02:23:15.199925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1256v3","created_at":"2026-05-18T02:23:15.199925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1256","created_at":"2026-05-18T02:23:15.199925+00:00"},{"alias_kind":"pith_short_12","alias_value":"SF46W7XBQVBJ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SF46W7XBQVBJI5E4","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SF46W7XB","created_at":"2026-05-18T12:26:13.927090+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/SF46W7XBQVBJI5E46HXXKUNVGY","json":"https://pith.science/pith/SF46W7XBQVBJI5E46HXXKUNVGY.json","graph_json":"https://pith.science/api/pith-number/SF46W7XBQVBJI5E46HXXKUNVGY/graph.json","events_json":"https://pith.science/api/pith-number/SF46W7XBQVBJI5E46HXXKUNVGY/events.json","paper":"https://pith.science/paper/SF46W7XB"},"agent_actions":{"view_html":"https://pith.science/pith/SF46W7XBQVBJI5E46HXXKUNVGY","download_json":"https://pith.science/pith/SF46W7XBQVBJI5E46HXXKUNVGY.json","view_paper":"https://pith.science/paper/SF46W7XB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1256&json=true","fetch_graph":"https://pith.science/api/pith-number/SF46W7XBQVBJI5E46HXXKUNVGY/graph.json","fetch_events":"https://pith.science/api/pith-number/SF46W7XBQVBJI5E46HXXKUNVGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SF46W7XBQVBJI5E46HXXKUNVGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SF46W7XBQVBJI5E46HXXKUNVGY/action/storage_attestation","attest_author":"https://pith.science/pith/SF46W7XBQVBJI5E46HXXKUNVGY/action/author_attestation","sign_citation":"https://pith.science/pith/SF46W7XBQVBJI5E46HXXKUNVGY/action/citation_signature","submit_replication":"https://pith.science/pith/SF46W7XBQVBJI5E46HXXKUNVGY/action/replication_record"}},"created_at":"2026-05-18T02:23:15.199925+00:00","updated_at":"2026-05-18T02:23:15.199925+00:00"}