{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NB23DYU3ZTNPII337H3XU7ZXIP","short_pith_number":"pith:NB23DYU3","schema_version":"1.0","canonical_sha256":"6875b1e29bccdaf4237bf9f77a7f3743e79c60721a3986c463e9e1d1b7d10fe7","source":{"kind":"arxiv","id":"2312.15929","version":1},"attestation_state":"computed","paper":{"title":"Controlling identical linear multi-agent systems over directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"cs.MA","authors_text":"Giulia Giordano, Isabelle Queinnec (LAAS-MAC), Luca Zaccarian (LAAS-MAC), Nicola Zaupa (LAAS-MAC, Sophie Tarbouriech (LAAS-MAC), UT3)","submitted_at":"2023-12-26T07:48:31Z","abstract_excerpt":"We consider the problem of synchronizing a multi-agent system (MAS) composed of several identical linear systems connected through a directed graph.To design a suitable controller, we construct conditions based on Bilinear Matrix Inequalities (BMIs) that ensure state synchronization.Since these conditions are non-convex, we propose an iterative algorithm based on a suitable relaxation that allows us to formulate Linear Matrix Inequality (LMI) conditions.As a result, the algorithm yields a common static state-feedback matrix for the controller that satisfies general linear performance constrain"},"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":"2312.15929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2023-12-26T07:48:31Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"a6acece08f0cf4145fd5f64bccfeb059787306a7f1d64c255f60cce739bb7782","abstract_canon_sha256":"a7ec179f93a0cb9bdf42f2c3b8dcecaa9209a17cce302994739d8dd6596e9921"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:25.603239Z","signature_b64":"UIk0EWHbHQ9ehRH0UNPVC1fii3EKY8nRNPAaOdRZkXEctZe7LNvtGEqUU7AeoClkRgM+2Um5J/Itp9HfN+RODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6875b1e29bccdaf4237bf9f77a7f3743e79c60721a3986c463e9e1d1b7d10fe7","last_reissued_at":"2026-07-05T07:36:25.602769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:25.602769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controlling identical linear multi-agent systems over directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"cs.MA","authors_text":"Giulia Giordano, Isabelle Queinnec (LAAS-MAC), Luca Zaccarian (LAAS-MAC), Nicola Zaupa (LAAS-MAC, Sophie Tarbouriech (LAAS-MAC), UT3)","submitted_at":"2023-12-26T07:48:31Z","abstract_excerpt":"We consider the problem of synchronizing a multi-agent system (MAS) composed of several identical linear systems connected through a directed graph.To design a suitable controller, we construct conditions based on Bilinear Matrix Inequalities (BMIs) that ensure state synchronization.Since these conditions are non-convex, we propose an iterative algorithm based on a suitable relaxation that allows us to formulate Linear Matrix Inequality (LMI) conditions.As a result, the algorithm yields a common static state-feedback matrix for the controller that satisfies general linear performance constrain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15929","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.15929/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2312.15929","created_at":"2026-07-05T07:36:25.602830+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.15929v1","created_at":"2026-07-05T07:36:25.602830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15929","created_at":"2026-07-05T07:36:25.602830+00:00"},{"alias_kind":"pith_short_12","alias_value":"NB23DYU3ZTNP","created_at":"2026-07-05T07:36:25.602830+00:00"},{"alias_kind":"pith_short_16","alias_value":"NB23DYU3ZTNPII33","created_at":"2026-07-05T07:36:25.602830+00:00"},{"alias_kind":"pith_short_8","alias_value":"NB23DYU3","created_at":"2026-07-05T07:36:25.602830+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/NB23DYU3ZTNPII337H3XU7ZXIP","json":"https://pith.science/pith/NB23DYU3ZTNPII337H3XU7ZXIP.json","graph_json":"https://pith.science/api/pith-number/NB23DYU3ZTNPII337H3XU7ZXIP/graph.json","events_json":"https://pith.science/api/pith-number/NB23DYU3ZTNPII337H3XU7ZXIP/events.json","paper":"https://pith.science/paper/NB23DYU3"},"agent_actions":{"view_html":"https://pith.science/pith/NB23DYU3ZTNPII337H3XU7ZXIP","download_json":"https://pith.science/pith/NB23DYU3ZTNPII337H3XU7ZXIP.json","view_paper":"https://pith.science/paper/NB23DYU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.15929&json=true","fetch_graph":"https://pith.science/api/pith-number/NB23DYU3ZTNPII337H3XU7ZXIP/graph.json","fetch_events":"https://pith.science/api/pith-number/NB23DYU3ZTNPII337H3XU7ZXIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NB23DYU3ZTNPII337H3XU7ZXIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NB23DYU3ZTNPII337H3XU7ZXIP/action/storage_attestation","attest_author":"https://pith.science/pith/NB23DYU3ZTNPII337H3XU7ZXIP/action/author_attestation","sign_citation":"https://pith.science/pith/NB23DYU3ZTNPII337H3XU7ZXIP/action/citation_signature","submit_replication":"https://pith.science/pith/NB23DYU3ZTNPII337H3XU7ZXIP/action/replication_record"}},"created_at":"2026-07-05T07:36:25.602830+00:00","updated_at":"2026-07-05T07:36:25.602830+00:00"}