{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:I2HVSGFPVUA7VFTP3JLE3X7LUP","short_pith_number":"pith:I2HVSGFP","canonical_record":{"source":{"id":"0912.2425","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2009-12-12T14:47:16Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"48a9a9f11689968f26d1efed6d2537a92d41d115b5a5ab494f156883dfa4db45","abstract_canon_sha256":"0c6067197011aa9ffb29a7322c7e3e62399ffa55634d3badc144348d83dd9255"},"schema_version":"1.0"},"canonical_sha256":"468f5918afad01fa966fda564ddfeba3ca9c4240894056e3dda9eae766e9accb","source":{"kind":"arxiv","id":"0912.2425","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.2425","created_at":"2026-05-18T04:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"0912.2425v3","created_at":"2026-05-18T04:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.2425","created_at":"2026-05-18T04:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"I2HVSGFPVUA7","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"I2HVSGFPVUA7VFTP","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"I2HVSGFP","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:I2HVSGFPVUA7VFTP3JLE3X7LUP","target":"record","payload":{"canonical_record":{"source":{"id":"0912.2425","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2009-12-12T14:47:16Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"48a9a9f11689968f26d1efed6d2537a92d41d115b5a5ab494f156883dfa4db45","abstract_canon_sha256":"0c6067197011aa9ffb29a7322c7e3e62399ffa55634d3badc144348d83dd9255"},"schema_version":"1.0"},"canonical_sha256":"468f5918afad01fa966fda564ddfeba3ca9c4240894056e3dda9eae766e9accb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:39.462510Z","signature_b64":"Y+8qGtopaRt9GDEY+VAEU3FXtzQTKp8WHd0zAhSCc2hYhR9t6bHd2n+Y6N4oIApKVUo4sGIOCaPbtHORiGjICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"468f5918afad01fa966fda564ddfeba3ca9c4240894056e3dda9eae766e9accb","last_reissued_at":"2026-05-18T04:20:39.461849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:39.461849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.2425","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-18T04:20:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEAcav8tjXhkGkj/14Tf1Wyu4dD4Gus3Uv+2VIemTlIbBduqeDQ2qbD0AYF6Xe8L3EIsvbAMuoQVHW8l8zR5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:15:53.701707Z"},"content_sha256":"b5c42dd27c02085073e16721108dc6169dbe2d4ebae2633bac4a5050b8e7335a","schema_version":"1.0","event_id":"sha256:b5c42dd27c02085073e16721108dc6169dbe2d4ebae2633bac4a5050b8e7335a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:I2HVSGFPVUA7VFTP3JLE3X7LUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consensus and synchronization in discrete-time networks of multi-agents with stochastically switching topologies and time delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"math.DS","authors_text":"Fatihcan M. Atay, Jurgen Jost, Wenlian Lu","submitted_at":"2009-12-12T14:47:16Z","abstract_excerpt":"We analyze stability of consensus algorithms in networks of multi-agents with time-varying topologies and delays. The topology and delays are modeled as induced by an adapted process and are rather general, including i.i.d.\\ topology processes, asynchronous consensus algorithms, and Markovian jumping switching. In case the self-links are instantaneous, we prove that the network reaches consensus for all bounded delays if the graph corresponding to the conditional expectation of the coupling matrix sum across a finite time interval has a spanning tree almost surely. Moreover, when self-links ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.2425","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-18T04:20:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I2S108G7/a501211AsQrd77QP+ABZylwzx66wbkBxXbFRbe+wMYxZlaDCOEemxU2fyQidkcAnyNLtXlyDqdtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:15:53.702306Z"},"content_sha256":"b95c84b6a36cd78c6cde9a8b3569d7387da686472d54be7fc14161e2e1ecea18","schema_version":"1.0","event_id":"sha256:b95c84b6a36cd78c6cde9a8b3569d7387da686472d54be7fc14161e2e1ecea18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2HVSGFPVUA7VFTP3JLE3X7LUP/bundle.json","state_url":"https://pith.science/pith/I2HVSGFPVUA7VFTP3JLE3X7LUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2HVSGFPVUA7VFTP3JLE3X7LUP/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-05-30T14:15:53Z","links":{"resolver":"https://pith.science/pith/I2HVSGFPVUA7VFTP3JLE3X7LUP","bundle":"https://pith.science/pith/I2HVSGFPVUA7VFTP3JLE3X7LUP/bundle.json","state":"https://pith.science/pith/I2HVSGFPVUA7VFTP3JLE3X7LUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2HVSGFPVUA7VFTP3JLE3X7LUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:I2HVSGFPVUA7VFTP3JLE3X7LUP","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":"0c6067197011aa9ffb29a7322c7e3e62399ffa55634d3badc144348d83dd9255","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2009-12-12T14:47:16Z","title_canon_sha256":"48a9a9f11689968f26d1efed6d2537a92d41d115b5a5ab494f156883dfa4db45"},"schema_version":"1.0","source":{"id":"0912.2425","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.2425","created_at":"2026-05-18T04:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"0912.2425v3","created_at":"2026-05-18T04:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.2425","created_at":"2026-05-18T04:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"I2HVSGFPVUA7","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"I2HVSGFPVUA7VFTP","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"I2HVSGFP","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:b95c84b6a36cd78c6cde9a8b3569d7387da686472d54be7fc14161e2e1ecea18","target":"graph","created_at":"2026-05-18T04:20:39Z","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 analyze stability of consensus algorithms in networks of multi-agents with time-varying topologies and delays. The topology and delays are modeled as induced by an adapted process and are rather general, including i.i.d.\\ topology processes, asynchronous consensus algorithms, and Markovian jumping switching. In case the self-links are instantaneous, we prove that the network reaches consensus for all bounded delays if the graph corresponding to the conditional expectation of the coupling matrix sum across a finite time interval has a spanning tree almost surely. Moreover, when self-links ar","authors_text":"Fatihcan M. Atay, Jurgen Jost, Wenlian Lu","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2009-12-12T14:47:16Z","title":"Consensus and synchronization in discrete-time networks of multi-agents with stochastically switching topologies and time delays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.2425","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:b5c42dd27c02085073e16721108dc6169dbe2d4ebae2633bac4a5050b8e7335a","target":"record","created_at":"2026-05-18T04:20:39Z","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":"0c6067197011aa9ffb29a7322c7e3e62399ffa55634d3badc144348d83dd9255","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2009-12-12T14:47:16Z","title_canon_sha256":"48a9a9f11689968f26d1efed6d2537a92d41d115b5a5ab494f156883dfa4db45"},"schema_version":"1.0","source":{"id":"0912.2425","kind":"arxiv","version":3}},"canonical_sha256":"468f5918afad01fa966fda564ddfeba3ca9c4240894056e3dda9eae766e9accb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"468f5918afad01fa966fda564ddfeba3ca9c4240894056e3dda9eae766e9accb","first_computed_at":"2026-05-18T04:20:39.461849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:39.461849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y+8qGtopaRt9GDEY+VAEU3FXtzQTKp8WHd0zAhSCc2hYhR9t6bHd2n+Y6N4oIApKVUo4sGIOCaPbtHORiGjICA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:39.462510Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.2425","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5c42dd27c02085073e16721108dc6169dbe2d4ebae2633bac4a5050b8e7335a","sha256:b95c84b6a36cd78c6cde9a8b3569d7387da686472d54be7fc14161e2e1ecea18"],"state_sha256":"d01397b9100e06f8351c2c13a2029d62c103b2b6423ce5da67426f6fe6136a53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuOBrz25+mCI2A8y9kSQ1OozuET3ZtfyFPpmUP+R66A4f2P6hQA/Ydj0Pe+wLn/c7HNeVibue3Mpc5uHBjWsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:15:53.705821Z","bundle_sha256":"71cc3e2a4f43e49e1c7bef1d91762c9c2b5b2761f35a479b840ff58b01e87c26"}}