{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6R4Q734JNKUJHZEFSZ252KBF37","short_pith_number":"pith:6R4Q734J","canonical_record":{"source":{"id":"1104.0454","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T02:26:41Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c2004435f93fdf1c84f8cfc334ab1565f9be4e74123d2d0c6d8ad2b8cee11a73","abstract_canon_sha256":"32699473a8289475406644f255a138964196fa367b546b3de27abd3a666ad369"},"schema_version":"1.0"},"canonical_sha256":"f4790fef896aa893e4859675dd2825dfcfb356910a97c2379c45e3b06e651605","source":{"kind":"arxiv","id":"1104.0454","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0454","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0454v3","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0454","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"6R4Q734JNKUJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6R4Q734JNKUJHZEF","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6R4Q734J","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6R4Q734JNKUJHZEFSZ252KBF37","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0454","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T02:26:41Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c2004435f93fdf1c84f8cfc334ab1565f9be4e74123d2d0c6d8ad2b8cee11a73","abstract_canon_sha256":"32699473a8289475406644f255a138964196fa367b546b3de27abd3a666ad369"},"schema_version":"1.0"},"canonical_sha256":"f4790fef896aa893e4859675dd2825dfcfb356910a97c2379c45e3b06e651605","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:20.426975Z","signature_b64":"WbQmtxHskqxqZYZQHFIzA+8ppBix52KHQ0fiI5/f22+JOK3Gs3jXSbZxUf545vZr7wR9t+p+6NEidVnAju6fAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4790fef896aa893e4859675dd2825dfcfb356910a97c2379c45e3b06e651605","last_reissued_at":"2026-05-18T03:41:20.426491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:20.426491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0454","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-18T03:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nqs+QS/HsYiOCKS3lg3dcCDGw0EgpcRGDEl7YOsYWSI84no8ygtC80HyN93AzTrjY2dRxoCw+bjR8+p3JkKXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:14:06.119819Z"},"content_sha256":"dd9a9256530947d81beb42522d478532390aba59d014dc1ccf5026676eb68b46","schema_version":"1.0","event_id":"sha256:dd9a9256530947d81beb42522d478532390aba59d014dc1ccf5026676eb68b46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6R4Q734JNKUJHZEFSZ252KBF37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree Fluctuations and the Convergence Time of Consensus Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, John Tsitsiklis","submitted_at":"2011-04-04T02:26:41Z","abstract_excerpt":"We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node has no connections to other nodes), we show that consensus is achieved within a given accuracy $\\epsilon$ on n nodes in time $B+4n^3 B \\ln(2n/\\epsilon)$. Because there is a direct relation between consensus algorithms in time-varying environments and inhomogeneous random walks, our result also translates into a general statement on such random walks. Moreove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0454","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-18T03:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2+qpYeHiQJ8s46EFyJCEi5hqy4hxXFIy/GCEFSQBxda4Y2J6QS0Pxd5Tn7AyeNGyX8u7P9NL5JJtUF7JruABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:14:06.120542Z"},"content_sha256":"5b568ec132547c09c2e54a419211bc8c6593c2891351c48bd747b7d53a23df5e","schema_version":"1.0","event_id":"sha256:5b568ec132547c09c2e54a419211bc8c6593c2891351c48bd747b7d53a23df5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6R4Q734JNKUJHZEFSZ252KBF37/bundle.json","state_url":"https://pith.science/pith/6R4Q734JNKUJHZEFSZ252KBF37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6R4Q734JNKUJHZEFSZ252KBF37/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-31T07:14:06Z","links":{"resolver":"https://pith.science/pith/6R4Q734JNKUJHZEFSZ252KBF37","bundle":"https://pith.science/pith/6R4Q734JNKUJHZEFSZ252KBF37/bundle.json","state":"https://pith.science/pith/6R4Q734JNKUJHZEFSZ252KBF37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6R4Q734JNKUJHZEFSZ252KBF37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6R4Q734JNKUJHZEFSZ252KBF37","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":"32699473a8289475406644f255a138964196fa367b546b3de27abd3a666ad369","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T02:26:41Z","title_canon_sha256":"c2004435f93fdf1c84f8cfc334ab1565f9be4e74123d2d0c6d8ad2b8cee11a73"},"schema_version":"1.0","source":{"id":"1104.0454","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0454","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0454v3","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0454","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"6R4Q734JNKUJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6R4Q734JNKUJHZEF","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6R4Q734J","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:5b568ec132547c09c2e54a419211bc8c6593c2891351c48bd747b7d53a23df5e","target":"graph","created_at":"2026-05-18T03:41:20Z","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 consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node has no connections to other nodes), we show that consensus is achieved within a given accuracy $\\epsilon$ on n nodes in time $B+4n^3 B \\ln(2n/\\epsilon)$. Because there is a direct relation between consensus algorithms in time-varying environments and inhomogeneous random walks, our result also translates into a general statement on such random walks. Moreove","authors_text":"Alex Olshevsky, John Tsitsiklis","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T02:26:41Z","title":"Degree Fluctuations and the Convergence Time of Consensus Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0454","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:dd9a9256530947d81beb42522d478532390aba59d014dc1ccf5026676eb68b46","target":"record","created_at":"2026-05-18T03:41:20Z","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":"32699473a8289475406644f255a138964196fa367b546b3de27abd3a666ad369","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T02:26:41Z","title_canon_sha256":"c2004435f93fdf1c84f8cfc334ab1565f9be4e74123d2d0c6d8ad2b8cee11a73"},"schema_version":"1.0","source":{"id":"1104.0454","kind":"arxiv","version":3}},"canonical_sha256":"f4790fef896aa893e4859675dd2825dfcfb356910a97c2379c45e3b06e651605","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4790fef896aa893e4859675dd2825dfcfb356910a97c2379c45e3b06e651605","first_computed_at":"2026-05-18T03:41:20.426491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:20.426491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WbQmtxHskqxqZYZQHFIzA+8ppBix52KHQ0fiI5/f22+JOK3Gs3jXSbZxUf545vZr7wR9t+p+6NEidVnAju6fAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:20.426975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0454","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd9a9256530947d81beb42522d478532390aba59d014dc1ccf5026676eb68b46","sha256:5b568ec132547c09c2e54a419211bc8c6593c2891351c48bd747b7d53a23df5e"],"state_sha256":"b5b4e6553e129c47dbe0dd9ac2c9cb57de38b3f94a1a9b044e75ae142841bce7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0gKWLmfv7z7IlNcISaCNwy2KUUZI2FhG4yiO0q3qtbc4fdDrYZTsJzNqIK87Z+LJUOX3fwAgbixeuU2OgJhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:14:06.124487Z","bundle_sha256":"1cde8198dccc9a98dbe3ddd7d8dd64da6ae09362a25ac0af1df97fa5a41566dc"}}