{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WRPTHZE72HWRW5V2BQ6S2KMND6","short_pith_number":"pith:WRPTHZE7","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"},"canonical_sha256":"b45f33e49fd1ed1b76ba0c3d2d298d1fb2b0eac3ee34302e9d01db9fb8127b73","source":{"kind":"arxiv","id":"1407.2399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2399","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2399v1","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2399","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"WRPTHZE72HWR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WRPTHZE72HWRW5V2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WRPTHZE7","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WRPTHZE72HWRW5V2BQ6S2KMND6","target":"record","payload":{"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"},"canonical_sha256":"b45f33e49fd1ed1b76ba0c3d2d298d1fb2b0eac3ee34302e9d01db9fb8127b73","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"},"source_kind":"arxiv","source_id":"1407.2399","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cV7E7wanMJoIVobc6wzCpcQoqKM7H5+/BA8bsRFdqBgLWvYOyfEsLM5uUnHvSD+tRbzGbWpdo+rQmYfi5U8XBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:19:52.103197Z"},"content_sha256":"5762f7c550a463e94fc2967bf7a07af4d5f393be2354913012604883f43b7398","schema_version":"1.0","event_id":"sha256:5762f7c550a463e94fc2967bf7a07af4d5f393be2354913012604883f43b7398"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WRPTHZE72HWRW5V2BQ6S2KMND6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQP9hndX2gHTOrSuTeYZwtfTw1Bt8ZyEAFWt3jMwt3zPjGwjermqX+CIJGymUd/ZTq+8E9PIDObMIKbPt+EyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:19:52.103841Z"},"content_sha256":"f369e260cdef9b45b0051c6007d46d339616c7d9d8dd3549368f6faccf588d12","schema_version":"1.0","event_id":"sha256:f369e260cdef9b45b0051c6007d46d339616c7d9d8dd3549368f6faccf588d12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/bundle.json","state_url":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T23:19:52Z","links":{"resolver":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6","bundle":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/bundle.json","state":"https://pith.science/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRPTHZE72HWRW5V2BQ6S2KMND6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WRPTHZE72HWRW5V2BQ6S2KMND6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b7670c066b558780128a5f7316300606388fe24cf6b7fcf062f5a3649418d7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-09T09:20:17Z","title_canon_sha256":"113621d4e60e2fc2a99995a102da98beeaee5106d057f496428a212e461d6fce"},"schema_version":"1.0","source":{"id":"1407.2399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2399","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2399v1","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2399","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"WRPTHZE72HWR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WRPTHZE72HWRW5V2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WRPTHZE7","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:f369e260cdef9b45b0051c6007d46d339616c7d9d8dd3549368f6faccf588d12","target":"graph","created_at":"2026-05-18T02:48:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Michael Margaliot, Michael S. Branicky, Orel Ron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-09T09:20:17Z","title":"Switching Between Linear Consensus~Protocols: A Variational Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2399","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5762f7c550a463e94fc2967bf7a07af4d5f393be2354913012604883f43b7398","target":"record","created_at":"2026-05-18T02:48:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3b7670c066b558780128a5f7316300606388fe24cf6b7fcf062f5a3649418d7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-09T09:20:17Z","title_canon_sha256":"113621d4e60e2fc2a99995a102da98beeaee5106d057f496428a212e461d6fce"},"schema_version":"1.0","source":{"id":"1407.2399","kind":"arxiv","version":1}},"canonical_sha256":"b45f33e49fd1ed1b76ba0c3d2d298d1fb2b0eac3ee34302e9d01db9fb8127b73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b45f33e49fd1ed1b76ba0c3d2d298d1fb2b0eac3ee34302e9d01db9fb8127b73","first_computed_at":"2026-05-18T02:48:01.661947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:01.661947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qJivOHJHK1iU9Qa+r3sQB0g11GGoumJBXsu+qAS3P7IdIR+0bS07bU6wTbyV4a6L6+i1mDBCnBqt0wpCfvmsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:01.662451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5762f7c550a463e94fc2967bf7a07af4d5f393be2354913012604883f43b7398","sha256:f369e260cdef9b45b0051c6007d46d339616c7d9d8dd3549368f6faccf588d12"],"state_sha256":"275aee93377331bd04e0db35e58846aa858e709b1a108cb91f60339dae420279"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvGnxEZ6BwG3vPB6ST3KtizRxYjP/eHmXorEgjhQscA7SzLSU7OIvJ5SigICmsrw8N8cLdFWjziqUyz92NsfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:19:52.107558Z","bundle_sha256":"ccd9c0d1e37127e7e418dbcc49ae8263caffab6f56b93daa146498822dea5a8e"}}