{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QPIACF6E247RPLT6CTTUBRTQSE","short_pith_number":"pith:QPIACF6E","schema_version":"1.0","canonical_sha256":"83d00117c4d73f17ae7e14e740c67091270fe6aa8580000ef2123789a395ca7f","source":{"kind":"arxiv","id":"1604.07094","version":1},"attestation_state":"computed","paper":{"title":"Optimal k-Leader Selection for Coherence and Convergence Rate in One-Dimensional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Kirill Dyagilev, Neil McGlohon, Stacy Patterson","submitted_at":"2016-04-24T23:50:46Z","abstract_excerpt":"We study the problem of optimal leader selection in consensus networks under two performance measures (1) formation coherence when subject to additive perturbations, as quantified by the steady-state variance of the deviation from the desired trajectory, and (2) convergence rate to a consensus value. The objective is to identify the set of $k$ leaders that optimizes the chosen performance measure. In both cases, an optimal leader set can be found by an exhaustive search over all possible leader sets; however, this approach is not scalable to large networks. In recent years, several works have "},"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":"1604.07094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-24T23:50:46Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b9c0db66a1fcc741247a2df7c4b186439a6ff5a9ad07eb2a72db1e36ff6b3f3c","abstract_canon_sha256":"defdff7096f748c0060c86fb8d59755166cbd6504a8b9c8c9e821b834ef45c92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.093480Z","signature_b64":"M8AhnUjEGhTHD7OC48AeGxmScfxJl/MQ+4yuUFnHYN/X19m+uZVTVTkWk6Tg+fhbd1vYMiBGlGe3Blwm2mVAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83d00117c4d73f17ae7e14e740c67091270fe6aa8580000ef2123789a395ca7f","last_reissued_at":"2026-05-18T01:16:23.092992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.092992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal k-Leader Selection for Coherence and Convergence Rate in One-Dimensional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Kirill Dyagilev, Neil McGlohon, Stacy Patterson","submitted_at":"2016-04-24T23:50:46Z","abstract_excerpt":"We study the problem of optimal leader selection in consensus networks under two performance measures (1) formation coherence when subject to additive perturbations, as quantified by the steady-state variance of the deviation from the desired trajectory, and (2) convergence rate to a consensus value. The objective is to identify the set of $k$ leaders that optimizes the chosen performance measure. In both cases, an optimal leader set can be found by an exhaustive search over all possible leader sets; however, this approach is not scalable to large networks. In recent years, several works have "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07094","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":"1604.07094","created_at":"2026-05-18T01:16:23.093061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07094v1","created_at":"2026-05-18T01:16:23.093061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07094","created_at":"2026-05-18T01:16:23.093061+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPIACF6E247R","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPIACF6E247RPLT6","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPIACF6E","created_at":"2026-05-18T12:30:41.710351+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/QPIACF6E247RPLT6CTTUBRTQSE","json":"https://pith.science/pith/QPIACF6E247RPLT6CTTUBRTQSE.json","graph_json":"https://pith.science/api/pith-number/QPIACF6E247RPLT6CTTUBRTQSE/graph.json","events_json":"https://pith.science/api/pith-number/QPIACF6E247RPLT6CTTUBRTQSE/events.json","paper":"https://pith.science/paper/QPIACF6E"},"agent_actions":{"view_html":"https://pith.science/pith/QPIACF6E247RPLT6CTTUBRTQSE","download_json":"https://pith.science/pith/QPIACF6E247RPLT6CTTUBRTQSE.json","view_paper":"https://pith.science/paper/QPIACF6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07094&json=true","fetch_graph":"https://pith.science/api/pith-number/QPIACF6E247RPLT6CTTUBRTQSE/graph.json","fetch_events":"https://pith.science/api/pith-number/QPIACF6E247RPLT6CTTUBRTQSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPIACF6E247RPLT6CTTUBRTQSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPIACF6E247RPLT6CTTUBRTQSE/action/storage_attestation","attest_author":"https://pith.science/pith/QPIACF6E247RPLT6CTTUBRTQSE/action/author_attestation","sign_citation":"https://pith.science/pith/QPIACF6E247RPLT6CTTUBRTQSE/action/citation_signature","submit_replication":"https://pith.science/pith/QPIACF6E247RPLT6CTTUBRTQSE/action/replication_record"}},"created_at":"2026-05-18T01:16:23.093061+00:00","updated_at":"2026-05-18T01:16:23.093061+00:00"}