{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WRPTHZE72HWRW5V2BQ6S2KMND6","short_pith_number":"pith:WRPTHZE7","schema_version":"1.0","canonical_sha256":"b45f33e49fd1ed1b76ba0c3d2d298d1fb2b0eac3ee34302e9d01db9fb8127b73","source":{"kind":"arxiv","id":"1407.2399","version":1},"attestation_state":"computed","paper":{"title":"Switching Between Linear Consensus~Protocols: A Variational Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael Margaliot, Michael S. Branicky, Orel Ron","submitted_at":"2014-07-09T09:20:17Z","abstract_excerpt":"We consider a linear consensus system with n agents that can switch between r different connectivity patterns. A natural question is which switching law yields the best (or worst) possible speed of convergence to consensus? We formulate this question in a rigorous manner by relaxing the switched system into a bilinear consensus control system, with the control playing the role of the switching law. A best (or worst) possible switching law then corresponds to an optimal control. We derive a necessary condition for optimality, stated in the form of a maximum principle (MP). Our approach, combine"},"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":"1407.2399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-09T09:20:17Z","cross_cats_sorted":[],"title_canon_sha256":"113621d4e60e2fc2a99995a102da98beeaee5106d057f496428a212e461d6fce","abstract_canon_sha256":"3b7670c066b558780128a5f7316300606388fe24cf6b7fcf062f5a3649418d7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:01.662451Z","signature_b64":"qJivOHJHK1iU9Qa+r3sQB0g11GGoumJBXsu+qAS3P7IdIR+0bS07bU6wTbyV4a6L6+i1mDBCnBqt0wpCfvmsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b45f33e49fd1ed1b76ba0c3d2d298d1fb2b0eac3ee34302e9d01db9fb8127b73","last_reissued_at":"2026-05-18T02:48:01.661947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:01.661947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Switching Between Linear Consensus~Protocols: A Variational Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael Margaliot, Michael S. Branicky, Orel Ron","submitted_at":"2014-07-09T09:20:17Z","abstract_excerpt":"We consider a linear consensus system with n agents that can switch between r different connectivity patterns. A natural question is which switching law yields the best (or worst) possible speed of convergence to consensus? We formulate this question in a rigorous manner by relaxing the switched system into a bilinear consensus control system, with the control playing the role of the switching law. A best (or worst) possible switching law then corresponds to an optimal control. We derive a necessary condition for optimality, stated in the form of a maximum principle (MP). Our approach, combine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2399","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":"1407.2399","created_at":"2026-05-18T02:48:01.662013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2399v1","created_at":"2026-05-18T02:48:01.662013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2399","created_at":"2026-05-18T02:48:01.662013+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRPTHZE72HWR","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRPTHZE72HWRW5V2","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRPTHZE7","created_at":"2026-05-18T12:28:54.890064+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/WRPTHZE72HWRW5V2BQ6S2KMND6","json":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6.json","graph_json":"https://pith.science/api/pith-number/WRPTHZE72HWRW5V2BQ6S2KMND6/graph.json","events_json":"https://pith.science/api/pith-number/WRPTHZE72HWRW5V2BQ6S2KMND6/events.json","paper":"https://pith.science/paper/WRPTHZE7"},"agent_actions":{"view_html":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6","download_json":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6.json","view_paper":"https://pith.science/paper/WRPTHZE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2399&json=true","fetch_graph":"https://pith.science/api/pith-number/WRPTHZE72HWRW5V2BQ6S2KMND6/graph.json","fetch_events":"https://pith.science/api/pith-number/WRPTHZE72HWRW5V2BQ6S2KMND6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/action/storage_attestation","attest_author":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/action/author_attestation","sign_citation":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/action/citation_signature","submit_replication":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/action/replication_record"}},"created_at":"2026-05-18T02:48:01.662013+00:00","updated_at":"2026-05-18T02:48:01.662013+00:00"}