{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:72OAUCRCRWRONNE7O2KFNAC6SK","short_pith_number":"pith:72OAUCRC","schema_version":"1.0","canonical_sha256":"fe9c0a0a228da2e6b49f769456805e92b7fbde9a3e1a56da143885333620e4a3","source":{"kind":"arxiv","id":"1610.02432","version":1},"attestation_state":"computed","paper":{"title":"Model Reduction of Linear Multi-Agent Systems by Clustering and Associated $\\mathcal{H}_2$- and $\\mathcal{H}_\\infty$-Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Harry L. Trentelman, Hidde-Jan Jongsma, Petar Mlinari\\'c, Peter Benner, Sara Grundel","submitted_at":"2016-10-07T21:42:32Z","abstract_excerpt":"In this paper, we study a model reduction technique for leader-follower networked multi-agent systems defined on weighted, undirected graphs with arbitrary linear multivariable agent dynamics. In the network graph of this network, nodes represent the agents and edges represent communication links between the agents. Only the leaders in the network receive an external input, the followers only exchange information with their neighbors. The reduced network is obtained by partitioning the set of nodes into disjoint sets, called clusters, and associating with each cluster a single, new, node in a "},"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":"1610.02432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-07T21:42:32Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"ce91b9d2667e3ebbda4ea1305dbf3077c54680e192145209007d96530053fb8c","abstract_canon_sha256":"70090655519de5763c097a8205abc4f6a8941f628382aaf51566221b8214edfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:51.517591Z","signature_b64":"FaIXuenI5t/4uK/w5UNbODm4pZwoHsS4bqw2zD+DLSkbvFruKJFHbaPWN3ynRVsLqTvgJ4LDHvB3zC19a2LGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe9c0a0a228da2e6b49f769456805e92b7fbde9a3e1a56da143885333620e4a3","last_reissued_at":"2026-05-18T01:02:51.517207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:51.517207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Reduction of Linear Multi-Agent Systems by Clustering and Associated $\\mathcal{H}_2$- and $\\mathcal{H}_\\infty$-Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Harry L. Trentelman, Hidde-Jan Jongsma, Petar Mlinari\\'c, Peter Benner, Sara Grundel","submitted_at":"2016-10-07T21:42:32Z","abstract_excerpt":"In this paper, we study a model reduction technique for leader-follower networked multi-agent systems defined on weighted, undirected graphs with arbitrary linear multivariable agent dynamics. In the network graph of this network, nodes represent the agents and edges represent communication links between the agents. Only the leaders in the network receive an external input, the followers only exchange information with their neighbors. The reduced network is obtained by partitioning the set of nodes into disjoint sets, called clusters, and associating with each cluster a single, new, node in a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02432","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":"1610.02432","created_at":"2026-05-18T01:02:51.517273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02432v1","created_at":"2026-05-18T01:02:51.517273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02432","created_at":"2026-05-18T01:02:51.517273+00:00"},{"alias_kind":"pith_short_12","alias_value":"72OAUCRCRWRO","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"72OAUCRCRWRONNE7","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"72OAUCRC","created_at":"2026-05-18T12:30:04.600751+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/72OAUCRCRWRONNE7O2KFNAC6SK","json":"https://pith.science/pith/72OAUCRCRWRONNE7O2KFNAC6SK.json","graph_json":"https://pith.science/api/pith-number/72OAUCRCRWRONNE7O2KFNAC6SK/graph.json","events_json":"https://pith.science/api/pith-number/72OAUCRCRWRONNE7O2KFNAC6SK/events.json","paper":"https://pith.science/paper/72OAUCRC"},"agent_actions":{"view_html":"https://pith.science/pith/72OAUCRCRWRONNE7O2KFNAC6SK","download_json":"https://pith.science/pith/72OAUCRCRWRONNE7O2KFNAC6SK.json","view_paper":"https://pith.science/paper/72OAUCRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02432&json=true","fetch_graph":"https://pith.science/api/pith-number/72OAUCRCRWRONNE7O2KFNAC6SK/graph.json","fetch_events":"https://pith.science/api/pith-number/72OAUCRCRWRONNE7O2KFNAC6SK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72OAUCRCRWRONNE7O2KFNAC6SK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72OAUCRCRWRONNE7O2KFNAC6SK/action/storage_attestation","attest_author":"https://pith.science/pith/72OAUCRCRWRONNE7O2KFNAC6SK/action/author_attestation","sign_citation":"https://pith.science/pith/72OAUCRCRWRONNE7O2KFNAC6SK/action/citation_signature","submit_replication":"https://pith.science/pith/72OAUCRCRWRONNE7O2KFNAC6SK/action/replication_record"}},"created_at":"2026-05-18T01:02:51.517273+00:00","updated_at":"2026-05-18T01:02:51.517273+00:00"}