{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:X3HMRV7Z4CXA55DIUNZPR7P2N5","short_pith_number":"pith:X3HMRV7Z","canonical_record":{"source":{"id":"1207.5839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-24T22:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"2f07ef69fc6b91ff9f183cbbd93cdcc4e70e934236f84b0361a96606ccd815c8","abstract_canon_sha256":"7b70f33864461f3875053693b059e7f7fd6b6d22ed4f70351f3da032f395e1cd"},"schema_version":"1.0"},"canonical_sha256":"becec8d7f9e0ae0ef468a372f8fdfa6f57339697287939a18b0504f7493bafd4","source":{"kind":"arxiv","id":"1207.5839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5839","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5839v1","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5839","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"X3HMRV7Z4CXA","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X3HMRV7Z4CXA55DI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X3HMRV7Z","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:X3HMRV7Z4CXA55DIUNZPR7P2N5","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-24T22:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"2f07ef69fc6b91ff9f183cbbd93cdcc4e70e934236f84b0361a96606ccd815c8","abstract_canon_sha256":"7b70f33864461f3875053693b059e7f7fd6b6d22ed4f70351f3da032f395e1cd"},"schema_version":"1.0"},"canonical_sha256":"becec8d7f9e0ae0ef468a372f8fdfa6f57339697287939a18b0504f7493bafd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:10.183015Z","signature_b64":"FHdyxoCB8D7uJmfMBzA3utF0SoAicU+G1F6zbWviqoTE2rk357C0P8vwG/44xvyUMjZCYj1P37FZYGtj3GLBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"becec8d7f9e0ae0ef468a372f8fdfa6f57339697287939a18b0504f7493bafd4","last_reissued_at":"2026-05-18T03:50:10.182349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:10.182349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5839","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-18T03:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLjV0Rcb1Y/bSE+BaeujZyeR/7uYFcXbtLuLTY87DOcB2aRoyIWWX+6bXLoD+pMBHPF2fmOws8RCP/L4qlZuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:13:57.561566Z"},"content_sha256":"3d6b90d86bd2a2c177239b45bcfebd80529e4fe971e24dfadc160117eb9be9e4","schema_version":"1.0","event_id":"sha256:3d6b90d86bd2a2c177239b45bcfebd80529e4fe971e24dfadc160117eb9be9e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:X3HMRV7Z4CXA55DIUNZPR7P2N5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Impact of Communication Delays on Distributed Consensus Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat","submitted_at":"2012-07-24T22:15:10Z","abstract_excerpt":"We study the effect of communication delays on distributed consensus algorithms. Two ways to model delays on a network are presented. The first model assumes that each link delivers messages with a fixed (constant) amount of delay, and the second model is more realistic, allowing for i.i.d. time-varying bounded delays. In contrast to previous work studying the effects of delays on consensus algorithms, the models studied here allow for a node to receive multiple messages from the same neighbor in one iteration. The analysis of the fixed delay model shows that convergence to a consensus is guar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5839","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-18T03:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdHBFvKsQYRqhtjzojLs9f4KnSZjwwKXxC3XZEDl9Ym6tWKRS1JdYR/La1Ey7vSPHMqXRa67UN2r1TcylT1LDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:13:57.562274Z"},"content_sha256":"8eaeef0f704f8803116c1cd4fa33e8ddbc40638d0c0741ad6510bbfd0c3f8cbb","schema_version":"1.0","event_id":"sha256:8eaeef0f704f8803116c1cd4fa33e8ddbc40638d0c0741ad6510bbfd0c3f8cbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X3HMRV7Z4CXA55DIUNZPR7P2N5/bundle.json","state_url":"https://pith.science/pith/X3HMRV7Z4CXA55DIUNZPR7P2N5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X3HMRV7Z4CXA55DIUNZPR7P2N5/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-31T02:13:57Z","links":{"resolver":"https://pith.science/pith/X3HMRV7Z4CXA55DIUNZPR7P2N5","bundle":"https://pith.science/pith/X3HMRV7Z4CXA55DIUNZPR7P2N5/bundle.json","state":"https://pith.science/pith/X3HMRV7Z4CXA55DIUNZPR7P2N5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X3HMRV7Z4CXA55DIUNZPR7P2N5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:X3HMRV7Z4CXA55DIUNZPR7P2N5","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":"7b70f33864461f3875053693b059e7f7fd6b6d22ed4f70351f3da032f395e1cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-24T22:15:10Z","title_canon_sha256":"2f07ef69fc6b91ff9f183cbbd93cdcc4e70e934236f84b0361a96606ccd815c8"},"schema_version":"1.0","source":{"id":"1207.5839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5839","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5839v1","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5839","created_at":"2026-05-18T03:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"X3HMRV7Z4CXA","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X3HMRV7Z4CXA55DI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X3HMRV7Z","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:8eaeef0f704f8803116c1cd4fa33e8ddbc40638d0c0741ad6510bbfd0c3f8cbb","target":"graph","created_at":"2026-05-18T03:50:10Z","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 study the effect of communication delays on distributed consensus algorithms. Two ways to model delays on a network are presented. The first model assumes that each link delivers messages with a fixed (constant) amount of delay, and the second model is more realistic, allowing for i.i.d. time-varying bounded delays. In contrast to previous work studying the effects of delays on consensus algorithms, the models studied here allow for a node to receive multiple messages from the same neighbor in one iteration. The analysis of the fixed delay model shows that convergence to a consensus is guar","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-24T22:15:10Z","title":"The Impact of Communication Delays on Distributed Consensus Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5839","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:3d6b90d86bd2a2c177239b45bcfebd80529e4fe971e24dfadc160117eb9be9e4","target":"record","created_at":"2026-05-18T03:50:10Z","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":"7b70f33864461f3875053693b059e7f7fd6b6d22ed4f70351f3da032f395e1cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-24T22:15:10Z","title_canon_sha256":"2f07ef69fc6b91ff9f183cbbd93cdcc4e70e934236f84b0361a96606ccd815c8"},"schema_version":"1.0","source":{"id":"1207.5839","kind":"arxiv","version":1}},"canonical_sha256":"becec8d7f9e0ae0ef468a372f8fdfa6f57339697287939a18b0504f7493bafd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"becec8d7f9e0ae0ef468a372f8fdfa6f57339697287939a18b0504f7493bafd4","first_computed_at":"2026-05-18T03:50:10.182349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:10.182349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FHdyxoCB8D7uJmfMBzA3utF0SoAicU+G1F6zbWviqoTE2rk357C0P8vwG/44xvyUMjZCYj1P37FZYGtj3GLBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:10.183015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d6b90d86bd2a2c177239b45bcfebd80529e4fe971e24dfadc160117eb9be9e4","sha256:8eaeef0f704f8803116c1cd4fa33e8ddbc40638d0c0741ad6510bbfd0c3f8cbb"],"state_sha256":"e89aba2531ed9cf2f62c0544872170e173b278b6f4c01f7cefcdaafb49e922ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0A+k+qzdYoLtj+furb+xLw2NNDd8Z/brziTgGbeay/idyWRj7aIedVW1vBgRu8/1jtd2TlJyDr+t+psoLScfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:13:57.566261Z","bundle_sha256":"bd43a718c0f411e62eb08af379b71b2dc137917549f2b2d74d09d7d25e7e614d"}}