{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GIO6BKJJGYAZ4L5SEVWAB4ONF4","short_pith_number":"pith:GIO6BKJJ","canonical_record":{"source":{"id":"1408.0620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T09:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"e0ac0942e56862be1b5c738e1c434573743fd3776675e0309b8581b9b78c98bf","abstract_canon_sha256":"53d429ec7f2dffc026fb1920a0bf80df6ec68705e7d1613cd44720fae9323e25"},"schema_version":"1.0"},"canonical_sha256":"321de0a92936019e2fb2256c00f1cd2f2282d1a017cd727a631bbabddfb95c4f","source":{"kind":"arxiv","id":"1408.0620","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0620","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0620v2","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0620","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"GIO6BKJJGYAZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIO6BKJJGYAZ4L5S","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIO6BKJJ","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GIO6BKJJGYAZ4L5SEVWAB4ONF4","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T09:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"e0ac0942e56862be1b5c738e1c434573743fd3776675e0309b8581b9b78c98bf","abstract_canon_sha256":"53d429ec7f2dffc026fb1920a0bf80df6ec68705e7d1613cd44720fae9323e25"},"schema_version":"1.0"},"canonical_sha256":"321de0a92936019e2fb2256c00f1cd2f2282d1a017cd727a631bbabddfb95c4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:51.563293Z","signature_b64":"MpDVjacGH1lQIAFmdcChNRKE1WSLFGnMIWFf8lEcGHvaFZnPCXM9MSO3NKZo1dedFzbcWiX9CXrmK3zt/BNbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"321de0a92936019e2fb2256c00f1cd2f2282d1a017cd727a631bbabddfb95c4f","last_reissued_at":"2026-05-18T02:37:51.562647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:51.562647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0620","source_version":2,"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:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAaCXJ9EtrxE4OTK3bMiEkXg2HxOMG/x86Xo8Ay+4cb2QSgx2U1u+BFvWOYBy47NIH6z1WXztwWFbjMxe5voCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:38.500780Z"},"content_sha256":"391228a14862a01b264f05ec27c14c511adf427c8c1362eedf7521ff434b1f09","schema_version":"1.0","event_id":"sha256:391228a14862a01b264f05ec27c14c511adf427c8c1362eedf7521ff434b1f09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GIO6BKJJGYAZ4L5SEVWAB4ONF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bernadette Charron-Bost, Matthias F\\\"ugger, Thomas Nowak","submitted_at":"2014-08-04T09:27:17Z","abstract_excerpt":"In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate consensus is solvable if and only if the communication graph in each round has a rooted spanning tree, i.e., there is a coordinator at each time. The striking point in this result is that the coordinator is not required to be unique and can change arbitrarily from round to round. Interestingly, the class of averaging algorithms, which are memoryless and require no p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0620","kind":"arxiv","version":2},"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:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8b+Z0WplOtuXNS4SMJ4XZcXr6sf/08o1XpOZ0kK0C+71HEH50VxB7/3FPzJ0uIJ4da2drWKfRyiC1zTBOcGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:38.501343Z"},"content_sha256":"29d4bf8c62fe1e2191576464ef54cc3e4d1bbfff2d71015838243372296da85d","schema_version":"1.0","event_id":"sha256:29d4bf8c62fe1e2191576464ef54cc3e4d1bbfff2d71015838243372296da85d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIO6BKJJGYAZ4L5SEVWAB4ONF4/bundle.json","state_url":"https://pith.science/pith/GIO6BKJJGYAZ4L5SEVWAB4ONF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIO6BKJJGYAZ4L5SEVWAB4ONF4/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-30T20:03:38Z","links":{"resolver":"https://pith.science/pith/GIO6BKJJGYAZ4L5SEVWAB4ONF4","bundle":"https://pith.science/pith/GIO6BKJJGYAZ4L5SEVWAB4ONF4/bundle.json","state":"https://pith.science/pith/GIO6BKJJGYAZ4L5SEVWAB4ONF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIO6BKJJGYAZ4L5SEVWAB4ONF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GIO6BKJJGYAZ4L5SEVWAB4ONF4","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":"53d429ec7f2dffc026fb1920a0bf80df6ec68705e7d1613cd44720fae9323e25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T09:27:17Z","title_canon_sha256":"e0ac0942e56862be1b5c738e1c434573743fd3776675e0309b8581b9b78c98bf"},"schema_version":"1.0","source":{"id":"1408.0620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0620","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0620v2","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0620","created_at":"2026-05-18T02:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"GIO6BKJJGYAZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIO6BKJJGYAZ4L5S","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIO6BKJJ","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:29d4bf8c62fe1e2191576464ef54cc3e4d1bbfff2d71015838243372296da85d","target":"graph","created_at":"2026-05-18T02:37:51Z","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":"In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate consensus is solvable if and only if the communication graph in each round has a rooted spanning tree, i.e., there is a coordinator at each time. The striking point in this result is that the coordinator is not required to be unique and can change arbitrarily from round to round. Interestingly, the class of averaging algorithms, which are memoryless and require no p","authors_text":"Bernadette Charron-Bost, Matthias F\\\"ugger, Thomas Nowak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T09:27:17Z","title":"Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0620","kind":"arxiv","version":2},"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:391228a14862a01b264f05ec27c14c511adf427c8c1362eedf7521ff434b1f09","target":"record","created_at":"2026-05-18T02:37:51Z","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":"53d429ec7f2dffc026fb1920a0bf80df6ec68705e7d1613cd44720fae9323e25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T09:27:17Z","title_canon_sha256":"e0ac0942e56862be1b5c738e1c434573743fd3776675e0309b8581b9b78c98bf"},"schema_version":"1.0","source":{"id":"1408.0620","kind":"arxiv","version":2}},"canonical_sha256":"321de0a92936019e2fb2256c00f1cd2f2282d1a017cd727a631bbabddfb95c4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"321de0a92936019e2fb2256c00f1cd2f2282d1a017cd727a631bbabddfb95c4f","first_computed_at":"2026-05-18T02:37:51.562647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:51.562647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MpDVjacGH1lQIAFmdcChNRKE1WSLFGnMIWFf8lEcGHvaFZnPCXM9MSO3NKZo1dedFzbcWiX9CXrmK3zt/BNbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:51.563293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:391228a14862a01b264f05ec27c14c511adf427c8c1362eedf7521ff434b1f09","sha256:29d4bf8c62fe1e2191576464ef54cc3e4d1bbfff2d71015838243372296da85d"],"state_sha256":"a459d349e591829adceb005b03d8a9fd09052151c1dec887d8658ee6804b68f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyjJQPTFdw97iFdC5Jg7pUfm+2csuYKSbXSS32ubicDS3xazPCj9l7UqWHjPTrNM6fJYQfZb54av/V/WNpeCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:03:38.504432Z","bundle_sha256":"af1d02dedd65ee72e5e6f572e47aed9a8ebf46313963ecde86839603a3b7b3ac"}}