{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:63MZ75J6J2UP357HDX7SNBWNVM","short_pith_number":"pith:63MZ75J6","schema_version":"1.0","canonical_sha256":"f6d99ff53e4ea8fdf7e71dff2686cdab2f6ca03ab75691abcc5ec142a58a5e2b","source":{"kind":"arxiv","id":"1211.1239","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.1239","created_at":"2026-05-18T00:58:17.948050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1239v1","created_at":"2026-05-18T00:58:17.948050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1239","created_at":"2026-05-18T00:58:17.948050+00:00"},{"alias_kind":"pith_short_12","alias_value":"63MZ75J6J2UP","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"63MZ75J6J2UP357H","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"63MZ75J6","created_at":"2026-05-18T12:26:56.085431+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/63MZ75J6J2UP357HDX7SNBWNVM","json":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM.json","graph_json":"https://pith.science/api/pith-number/63MZ75J6J2UP357HDX7SNBWNVM/graph.json","events_json":"https://pith.science/api/pith-number/63MZ75J6J2UP357HDX7SNBWNVM/events.json","paper":"https://pith.science/paper/63MZ75J6"},"agent_actions":{"view_html":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM","download_json":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM.json","view_paper":"https://pith.science/paper/63MZ75J6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1239&json=true","fetch_graph":"https://pith.science/api/pith-number/63MZ75J6J2UP357HDX7SNBWNVM/graph.json","fetch_events":"https://pith.science/api/pith-number/63MZ75J6J2UP357HDX7SNBWNVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM/action/storage_attestation","attest_author":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM/action/author_attestation","sign_citation":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM/action/citation_signature","submit_replication":"https://pith.science/pith/63MZ75J6J2UP357HDX7SNBWNVM/action/replication_record"}},"created_at":"2026-05-18T00:58:17.948050+00:00","updated_at":"2026-05-18T00:58:17.948050+00:00"}