{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:77R33NIIO2GWY7K4ZSARMXOVRN","short_pith_number":"pith:77R33NII","canonical_record":{"source":{"id":"1409.6505","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-23T12:22:46Z","cross_cats_sorted":["cs.MA","math.OC"],"title_canon_sha256":"61b476b22fb15c4e9882c804db9b1031e0fe5c3414e5e1fb53261b43dc944838","abstract_canon_sha256":"577c7f62e98d3fee89d5483b043a5cc261f73c403317f1459c08c238f06ce529"},"schema_version":"1.0"},"canonical_sha256":"ffe3bdb508768d6c7d5ccc81165dd58b48a6b8383e95425009c26fb19dbf883a","source":{"kind":"arxiv","id":"1409.6505","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6505","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6505v3","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6505","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"77R33NIIO2GW","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"77R33NIIO2GWY7K4","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"77R33NII","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:77R33NIIO2GWY7K4ZSARMXOVRN","target":"record","payload":{"canonical_record":{"source":{"id":"1409.6505","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-23T12:22:46Z","cross_cats_sorted":["cs.MA","math.OC"],"title_canon_sha256":"61b476b22fb15c4e9882c804db9b1031e0fe5c3414e5e1fb53261b43dc944838","abstract_canon_sha256":"577c7f62e98d3fee89d5483b043a5cc261f73c403317f1459c08c238f06ce529"},"schema_version":"1.0"},"canonical_sha256":"ffe3bdb508768d6c7d5ccc81165dd58b48a6b8383e95425009c26fb19dbf883a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:55.299742Z","signature_b64":"PWUX4zY8XfUw9rLw2N9EY0A3/8giFvO52gc+Xh63DnM/SR0gkn7xNoRUdDh9UFAW/31rKr2jvilGbUwIuBK+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffe3bdb508768d6c7d5ccc81165dd58b48a6b8383e95425009c26fb19dbf883a","last_reissued_at":"2026-05-18T02:03:55.298994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:55.298994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.6505","source_version":3,"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:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTIs1nlApJ77vLPZXQOdKgTG6T+VGpGy5rKixjL7ruqJW5zi14mqgojLz88LEjz/DXlzvV31CRRIEukIL75fAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:16:08.806655Z"},"content_sha256":"e1353c70f908d013b8cbd3d5072195fdef0ff7ac7be3a9f38c513060b5e95c1d","schema_version":"1.0","event_id":"sha256:e1353c70f908d013b8cbd3d5072195fdef0ff7ac7be3a9f38c513060b5e95c1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:77R33NIIO2GWY7K4ZSARMXOVRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for the Consensus Decision Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Julien M. Hendrickx, Pierre-Yves Chevalier, Rapha\\\"el M. Jungers","submitted_at":"2014-09-23T12:22:46Z","abstract_excerpt":"We address the problem of determining if a discrete time switched consensus system converges for any switching sequence and that of determining if it converges for at least one switching sequence. For these two problems, we provide necessary and sufficient conditions that can be checked in singly exponential time. As a side result, we prove the existence of a polynomial time algorithm for the first problem when the system switches between only two subsystems whose corresponding graphs are undirected, a problem that had been suggested to be NP-hard by Blondel and Olshevsky."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6505","kind":"arxiv","version":3},"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:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Q/l9DRhWfpLU26hfMYHlGrjoqTwbJ24wmLqk8C8FduBUFqhrF2tORtIi9sVxcRe48kz8yWqqgzH8NIMb6AtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:16:08.807069Z"},"content_sha256":"23f76f2bd517e5af9480ad31a4ad73f47d262b981bc9e4c590f54e723cb95ade","schema_version":"1.0","event_id":"sha256:23f76f2bd517e5af9480ad31a4ad73f47d262b981bc9e4c590f54e723cb95ade"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77R33NIIO2GWY7K4ZSARMXOVRN/bundle.json","state_url":"https://pith.science/pith/77R33NIIO2GWY7K4ZSARMXOVRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77R33NIIO2GWY7K4ZSARMXOVRN/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-11T13:16:08Z","links":{"resolver":"https://pith.science/pith/77R33NIIO2GWY7K4ZSARMXOVRN","bundle":"https://pith.science/pith/77R33NIIO2GWY7K4ZSARMXOVRN/bundle.json","state":"https://pith.science/pith/77R33NIIO2GWY7K4ZSARMXOVRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77R33NIIO2GWY7K4ZSARMXOVRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:77R33NIIO2GWY7K4ZSARMXOVRN","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":"577c7f62e98d3fee89d5483b043a5cc261f73c403317f1459c08c238f06ce529","cross_cats_sorted":["cs.MA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-23T12:22:46Z","title_canon_sha256":"61b476b22fb15c4e9882c804db9b1031e0fe5c3414e5e1fb53261b43dc944838"},"schema_version":"1.0","source":{"id":"1409.6505","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6505","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6505v3","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6505","created_at":"2026-05-18T02:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"77R33NIIO2GW","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"77R33NIIO2GWY7K4","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"77R33NII","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:23f76f2bd517e5af9480ad31a4ad73f47d262b981bc9e4c590f54e723cb95ade","target":"graph","created_at":"2026-05-18T02:03:55Z","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 address the problem of determining if a discrete time switched consensus system converges for any switching sequence and that of determining if it converges for at least one switching sequence. For these two problems, we provide necessary and sufficient conditions that can be checked in singly exponential time. As a side result, we prove the existence of a polynomial time algorithm for the first problem when the system switches between only two subsystems whose corresponding graphs are undirected, a problem that had been suggested to be NP-hard by Blondel and Olshevsky.","authors_text":"Julien M. Hendrickx, Pierre-Yves Chevalier, Rapha\\\"el M. Jungers","cross_cats":["cs.MA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-23T12:22:46Z","title":"Efficient Algorithms for the Consensus Decision Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6505","kind":"arxiv","version":3},"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:e1353c70f908d013b8cbd3d5072195fdef0ff7ac7be3a9f38c513060b5e95c1d","target":"record","created_at":"2026-05-18T02:03:55Z","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":"577c7f62e98d3fee89d5483b043a5cc261f73c403317f1459c08c238f06ce529","cross_cats_sorted":["cs.MA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-23T12:22:46Z","title_canon_sha256":"61b476b22fb15c4e9882c804db9b1031e0fe5c3414e5e1fb53261b43dc944838"},"schema_version":"1.0","source":{"id":"1409.6505","kind":"arxiv","version":3}},"canonical_sha256":"ffe3bdb508768d6c7d5ccc81165dd58b48a6b8383e95425009c26fb19dbf883a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffe3bdb508768d6c7d5ccc81165dd58b48a6b8383e95425009c26fb19dbf883a","first_computed_at":"2026-05-18T02:03:55.298994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:55.298994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PWUX4zY8XfUw9rLw2N9EY0A3/8giFvO52gc+Xh63DnM/SR0gkn7xNoRUdDh9UFAW/31rKr2jvilGbUwIuBK+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:55.299742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6505","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1353c70f908d013b8cbd3d5072195fdef0ff7ac7be3a9f38c513060b5e95c1d","sha256:23f76f2bd517e5af9480ad31a4ad73f47d262b981bc9e4c590f54e723cb95ade"],"state_sha256":"3196902ffc51f86f498eaa9c21b26897fcbad846c87a4e2839435c542e67dac7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4n1X4f96AImkD7tAIGxBH64MoNJXvB99kf68KPGaocK9FXlwGj+FCz7aSqSWbQyCdzlJPXHNmiu9M/2Abf3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:16:08.809301Z","bundle_sha256":"0301601ab2ca5c9caa7c18e21979f737cfa040f7a4e0c333cc0093169a847e13"}}