{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K537TYZJEKDDQLECILFGOXEKZE","short_pith_number":"pith:K537TYZJ","canonical_record":{"source":{"id":"1810.10372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-23T06:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"5ad7799ef5a62c4b46c31d93c9f443bb4e8308dde3b8b756313f32ad1ae53eb7","abstract_canon_sha256":"209855db4982f8ff759679b2d5bd5b52645ba797e7aab6131047600a07d7fea6"},"schema_version":"1.0"},"canonical_sha256":"5777f9e3292286382c8242ca675c8ac90e25021dcba44b53da4b32cee20552e5","source":{"kind":"arxiv","id":"1810.10372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10372","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10372v1","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10372","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"K537TYZJEKDD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K537TYZJEKDDQLEC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K537TYZJ","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K537TYZJEKDDQLECILFGOXEKZE","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-23T06:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"5ad7799ef5a62c4b46c31d93c9f443bb4e8308dde3b8b756313f32ad1ae53eb7","abstract_canon_sha256":"209855db4982f8ff759679b2d5bd5b52645ba797e7aab6131047600a07d7fea6"},"schema_version":"1.0"},"canonical_sha256":"5777f9e3292286382c8242ca675c8ac90e25021dcba44b53da4b32cee20552e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:23.349902Z","signature_b64":"Hh0iXyfT0b8FWAwYWIY7oOxUsRwDlkfHb6T9t1IH9O9vWD6v/SfbvUPC/uEauREhLGw2g4oqJ28KGC86q9uPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5777f9e3292286382c8242ca675c8ac90e25021dcba44b53da4b32cee20552e5","last_reissued_at":"2026-05-18T00:02:23.349329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:23.349329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10372","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-18T00:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GA1hIK12xCBoJAu+pl/7OQiPWP5eHr2bMLk7hxIChRXuUAhlNfD8jnW50kx9jiC2HNqEXn8FWzvl5Caq/MpkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:49:01.218056Z"},"content_sha256":"784b1df734eb553c2a7c5a0d8b07a908af468c4aa129800f1f8c63d64040b196","schema_version":"1.0","event_id":"sha256:784b1df734eb553c2a7c5a0d8b07a908af468c4aa129800f1f8c63d64040b196"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K537TYZJEKDDQLECILFGOXEKZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing control invariant sets in high dimension is easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Mazen Alamir, Mirko Fiacchini","submitted_at":"2018-10-23T06:26:08Z","abstract_excerpt":"In this paper we consider the problem of computing control invariant sets for linear controlled high-dimensional systems with constraints on the input and on the states. Set inclusions conditions for control invariance are presented that involve the N-step sets and are posed in form of linear programming problems. Such conditions allow to overcome the complexity limitation inherent to the set addition and vertices enumeration and can be applied also to high dimensional systems. The efficiency and scalability of the method are illustrated by computing approximations of the maximal control invar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10372","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-18T00:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXIe+URouUJl9j12gIvCTBrmq8Nvn3ausMeuHynMNxmyEj2IioshSv3XsChk8elop6VYetxV11F2+mgDQpJIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:49:01.218417Z"},"content_sha256":"33b801080f13f4908e58b2e96cce53ab05e20d3667e9a22afafbdbc1c1188f21","schema_version":"1.0","event_id":"sha256:33b801080f13f4908e58b2e96cce53ab05e20d3667e9a22afafbdbc1c1188f21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K537TYZJEKDDQLECILFGOXEKZE/bundle.json","state_url":"https://pith.science/pith/K537TYZJEKDDQLECILFGOXEKZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K537TYZJEKDDQLECILFGOXEKZE/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-02T20:49:01Z","links":{"resolver":"https://pith.science/pith/K537TYZJEKDDQLECILFGOXEKZE","bundle":"https://pith.science/pith/K537TYZJEKDDQLECILFGOXEKZE/bundle.json","state":"https://pith.science/pith/K537TYZJEKDDQLECILFGOXEKZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K537TYZJEKDDQLECILFGOXEKZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K537TYZJEKDDQLECILFGOXEKZE","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":"209855db4982f8ff759679b2d5bd5b52645ba797e7aab6131047600a07d7fea6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-23T06:26:08Z","title_canon_sha256":"5ad7799ef5a62c4b46c31d93c9f443bb4e8308dde3b8b756313f32ad1ae53eb7"},"schema_version":"1.0","source":{"id":"1810.10372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10372","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10372v1","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10372","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"K537TYZJEKDD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K537TYZJEKDDQLEC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K537TYZJ","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:33b801080f13f4908e58b2e96cce53ab05e20d3667e9a22afafbdbc1c1188f21","target":"graph","created_at":"2026-05-18T00:02:23Z","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":"In this paper we consider the problem of computing control invariant sets for linear controlled high-dimensional systems with constraints on the input and on the states. Set inclusions conditions for control invariance are presented that involve the N-step sets and are posed in form of linear programming problems. Such conditions allow to overcome the complexity limitation inherent to the set addition and vertices enumeration and can be applied also to high dimensional systems. The efficiency and scalability of the method are illustrated by computing approximations of the maximal control invar","authors_text":"Mazen Alamir, Mirko Fiacchini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-23T06:26:08Z","title":"Computing control invariant sets in high dimension is easy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10372","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:784b1df734eb553c2a7c5a0d8b07a908af468c4aa129800f1f8c63d64040b196","target":"record","created_at":"2026-05-18T00:02:23Z","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":"209855db4982f8ff759679b2d5bd5b52645ba797e7aab6131047600a07d7fea6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-23T06:26:08Z","title_canon_sha256":"5ad7799ef5a62c4b46c31d93c9f443bb4e8308dde3b8b756313f32ad1ae53eb7"},"schema_version":"1.0","source":{"id":"1810.10372","kind":"arxiv","version":1}},"canonical_sha256":"5777f9e3292286382c8242ca675c8ac90e25021dcba44b53da4b32cee20552e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5777f9e3292286382c8242ca675c8ac90e25021dcba44b53da4b32cee20552e5","first_computed_at":"2026-05-18T00:02:23.349329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:23.349329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hh0iXyfT0b8FWAwYWIY7oOxUsRwDlkfHb6T9t1IH9O9vWD6v/SfbvUPC/uEauREhLGw2g4oqJ28KGC86q9uPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:23.349902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:784b1df734eb553c2a7c5a0d8b07a908af468c4aa129800f1f8c63d64040b196","sha256:33b801080f13f4908e58b2e96cce53ab05e20d3667e9a22afafbdbc1c1188f21"],"state_sha256":"972843c7ff75b3c9a72ec6f1c28438769c4c72345e71d423e40cb71109045edd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbdPhoqfwl8uzUA9saySu0u4YEuye86ndhj3JgJH2GL6qujmx6wtpY9RQ6VpJr7s4SikbkFiljqpNsZ8VrJPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:49:01.220470Z","bundle_sha256":"1a0c47cd942e1cb95e79f75dd05dd5835067950113671f2ea9ef836f4dbb80a4"}}