{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KO5QEZTOLBAD3C7OHOTBIWOKSF","short_pith_number":"pith:KO5QEZTO","schema_version":"1.0","canonical_sha256":"53bb02666e58403d8bee3ba61459ca9178ddc79d5b7f95bf4199b686bb88bccd","source":{"kind":"arxiv","id":"1208.0946","version":1},"attestation_state":"computed","paper":{"title":"A Supermodular Optimization Framework for Leader Selection under Link Noise in Linear Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Andrew Clark, Linda Bushnell, Radha Poovendran","submitted_at":"2012-08-04T16:51:52Z","abstract_excerpt":"In many applications of multi-agent systems (MAS), a set of leader agents acts as a control input to the remaining follower agents. In this paper, we introduce an analytical approach to selecting leader agents in order to minimize the total mean-square error of the follower agent states from their desired value in steady-state in the presence of noisy communication links. We show that the problem of choosing leaders in order to minimize this error can be solved using supermodular optimization techniques, leading to efficient algorithms that are within a provable bound of the optimum. We formul"},"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":"1208.0946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-08-04T16:51:52Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ff0bed494233c51556f6573e3da771ee1927749b475dc6533bb92e04cca58141","abstract_canon_sha256":"0694a880eb29d2fd7f5f10331e3ab1316c7967e8bb28b30259d8dd6c39ef23ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:21.019507Z","signature_b64":"C0H4kXGZ/51DSOAJAUYCraEPy1C5gqzJ5wTPNIbJzOzp+YYmnwRuDXLw6SrAcHcbbHDnWiCqGdp2j91fFAz9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53bb02666e58403d8bee3ba61459ca9178ddc79d5b7f95bf4199b686bb88bccd","last_reissued_at":"2026-05-18T03:49:21.018776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:21.018776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Supermodular Optimization Framework for Leader Selection under Link Noise in Linear Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Andrew Clark, Linda Bushnell, Radha Poovendran","submitted_at":"2012-08-04T16:51:52Z","abstract_excerpt":"In many applications of multi-agent systems (MAS), a set of leader agents acts as a control input to the remaining follower agents. In this paper, we introduce an analytical approach to selecting leader agents in order to minimize the total mean-square error of the follower agent states from their desired value in steady-state in the presence of noisy communication links. We show that the problem of choosing leaders in order to minimize this error can be solved using supermodular optimization techniques, leading to efficient algorithms that are within a provable bound of the optimum. We formul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0946","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":"1208.0946","created_at":"2026-05-18T03:49:21.018865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0946v1","created_at":"2026-05-18T03:49:21.018865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0946","created_at":"2026-05-18T03:49:21.018865+00:00"},{"alias_kind":"pith_short_12","alias_value":"KO5QEZTOLBAD","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KO5QEZTOLBAD3C7O","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KO5QEZTO","created_at":"2026-05-18T12:27:11.947152+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/KO5QEZTOLBAD3C7OHOTBIWOKSF","json":"https://pith.science/pith/KO5QEZTOLBAD3C7OHOTBIWOKSF.json","graph_json":"https://pith.science/api/pith-number/KO5QEZTOLBAD3C7OHOTBIWOKSF/graph.json","events_json":"https://pith.science/api/pith-number/KO5QEZTOLBAD3C7OHOTBIWOKSF/events.json","paper":"https://pith.science/paper/KO5QEZTO"},"agent_actions":{"view_html":"https://pith.science/pith/KO5QEZTOLBAD3C7OHOTBIWOKSF","download_json":"https://pith.science/pith/KO5QEZTOLBAD3C7OHOTBIWOKSF.json","view_paper":"https://pith.science/paper/KO5QEZTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0946&json=true","fetch_graph":"https://pith.science/api/pith-number/KO5QEZTOLBAD3C7OHOTBIWOKSF/graph.json","fetch_events":"https://pith.science/api/pith-number/KO5QEZTOLBAD3C7OHOTBIWOKSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KO5QEZTOLBAD3C7OHOTBIWOKSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KO5QEZTOLBAD3C7OHOTBIWOKSF/action/storage_attestation","attest_author":"https://pith.science/pith/KO5QEZTOLBAD3C7OHOTBIWOKSF/action/author_attestation","sign_citation":"https://pith.science/pith/KO5QEZTOLBAD3C7OHOTBIWOKSF/action/citation_signature","submit_replication":"https://pith.science/pith/KO5QEZTOLBAD3C7OHOTBIWOKSF/action/replication_record"}},"created_at":"2026-05-18T03:49:21.018865+00:00","updated_at":"2026-05-18T03:49:21.018865+00:00"}