{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MA2U2EEE5L75LNNEU43JOJEAR4","short_pith_number":"pith:MA2U2EEE","schema_version":"1.0","canonical_sha256":"60354d1084eaffd5b5a4a7369724808f2b4d13d4927a4414ad9c232313722425","source":{"kind":"arxiv","id":"1410.7026","version":1},"attestation_state":"computed","paper":{"title":"Optimal topology of multi-agent systems with two leaders: a zero-sum game perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.SY","authors_text":"Bin Wu, Jingying Ma, Long Wang, Yuanshi Zheng","submitted_at":"2014-10-26T13:29:18Z","abstract_excerpt":"It is typical to assume that there is no conflict of interest among leaders. Under such assumption, it is known that, for a multi-agent system with two leaders, if the followers' interaction subgraph is undirected and connected, then followers will converge to a convex combination of two leaders' states with linear consensus protocol. In this paper, we introduce the conflict between leaders: by choosing k followers to connect with, every leader attempts all followers converge to himself closer than that of the other. By using graph theory and matrix theory, we formulate this conflict as a stan"},"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":"1410.7026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-10-26T13:29:18Z","cross_cats_sorted":["cs.GT","cs.MA"],"title_canon_sha256":"5d551979c11a01125a972e12df4e0532503fa8ef30659e9b71c1c9e35b04b0b8","abstract_canon_sha256":"fb2005a031dbb1b1ac53d6b107cd56d5920aa83c8b679fcd224e486039448b2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:18.160117Z","signature_b64":"mNYNLu23slVcQ0I6VX5PVk83j6LCKt65T9anjrGiRlaMDjI208gnsJW3yNHx37w0vzg1+uU3K0PYkNXteA5VBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60354d1084eaffd5b5a4a7369724808f2b4d13d4927a4414ad9c232313722425","last_reissued_at":"2026-05-18T02:39:18.159732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:18.159732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal topology of multi-agent systems with two leaders: a zero-sum game perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.SY","authors_text":"Bin Wu, Jingying Ma, Long Wang, Yuanshi Zheng","submitted_at":"2014-10-26T13:29:18Z","abstract_excerpt":"It is typical to assume that there is no conflict of interest among leaders. Under such assumption, it is known that, for a multi-agent system with two leaders, if the followers' interaction subgraph is undirected and connected, then followers will converge to a convex combination of two leaders' states with linear consensus protocol. In this paper, we introduce the conflict between leaders: by choosing k followers to connect with, every leader attempts all followers converge to himself closer than that of the other. By using graph theory and matrix theory, we formulate this conflict as a stan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7026","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":"1410.7026","created_at":"2026-05-18T02:39:18.159786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7026v1","created_at":"2026-05-18T02:39:18.159786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7026","created_at":"2026-05-18T02:39:18.159786+00:00"},{"alias_kind":"pith_short_12","alias_value":"MA2U2EEE5L75","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MA2U2EEE5L75LNNE","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MA2U2EEE","created_at":"2026-05-18T12:28:38.356838+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/MA2U2EEE5L75LNNEU43JOJEAR4","json":"https://pith.science/pith/MA2U2EEE5L75LNNEU43JOJEAR4.json","graph_json":"https://pith.science/api/pith-number/MA2U2EEE5L75LNNEU43JOJEAR4/graph.json","events_json":"https://pith.science/api/pith-number/MA2U2EEE5L75LNNEU43JOJEAR4/events.json","paper":"https://pith.science/paper/MA2U2EEE"},"agent_actions":{"view_html":"https://pith.science/pith/MA2U2EEE5L75LNNEU43JOJEAR4","download_json":"https://pith.science/pith/MA2U2EEE5L75LNNEU43JOJEAR4.json","view_paper":"https://pith.science/paper/MA2U2EEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7026&json=true","fetch_graph":"https://pith.science/api/pith-number/MA2U2EEE5L75LNNEU43JOJEAR4/graph.json","fetch_events":"https://pith.science/api/pith-number/MA2U2EEE5L75LNNEU43JOJEAR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MA2U2EEE5L75LNNEU43JOJEAR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MA2U2EEE5L75LNNEU43JOJEAR4/action/storage_attestation","attest_author":"https://pith.science/pith/MA2U2EEE5L75LNNEU43JOJEAR4/action/author_attestation","sign_citation":"https://pith.science/pith/MA2U2EEE5L75LNNEU43JOJEAR4/action/citation_signature","submit_replication":"https://pith.science/pith/MA2U2EEE5L75LNNEU43JOJEAR4/action/replication_record"}},"created_at":"2026-05-18T02:39:18.159786+00:00","updated_at":"2026-05-18T02:39:18.159786+00:00"}