{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QEQMN63FIGEEYUUGDIQ2LSZTHE","short_pith_number":"pith:QEQMN63F","canonical_record":{"source":{"id":"1205.1733","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-08T15:59:06Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"38ed39bf092c1f5af58fdd72ce6633053de87359629e3768fac68457d03fa652","abstract_canon_sha256":"3a100390fe1d7f96258128b14afb6a1980fa928e41ab1739d5a8e65d8880a53f"},"schema_version":"1.0"},"canonical_sha256":"8120c6fb6541884c52861a21a5cb333932d2067a45fc0e4cf0989c92bfa1da3a","source":{"kind":"arxiv","id":"1205.1733","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1733","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1733v2","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1733","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"QEQMN63FIGEE","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QEQMN63FIGEEYUUG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QEQMN63F","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QEQMN63FIGEEYUUGDIQ2LSZTHE","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1733","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-08T15:59:06Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"38ed39bf092c1f5af58fdd72ce6633053de87359629e3768fac68457d03fa652","abstract_canon_sha256":"3a100390fe1d7f96258128b14afb6a1980fa928e41ab1739d5a8e65d8880a53f"},"schema_version":"1.0"},"canonical_sha256":"8120c6fb6541884c52861a21a5cb333932d2067a45fc0e4cf0989c92bfa1da3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:16.611035Z","signature_b64":"MbwV50A0aEsS1d/ADyy3puNepYCSfmM1VBW6Rl2Ea5CvskasjufYrIodkAmbF1OwBo3XqxecsGXx0Ops0mViBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8120c6fb6541884c52861a21a5cb333932d2067a45fc0e4cf0989c92bfa1da3a","last_reissued_at":"2026-05-18T03:46:16.610097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:16.610097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1733","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-18T03:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvwK512UxuOgmG6ObJiAfXFbbQnRse+a4dK0eff2q8LrS5EPMxLTukkKRUVsHuJtdORMCsGSRwny9oTUGGOuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:00:41.388506Z"},"content_sha256":"accc9f2311870071a155d6e84d2498d64d0c175f7c81b0a774ceca1bea96030e","schema_version":"1.0","event_id":"sha256:accc9f2311870071a155d6e84d2498d64d0c175f7c81b0a774ceca1bea96030e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QEQMN63FIGEEYUUGDIQ2LSZTHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite-time and Asymptotic Convergence of Distributed Averaging and Maximizing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Guodong Shi, Karl Henrik Johansson","submitted_at":"2012-05-08T15:59:06Z","abstract_excerpt":"In this paper, we formulate and investigate a generalized consensus algorithm which makes an attempt to unify distributed averaging and maximizing algorithms considered in the literature. Each node iteratively updates its state as a time-varying weighted average of its own state, the minimal state, and the maximal state of its neighbors. We prove that finite-time consensus is almost impossible for averaging under this uniform model. Both time-dependent and state-dependent graphs are considered, and various necessary and/or sufficient conditions are presented on the consensus convergence. For t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1733","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-18T03:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTx0aim8NVNvCj3bsUsIW5hOmnd7FyNcmyfZ79kfcTY8VlaQbw8ldOyQMixzI3Bmr628HOyQChNjGn4XYBcmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:00:41.389064Z"},"content_sha256":"6402369d3369c8b30466a6c1621ffc473240df87e71cfc4f67b79ce30ed18a07","schema_version":"1.0","event_id":"sha256:6402369d3369c8b30466a6c1621ffc473240df87e71cfc4f67b79ce30ed18a07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEQMN63FIGEEYUUGDIQ2LSZTHE/bundle.json","state_url":"https://pith.science/pith/QEQMN63FIGEEYUUGDIQ2LSZTHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEQMN63FIGEEYUUGDIQ2LSZTHE/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-30T20:00:41Z","links":{"resolver":"https://pith.science/pith/QEQMN63FIGEEYUUGDIQ2LSZTHE","bundle":"https://pith.science/pith/QEQMN63FIGEEYUUGDIQ2LSZTHE/bundle.json","state":"https://pith.science/pith/QEQMN63FIGEEYUUGDIQ2LSZTHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEQMN63FIGEEYUUGDIQ2LSZTHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QEQMN63FIGEEYUUGDIQ2LSZTHE","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":"3a100390fe1d7f96258128b14afb6a1980fa928e41ab1739d5a8e65d8880a53f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-08T15:59:06Z","title_canon_sha256":"38ed39bf092c1f5af58fdd72ce6633053de87359629e3768fac68457d03fa652"},"schema_version":"1.0","source":{"id":"1205.1733","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1733","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1733v2","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1733","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"QEQMN63FIGEE","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QEQMN63FIGEEYUUG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QEQMN63F","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:6402369d3369c8b30466a6c1621ffc473240df87e71cfc4f67b79ce30ed18a07","target":"graph","created_at":"2026-05-18T03:46: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":"In this paper, we formulate and investigate a generalized consensus algorithm which makes an attempt to unify distributed averaging and maximizing algorithms considered in the literature. Each node iteratively updates its state as a time-varying weighted average of its own state, the minimal state, and the maximal state of its neighbors. We prove that finite-time consensus is almost impossible for averaging under this uniform model. Both time-dependent and state-dependent graphs are considered, and various necessary and/or sufficient conditions are presented on the consensus convergence. For t","authors_text":"Guodong Shi, Karl Henrik Johansson","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-08T15:59:06Z","title":"Finite-time and Asymptotic Convergence of Distributed Averaging and Maximizing Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1733","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:accc9f2311870071a155d6e84d2498d64d0c175f7c81b0a774ceca1bea96030e","target":"record","created_at":"2026-05-18T03:46: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":"3a100390fe1d7f96258128b14afb6a1980fa928e41ab1739d5a8e65d8880a53f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-08T15:59:06Z","title_canon_sha256":"38ed39bf092c1f5af58fdd72ce6633053de87359629e3768fac68457d03fa652"},"schema_version":"1.0","source":{"id":"1205.1733","kind":"arxiv","version":2}},"canonical_sha256":"8120c6fb6541884c52861a21a5cb333932d2067a45fc0e4cf0989c92bfa1da3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8120c6fb6541884c52861a21a5cb333932d2067a45fc0e4cf0989c92bfa1da3a","first_computed_at":"2026-05-18T03:46:16.610097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:16.610097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MbwV50A0aEsS1d/ADyy3puNepYCSfmM1VBW6Rl2Ea5CvskasjufYrIodkAmbF1OwBo3XqxecsGXx0Ops0mViBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:16.611035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1733","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:accc9f2311870071a155d6e84d2498d64d0c175f7c81b0a774ceca1bea96030e","sha256:6402369d3369c8b30466a6c1621ffc473240df87e71cfc4f67b79ce30ed18a07"],"state_sha256":"2526634d29613966959505795342d6017524916b2e036f33855e44d1962a8eb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRG9KdoV38xuBaE2oaaj0D4bSkBACYY9PFvHSIWG9t4O4OvXEHio4gNu1AAWI3cj6mDnwyUK32ZpKZ0u5uBEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:00:41.391770Z","bundle_sha256":"9b124b57107f630c72492787f6d618126057b601d0f95e8d66ea51608ce3cc0b"}}