{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IFXNRMVSEGMH6SIWK72B5BINQH","short_pith_number":"pith:IFXNRMVS","canonical_record":{"source":{"id":"1610.06863","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T17:11:04Z","cross_cats_sorted":[],"title_canon_sha256":"2ccff01524743f3849ca3bb493277d2628b43feb3a5f6a12dbf1171b339dcabc","abstract_canon_sha256":"87f96c1c1f95549b4c414860c5e6fe9c392cbcca795e7774f6cf20a83bb8b656"},"schema_version":"1.0"},"canonical_sha256":"416ed8b2b221987f491657f41e850d81e50b0bf7a07599b50114e749a3b0a4df","source":{"kind":"arxiv","id":"1610.06863","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06863","created_at":"2026-05-18T00:48:16Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06863v3","created_at":"2026-05-18T00:48:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06863","created_at":"2026-05-18T00:48:16Z"},{"alias_kind":"pith_short_12","alias_value":"IFXNRMVSEGMH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IFXNRMVSEGMH6SIW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IFXNRMVS","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IFXNRMVSEGMH6SIWK72B5BINQH","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06863","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T17:11:04Z","cross_cats_sorted":[],"title_canon_sha256":"2ccff01524743f3849ca3bb493277d2628b43feb3a5f6a12dbf1171b339dcabc","abstract_canon_sha256":"87f96c1c1f95549b4c414860c5e6fe9c392cbcca795e7774f6cf20a83bb8b656"},"schema_version":"1.0"},"canonical_sha256":"416ed8b2b221987f491657f41e850d81e50b0bf7a07599b50114e749a3b0a4df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:16.683741Z","signature_b64":"MaaNthzm0z1km79D64JQuNHRMfh/MTWsA+bae513qStGFAANtyThFjGn3F2RWanSevnb656l3vvTJaIHrbABCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416ed8b2b221987f491657f41e850d81e50b0bf7a07599b50114e749a3b0a4df","last_reissued_at":"2026-05-18T00:48:16.682974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:16.682974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06863","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-18T00:48:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITTzhbUZUwwMyp6nX+Bmklvzb4RkYD9zzvwaSYcFJn63KTiflPrv2vXfC/PcyCuaiFuK1LIZ/UYqA+oBZxkIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:04:43.061289Z"},"content_sha256":"ce197c11f8619f12fa79b274547ebe6b9bd03f8ac6b97e446f3dedd2648792dd","schema_version":"1.0","event_id":"sha256:ce197c11f8619f12fa79b274547ebe6b9bd03f8ac6b97e446f3dedd2648792dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IFXNRMVSEGMH6SIWK72B5BINQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Rate Estimates for Consensus over Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Magnus Egerstedt, Matthew T. Hale","submitted_at":"2016-10-21T17:11:04Z","abstract_excerpt":"Multi-agent coordination algorithms with randomized interactions have seen use in a variety of settings in the multi-agent systems literature. In some cases, these algorithms can be random by design, as in a gossip-like algorithm, and in other cases they are random due to external factors, as in the case of intermittent communications. Targeting both of these scenarios, we present novel convergence rate estimates for consensus problems solved over random graphs. Established results provide asymptotic convergence in this setting, and we provide estimates of the rate of convergence in two forms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06863","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-18T00:48:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4NVLmv9kjWvUR5WKNu14hsJmv9WtqZvkWOJCoLtvi7FsL9fc/LRYuSsqyY07kf6IjICXA76wo4X10NmHHqWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:04:43.061947Z"},"content_sha256":"00dd99de26ffd0cba2b0930be900b180d425008fd7acfbd6946ae3c06704ff6c","schema_version":"1.0","event_id":"sha256:00dd99de26ffd0cba2b0930be900b180d425008fd7acfbd6946ae3c06704ff6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFXNRMVSEGMH6SIWK72B5BINQH/bundle.json","state_url":"https://pith.science/pith/IFXNRMVSEGMH6SIWK72B5BINQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFXNRMVSEGMH6SIWK72B5BINQH/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-05T23:04:43Z","links":{"resolver":"https://pith.science/pith/IFXNRMVSEGMH6SIWK72B5BINQH","bundle":"https://pith.science/pith/IFXNRMVSEGMH6SIWK72B5BINQH/bundle.json","state":"https://pith.science/pith/IFXNRMVSEGMH6SIWK72B5BINQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFXNRMVSEGMH6SIWK72B5BINQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IFXNRMVSEGMH6SIWK72B5BINQH","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":"87f96c1c1f95549b4c414860c5e6fe9c392cbcca795e7774f6cf20a83bb8b656","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T17:11:04Z","title_canon_sha256":"2ccff01524743f3849ca3bb493277d2628b43feb3a5f6a12dbf1171b339dcabc"},"schema_version":"1.0","source":{"id":"1610.06863","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06863","created_at":"2026-05-18T00:48:16Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06863v3","created_at":"2026-05-18T00:48:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06863","created_at":"2026-05-18T00:48:16Z"},{"alias_kind":"pith_short_12","alias_value":"IFXNRMVSEGMH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IFXNRMVSEGMH6SIW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IFXNRMVS","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:00dd99de26ffd0cba2b0930be900b180d425008fd7acfbd6946ae3c06704ff6c","target":"graph","created_at":"2026-05-18T00:48:16Z","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":"Multi-agent coordination algorithms with randomized interactions have seen use in a variety of settings in the multi-agent systems literature. In some cases, these algorithms can be random by design, as in a gossip-like algorithm, and in other cases they are random due to external factors, as in the case of intermittent communications. Targeting both of these scenarios, we present novel convergence rate estimates for consensus problems solved over random graphs. Established results provide asymptotic convergence in this setting, and we provide estimates of the rate of convergence in two forms.","authors_text":"Magnus Egerstedt, Matthew T. Hale","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T17:11:04Z","title":"Convergence Rate Estimates for Consensus over Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06863","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:ce197c11f8619f12fa79b274547ebe6b9bd03f8ac6b97e446f3dedd2648792dd","target":"record","created_at":"2026-05-18T00:48:16Z","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":"87f96c1c1f95549b4c414860c5e6fe9c392cbcca795e7774f6cf20a83bb8b656","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T17:11:04Z","title_canon_sha256":"2ccff01524743f3849ca3bb493277d2628b43feb3a5f6a12dbf1171b339dcabc"},"schema_version":"1.0","source":{"id":"1610.06863","kind":"arxiv","version":3}},"canonical_sha256":"416ed8b2b221987f491657f41e850d81e50b0bf7a07599b50114e749a3b0a4df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"416ed8b2b221987f491657f41e850d81e50b0bf7a07599b50114e749a3b0a4df","first_computed_at":"2026-05-18T00:48:16.682974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:16.682974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MaaNthzm0z1km79D64JQuNHRMfh/MTWsA+bae513qStGFAANtyThFjGn3F2RWanSevnb656l3vvTJaIHrbABCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:16.683741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06863","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce197c11f8619f12fa79b274547ebe6b9bd03f8ac6b97e446f3dedd2648792dd","sha256:00dd99de26ffd0cba2b0930be900b180d425008fd7acfbd6946ae3c06704ff6c"],"state_sha256":"d39526eddecf11bff7a6f9f8908fbe1b8e101aafcb668512ff488795a89401e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AnHAu5gYGQAXz5LXYCz/uvLb9NWKsmooLoNHuXGqBTOAVCXUusIatQMqBFfd6RdsX+d2pCYGF2/u4JTcm9b7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:04:43.065799Z","bundle_sha256":"3592e744a908c2e48aab11d593e2577a51ab53b1403810eb9c97360ca06ed395"}}