{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OXRQJ75K5HBR6XNXS3RVQ3OKDI","short_pith_number":"pith:OXRQJ75K","canonical_record":{"source":{"id":"1209.5077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-23T15:32:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c8202a2951487bd12ce85f22987b58d2c5874797d719c126878aa0cb2f82fd58","abstract_canon_sha256":"b6fc2cecf34ca973de710366d8b0522a682df20590a39f182fc41d04a0fe85bd"},"schema_version":"1.0"},"canonical_sha256":"75e304ffaae9c31f5db796e3586dca1a24bd9d9b3809f095f5cea93f8867110b","source":{"kind":"arxiv","id":"1209.5077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5077","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5077v1","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5077","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"OXRQJ75K5HBR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OXRQJ75K5HBR6XNX","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OXRQJ75K","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OXRQJ75K5HBR6XNXS3RVQ3OKDI","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-23T15:32:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c8202a2951487bd12ce85f22987b58d2c5874797d719c126878aa0cb2f82fd58","abstract_canon_sha256":"b6fc2cecf34ca973de710366d8b0522a682df20590a39f182fc41d04a0fe85bd"},"schema_version":"1.0"},"canonical_sha256":"75e304ffaae9c31f5db796e3586dca1a24bd9d9b3809f095f5cea93f8867110b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:59.324972Z","signature_b64":"jifVBNlmMezwa96hadTm0pFilcloyab50Q0/J6IZQNGS5PIxlr6G2R8OqedRA2YndIpqFvUZijH2MpdKKUqlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e304ffaae9c31f5db796e3586dca1a24bd9d9b3809f095f5cea93f8867110b","last_reissued_at":"2026-05-18T03:44:59.324266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:59.324266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5077","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:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYKZH6lLg0VcyENj4GzSbsAo32y82auBkxU0qkjgydIrdkozKhqmyrqdKifIO519F7Vk8GIs1iflizmsaHeuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:11:51.859463Z"},"content_sha256":"25793f4eef3cb9d3a3ac96b146bdc073dd6ffe93ca4e502ce6c81646d3bc8be3","schema_version":"1.0","event_id":"sha256:25793f4eef3cb9d3a3ac96b146bdc073dd6ffe93ca4e502ce6c81646d3bc8be3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OXRQJ75K5HBR6XNXS3RVQ3OKDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Reduction for Parameter-Dependent Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Farhad Farokhi, Henrik Sandberg, Karl H. Johansson","submitted_at":"2012-09-23T15:32:09Z","abstract_excerpt":"We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with fewer parameters or state variables. To do so, it minimizes the distance (i.e., H-infinity-norm of the difference) between the original system and its reduced version. We present a sub-optimal solution to this problem using sum-of-squares optimization methods. We present the results for both continuous-time and discrete-time systems. Lastly, we illustrate the ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5077","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:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxZVxm/YKJZrhE2uu+vsDfz8lC+R+IZqJuOSiY///xq0q9jzsjS4e6dSKhxHxGlBypxZL59abcf71sNlIy8VAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:11:51.859805Z"},"content_sha256":"e378c338312d824dc00404160911bbfb7b7d43f83777e45d621bbf84dd460add","schema_version":"1.0","event_id":"sha256:e378c338312d824dc00404160911bbfb7b7d43f83777e45d621bbf84dd460add"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXRQJ75K5HBR6XNXS3RVQ3OKDI/bundle.json","state_url":"https://pith.science/pith/OXRQJ75K5HBR6XNXS3RVQ3OKDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXRQJ75K5HBR6XNXS3RVQ3OKDI/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-02T22:11:51Z","links":{"resolver":"https://pith.science/pith/OXRQJ75K5HBR6XNXS3RVQ3OKDI","bundle":"https://pith.science/pith/OXRQJ75K5HBR6XNXS3RVQ3OKDI/bundle.json","state":"https://pith.science/pith/OXRQJ75K5HBR6XNXS3RVQ3OKDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXRQJ75K5HBR6XNXS3RVQ3OKDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OXRQJ75K5HBR6XNXS3RVQ3OKDI","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":"b6fc2cecf34ca973de710366d8b0522a682df20590a39f182fc41d04a0fe85bd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-23T15:32:09Z","title_canon_sha256":"c8202a2951487bd12ce85f22987b58d2c5874797d719c126878aa0cb2f82fd58"},"schema_version":"1.0","source":{"id":"1209.5077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5077","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5077v1","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5077","created_at":"2026-05-18T03:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"OXRQJ75K5HBR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OXRQJ75K5HBR6XNX","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OXRQJ75K","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:e378c338312d824dc00404160911bbfb7b7d43f83777e45d621bbf84dd460add","target":"graph","created_at":"2026-05-18T03:44:59Z","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 present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with fewer parameters or state variables. To do so, it minimizes the distance (i.e., H-infinity-norm of the difference) between the original system and its reduced version. We present a sub-optimal solution to this problem using sum-of-squares optimization methods. We present the results for both continuous-time and discrete-time systems. Lastly, we illustrate the ap","authors_text":"Farhad Farokhi, Henrik Sandberg, Karl H. Johansson","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-23T15:32:09Z","title":"Complexity Reduction for Parameter-Dependent Linear Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5077","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:25793f4eef3cb9d3a3ac96b146bdc073dd6ffe93ca4e502ce6c81646d3bc8be3","target":"record","created_at":"2026-05-18T03:44:59Z","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":"b6fc2cecf34ca973de710366d8b0522a682df20590a39f182fc41d04a0fe85bd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-09-23T15:32:09Z","title_canon_sha256":"c8202a2951487bd12ce85f22987b58d2c5874797d719c126878aa0cb2f82fd58"},"schema_version":"1.0","source":{"id":"1209.5077","kind":"arxiv","version":1}},"canonical_sha256":"75e304ffaae9c31f5db796e3586dca1a24bd9d9b3809f095f5cea93f8867110b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75e304ffaae9c31f5db796e3586dca1a24bd9d9b3809f095f5cea93f8867110b","first_computed_at":"2026-05-18T03:44:59.324266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:59.324266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jifVBNlmMezwa96hadTm0pFilcloyab50Q0/J6IZQNGS5PIxlr6G2R8OqedRA2YndIpqFvUZijH2MpdKKUqlDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:59.324972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25793f4eef3cb9d3a3ac96b146bdc073dd6ffe93ca4e502ce6c81646d3bc8be3","sha256:e378c338312d824dc00404160911bbfb7b7d43f83777e45d621bbf84dd460add"],"state_sha256":"63c5d298db61a8632efe2937db97e27412466f5de79c70d148907259a2a56ba0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7xXQVz61RZfNPIqkR3p+0uZGXaR+4CxfmPLXj+Tk2L4Qm0AzMqnDPTwDWpHKdUYxz8xTTbW5bLHUE45bWlpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:11:51.861702Z","bundle_sha256":"eb4c26718b7ef6380044d0373295f305c0367ed47d5e8a6cd478b323b578d7aa"}}