{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MCUS6RGMBXLC67JNHOGEY7MNVL","short_pith_number":"pith:MCUS6RGM","schema_version":"1.0","canonical_sha256":"60a92f44cc0dd62f7d2d3b8c4c7d8daae3772bc38e961389509250a39a15bfa8","source":{"kind":"arxiv","id":"1311.2602","version":1},"attestation_state":"computed","paper":{"title":"Robust Stability Analysis of Sparsely 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":"2013-11-11T21:05:38Z","abstract_excerpt":"In this paper, we consider robust stability analysis of large-scale sparsely interconnected uncertain systems. By modeling the interconnections among the subsystems with integral quadratic constraints, we show that robust stability analysis of such systems can be performed by solving a set of sparse linear matrix inequalities. We also show that a sparse formulation of the analysis problem is equivalent to the classical formulation of the robustness analysis problem and hence does not introduce any additional conservativeness. The sparse formulation of the analysis problem allows us to apply me"},"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":"1311.2602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-11T21:05:38Z","cross_cats_sorted":[],"title_canon_sha256":"d2e40efb1dddf33398fa86af50de1f1eed77b43784e36567482d4e8364b41d7e","abstract_canon_sha256":"c33bef125e4caad26500cefe12207686533271691570d3620a78be3ac9d69b1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.616166Z","signature_b64":"JGQ/W69MZA4DC2qNk768WRei3+D34uo5lEV4ijw3fE5pQjxiv/XVBJD4oqEJFEQpZ8uPYdge6AifalhDk1dyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60a92f44cc0dd62f7d2d3b8c4c7d8daae3772bc38e961389509250a39a15bfa8","last_reissued_at":"2026-05-18T00:59:03.615600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.615600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Stability Analysis of Sparsely 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":"2013-11-11T21:05:38Z","abstract_excerpt":"In this paper, we consider robust stability analysis of large-scale sparsely interconnected uncertain systems. By modeling the interconnections among the subsystems with integral quadratic constraints, we show that robust stability analysis of such systems can be performed by solving a set of sparse linear matrix inequalities. We also show that a sparse formulation of the analysis problem is equivalent to the classical formulation of the robustness analysis problem and hence does not introduce any additional conservativeness. The sparse formulation of the analysis problem allows us to apply me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2602","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":"1311.2602","created_at":"2026-05-18T00:59:03.615692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2602v1","created_at":"2026-05-18T00:59:03.615692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2602","created_at":"2026-05-18T00:59:03.615692+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCUS6RGMBXLC","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCUS6RGMBXLC67JN","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCUS6RGM","created_at":"2026-05-18T12:27:52.871228+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/MCUS6RGMBXLC67JNHOGEY7MNVL","json":"https://pith.science/pith/MCUS6RGMBXLC67JNHOGEY7MNVL.json","graph_json":"https://pith.science/api/pith-number/MCUS6RGMBXLC67JNHOGEY7MNVL/graph.json","events_json":"https://pith.science/api/pith-number/MCUS6RGMBXLC67JNHOGEY7MNVL/events.json","paper":"https://pith.science/paper/MCUS6RGM"},"agent_actions":{"view_html":"https://pith.science/pith/MCUS6RGMBXLC67JNHOGEY7MNVL","download_json":"https://pith.science/pith/MCUS6RGMBXLC67JNHOGEY7MNVL.json","view_paper":"https://pith.science/paper/MCUS6RGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2602&json=true","fetch_graph":"https://pith.science/api/pith-number/MCUS6RGMBXLC67JNHOGEY7MNVL/graph.json","fetch_events":"https://pith.science/api/pith-number/MCUS6RGMBXLC67JNHOGEY7MNVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCUS6RGMBXLC67JNHOGEY7MNVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCUS6RGMBXLC67JNHOGEY7MNVL/action/storage_attestation","attest_author":"https://pith.science/pith/MCUS6RGMBXLC67JNHOGEY7MNVL/action/author_attestation","sign_citation":"https://pith.science/pith/MCUS6RGMBXLC67JNHOGEY7MNVL/action/citation_signature","submit_replication":"https://pith.science/pith/MCUS6RGMBXLC67JNHOGEY7MNVL/action/replication_record"}},"created_at":"2026-05-18T00:59:03.615692+00:00","updated_at":"2026-05-18T00:59:03.615692+00:00"}