{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:63MZ75J6J2UP357HDX7SNBWNVM","short_pith_number":"pith:63MZ75J6","canonical_record":{"source":{"id":"1211.1239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-06T14:32:24Z","cross_cats_sorted":[],"title_canon_sha256":"6d2b9f71bd99952c1204e0582b3b7f707b047d7b62665b24214c7c67f1aec682","abstract_canon_sha256":"41c07d798c958d2bb9b8d685744a042443e603fe37576824d8d1cb9f8cc2edb5"},"schema_version":"1.0"},"canonical_sha256":"f6d99ff53e4ea8fdf7e71dff2686cdab2f6ca03ab75691abcc5ec142a58a5e2b","source":{"kind":"arxiv","id":"1211.1239","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1239","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1239v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1239","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"63MZ75J6J2UP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"63MZ75J6J2UP357H","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"63MZ75J6","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:63MZ75J6J2UP357HDX7SNBWNVM","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-06T14:32:24Z","cross_cats_sorted":[],"title_canon_sha256":"6d2b9f71bd99952c1204e0582b3b7f707b047d7b62665b24214c7c67f1aec682","abstract_canon_sha256":"41c07d798c958d2bb9b8d685744a042443e603fe37576824d8d1cb9f8cc2edb5"},"schema_version":"1.0"},"canonical_sha256":"f6d99ff53e4ea8fdf7e71dff2686cdab2f6ca03ab75691abcc5ec142a58a5e2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.948831Z","signature_b64":"BbxPeLwPbB6D8SZWwPy8V2kt7yk4308yzC7sh28SkvX9AxlA94C7fkIk5icmFYRNUuq4Wh9MfOLxAJ86QGT/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6d99ff53e4ea8fdf7e71dff2686cdab2f6ca03ab75691abcc5ec142a58a5e2b","last_reissued_at":"2026-05-18T00:58:17.947873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.947873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1239","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:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jt9fsWeiBtTL6MBXul+/SXcHHyjsv9fPMEp4sMMDbUOgvNWbpRK4AYEoV6ZeEXhFveDehgx8Eq6EG7O7wjH+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:59.869977Z"},"content_sha256":"79f288b659e0df2e89f0c6960a9296fd805b71bbc0a49027fdaee6241c8b2aab","schema_version":"1.0","event_id":"sha256:79f288b659e0df2e89f0c6960a9296fd805b71bbc0a49027fdaee6241c8b2aab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:63MZ75J6J2UP357HDX7SNBWNVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Robust Stability Analysis of Interconnected Uncertain Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Anders Rantzer, Martin S. Andersen, Sina Khoshfetrat Pakazad","submitted_at":"2012-11-06T14:32:24Z","abstract_excerpt":"This paper considers robust stability analysis of a large network of interconnected uncertain systems. To avoid analyzing the entire network as a single large, lumped system, we model the network interconnections with integral quadratic constraints. This approach yields a sparse linear matrix inequality which can be decomposed into a set of smaller, coupled linear matrix inequalities. This allows us to solve the analysis problem efficiently and in a distributed manner. We also show that the decomposed problem is equivalent to the original robustness analysis problem, and hence our method does "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1239","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:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npGVoX55KGyQYFSrSpcPG/yf+eY4/wTaWgWpdM2O1a2D4Tm2VL5yS8EaDxhWY4kG7nE0K6clwvI1QWfBFIo7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:59.870515Z"},"content_sha256":"79340065c7da387bb5445c87c07a932bf391883a22df2f4e00c89e313a21ffda","schema_version":"1.0","event_id":"sha256:79340065c7da387bb5445c87c07a932bf391883a22df2f4e00c89e313a21ffda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM/bundle.json","state_url":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63MZ75J6J2UP357HDX7SNBWNVM/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-05T21:09:59Z","links":{"resolver":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM","bundle":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM/bundle.json","state":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63MZ75J6J2UP357HDX7SNBWNVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:63MZ75J6J2UP357HDX7SNBWNVM","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":"41c07d798c958d2bb9b8d685744a042443e603fe37576824d8d1cb9f8cc2edb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-06T14:32:24Z","title_canon_sha256":"6d2b9f71bd99952c1204e0582b3b7f707b047d7b62665b24214c7c67f1aec682"},"schema_version":"1.0","source":{"id":"1211.1239","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1239","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1239v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1239","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"63MZ75J6J2UP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"63MZ75J6J2UP357H","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"63MZ75J6","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:79340065c7da387bb5445c87c07a932bf391883a22df2f4e00c89e313a21ffda","target":"graph","created_at":"2026-05-18T00:58:17Z","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":"This paper considers robust stability analysis of a large network of interconnected uncertain systems. To avoid analyzing the entire network as a single large, lumped system, we model the network interconnections with integral quadratic constraints. This approach yields a sparse linear matrix inequality which can be decomposed into a set of smaller, coupled linear matrix inequalities. This allows us to solve the analysis problem efficiently and in a distributed manner. We also show that the decomposed problem is equivalent to the original robustness analysis problem, and hence our method does ","authors_text":"Anders Hansson, Anders Rantzer, Martin S. Andersen, Sina Khoshfetrat Pakazad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-06T14:32:24Z","title":"Distributed Robust Stability Analysis of Interconnected Uncertain Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1239","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:79f288b659e0df2e89f0c6960a9296fd805b71bbc0a49027fdaee6241c8b2aab","target":"record","created_at":"2026-05-18T00:58:17Z","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":"41c07d798c958d2bb9b8d685744a042443e603fe37576824d8d1cb9f8cc2edb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-06T14:32:24Z","title_canon_sha256":"6d2b9f71bd99952c1204e0582b3b7f707b047d7b62665b24214c7c67f1aec682"},"schema_version":"1.0","source":{"id":"1211.1239","kind":"arxiv","version":1}},"canonical_sha256":"f6d99ff53e4ea8fdf7e71dff2686cdab2f6ca03ab75691abcc5ec142a58a5e2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6d99ff53e4ea8fdf7e71dff2686cdab2f6ca03ab75691abcc5ec142a58a5e2b","first_computed_at":"2026-05-18T00:58:17.947873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.947873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BbxPeLwPbB6D8SZWwPy8V2kt7yk4308yzC7sh28SkvX9AxlA94C7fkIk5icmFYRNUuq4Wh9MfOLxAJ86QGT/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.948831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1239","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79f288b659e0df2e89f0c6960a9296fd805b71bbc0a49027fdaee6241c8b2aab","sha256:79340065c7da387bb5445c87c07a932bf391883a22df2f4e00c89e313a21ffda"],"state_sha256":"bd7ea92b085209dcb63a30d59a2c5a66fee923263d54e7ac6038a2cad2ba9dbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJ+zhuD+holvYvlgi39R3boABMa5sNcUebWNOnMFop23YDl8W8tm8civ/BGQZv6fx1zk0B18wyTiRC9TerQUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:09:59.874407Z","bundle_sha256":"225e9ea70f9a4198a8af55c3548f838d9f2c2502d9d3044f9c19f64e9c906b73"}}