{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WIJXHDKJI6GTZ32CG5637FEGWX","short_pith_number":"pith:WIJXHDKJ","canonical_record":{"source":{"id":"1402.2066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-10T08:46:28Z","cross_cats_sorted":[],"title_canon_sha256":"ffe04fa564e08f970f81e8385ca0f7e7252d637e65901fe0c2df3f0bf3c32b4c","abstract_canon_sha256":"11da2158b504668cd4813fea9b7ec49090a1f2144c56c9aae2bf676985c72acc"},"schema_version":"1.0"},"canonical_sha256":"b213738d49478d3cef42377dbf9486b5c31c0c7a93b20f082cf71a643e24cafb","source":{"kind":"arxiv","id":"1402.2066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2066","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2066v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2066","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"WIJXHDKJI6GT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WIJXHDKJI6GTZ32C","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WIJXHDKJ","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WIJXHDKJI6GTZ32CG5637FEGWX","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-10T08:46:28Z","cross_cats_sorted":[],"title_canon_sha256":"ffe04fa564e08f970f81e8385ca0f7e7252d637e65901fe0c2df3f0bf3c32b4c","abstract_canon_sha256":"11da2158b504668cd4813fea9b7ec49090a1f2144c56c9aae2bf676985c72acc"},"schema_version":"1.0"},"canonical_sha256":"b213738d49478d3cef42377dbf9486b5c31c0c7a93b20f082cf71a643e24cafb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:32.453126Z","signature_b64":"Y4QCA2rocDYDHT+VWvnYkka/BY5jc3ZB68dK7rJaj/okENPcC9/1JMPCsDCKS73+ozvbdTr2u7z9T9bn4NwYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b213738d49478d3cef42377dbf9486b5c31c0c7a93b20f082cf71a643e24cafb","last_reissued_at":"2026-05-18T02:59:32.452524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:32.452524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2066","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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5MICTs796fBGkGIUKkn4xhlfoSAMJNYHExa7b7zqlmM0pJ8lYtATkNbe+Dg3npzmnbDdT61Gt2HG2bOZJi/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:00:15.983362Z"},"content_sha256":"eb046413ee420bc11338e43e80cd29e9786623ab1d7fd6062aa03dea87301231","schema_version":"1.0","event_id":"sha256:eb046413ee420bc11338e43e80cd29e9786623ab1d7fd6062aa03dea87301231"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WIJXHDKJI6GTZ32CG5637FEGWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Robustness Analysis of Interconnected Uncertain Systems Using Chordal Decomposition","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":"2014-02-10T08:46:28Z","abstract_excerpt":"Large-scale interconnected uncertain systems commonly have large state and uncertainty dimensions. Aside from the heavy computational cost of solving centralized robust stability analysis techniques, privacy requirements in the network can also introduce further issues. In this paper, we utilize IQC analysis for analyzing large-scale interconnected uncertain systems and we evade these issues by describing a decomposition scheme that is based on the interconnection structure of the system. This scheme is based on the so-called chordal decomposition and does not add any conservativeness to the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2066","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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLJJowuoXDFXZU+GFRO9XwYJU8keTwkA6y+Xj+2a795AyiU4C0m9wX52CUvrFi+I2SHpz5U5mT0KiMdoIkKpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:00:15.984147Z"},"content_sha256":"235ee488054a9fc97b8cee5462f35928e9f2e101219fbe1db122cb2d0aeebd8b","schema_version":"1.0","event_id":"sha256:235ee488054a9fc97b8cee5462f35928e9f2e101219fbe1db122cb2d0aeebd8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIJXHDKJI6GTZ32CG5637FEGWX/bundle.json","state_url":"https://pith.science/pith/WIJXHDKJI6GTZ32CG5637FEGWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIJXHDKJI6GTZ32CG5637FEGWX/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-06T04:00:15Z","links":{"resolver":"https://pith.science/pith/WIJXHDKJI6GTZ32CG5637FEGWX","bundle":"https://pith.science/pith/WIJXHDKJI6GTZ32CG5637FEGWX/bundle.json","state":"https://pith.science/pith/WIJXHDKJI6GTZ32CG5637FEGWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIJXHDKJI6GTZ32CG5637FEGWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WIJXHDKJI6GTZ32CG5637FEGWX","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":"11da2158b504668cd4813fea9b7ec49090a1f2144c56c9aae2bf676985c72acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-10T08:46:28Z","title_canon_sha256":"ffe04fa564e08f970f81e8385ca0f7e7252d637e65901fe0c2df3f0bf3c32b4c"},"schema_version":"1.0","source":{"id":"1402.2066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2066","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2066v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2066","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"WIJXHDKJI6GT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WIJXHDKJI6GTZ32C","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WIJXHDKJ","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:235ee488054a9fc97b8cee5462f35928e9f2e101219fbe1db122cb2d0aeebd8b","target":"graph","created_at":"2026-05-18T02:59:32Z","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":"Large-scale interconnected uncertain systems commonly have large state and uncertainty dimensions. Aside from the heavy computational cost of solving centralized robust stability analysis techniques, privacy requirements in the network can also introduce further issues. In this paper, we utilize IQC analysis for analyzing large-scale interconnected uncertain systems and we evade these issues by describing a decomposition scheme that is based on the interconnection structure of the system. This scheme is based on the so-called chordal decomposition and does not add any conservativeness to the a","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":"2014-02-10T08:46:28Z","title":"Distributed Robustness Analysis of Interconnected Uncertain Systems Using Chordal Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2066","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:eb046413ee420bc11338e43e80cd29e9786623ab1d7fd6062aa03dea87301231","target":"record","created_at":"2026-05-18T02:59:32Z","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":"11da2158b504668cd4813fea9b7ec49090a1f2144c56c9aae2bf676985c72acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-10T08:46:28Z","title_canon_sha256":"ffe04fa564e08f970f81e8385ca0f7e7252d637e65901fe0c2df3f0bf3c32b4c"},"schema_version":"1.0","source":{"id":"1402.2066","kind":"arxiv","version":1}},"canonical_sha256":"b213738d49478d3cef42377dbf9486b5c31c0c7a93b20f082cf71a643e24cafb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b213738d49478d3cef42377dbf9486b5c31c0c7a93b20f082cf71a643e24cafb","first_computed_at":"2026-05-18T02:59:32.452524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:32.452524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y4QCA2rocDYDHT+VWvnYkka/BY5jc3ZB68dK7rJaj/okENPcC9/1JMPCsDCKS73+ozvbdTr2u7z9T9bn4NwYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:32.453126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb046413ee420bc11338e43e80cd29e9786623ab1d7fd6062aa03dea87301231","sha256:235ee488054a9fc97b8cee5462f35928e9f2e101219fbe1db122cb2d0aeebd8b"],"state_sha256":"f8c378f2a6cb8f6a624fbe2b0e49fe15dd887a2f1294ac2c93ec86620c6c23b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yyJuAkF+zNVSbr0JQDROA6X2tBvWYEfro2fVlqnKXvOxD+sKX+HRXfVM8VBdB8ae3DZ6wNqxTg01fi++NSuSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T04:00:15.988422Z","bundle_sha256":"f8eaa03af305c1d7c24881c718cba7674236c0a83565d7baa765a2f650808d50"}}