{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AKNJLOPSVPDCLREIRCQJLOUDIL","short_pith_number":"pith:AKNJLOPS","schema_version":"1.0","canonical_sha256":"029a95b9f2abc625c48888a095ba8342ceec1a54e5d8b492d14be0b13ac52d11","source":{"kind":"arxiv","id":"1208.0788","version":2},"attestation_state":"computed","paper":{"title":"An Upper Bound on the Convergence Time for Quantized Consensus","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DC","cs.PF","math.OC"],"primary_cat":"stat.AP","authors_text":"Pan Hui, Paul W. Cuff, Sanjeev R. Kulkarni, Shang Shang","submitted_at":"2012-08-03T16:16:13Z","abstract_excerpt":"We analyze a class of distributed quantized consen- sus algorithms for arbitrary networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network, and then update their estimation by communicating with their neighbors in a limited capacity channel in an asynchronous clock setting. Eventually, all nodes reach consensus with quantized precision. We start the analysis with a special case of a distributed binary voting algorithm, then proceed to the expected convergence time for the general quantized consensus a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1208.0788","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.AP","submitted_at":"2012-08-03T16:16:13Z","cross_cats_sorted":["cs.DC","cs.PF","math.OC"],"title_canon_sha256":"f61fe0d53c009ed3b652fc3a796e7737cd968624f3b8dc280f7e9c5d258e410a","abstract_canon_sha256":"aee5f6527f29e3202ee2b9082203d926e7bbe653acb3f845bac6011305268ea8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:25.678776Z","signature_b64":"9XXxC5G2if9BqVfuO0+y4W7DaQAsIui4EZtBAcZ5PxfgkPRHwj57oLB1JSqpquWfyZ0qfik4JFijz7rds8DxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"029a95b9f2abc625c48888a095ba8342ceec1a54e5d8b492d14be0b13ac52d11","last_reissued_at":"2026-05-18T03:25:25.678022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:25.678022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Upper Bound on the Convergence Time for Quantized Consensus","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DC","cs.PF","math.OC"],"primary_cat":"stat.AP","authors_text":"Pan Hui, Paul W. Cuff, Sanjeev R. Kulkarni, Shang Shang","submitted_at":"2012-08-03T16:16:13Z","abstract_excerpt":"We analyze a class of distributed quantized consen- sus algorithms for arbitrary networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network, and then update their estimation by communicating with their neighbors in a limited capacity channel in an asynchronous clock setting. Eventually, all nodes reach consensus with quantized precision. We start the analysis with a special case of a distributed binary voting algorithm, then proceed to the expected convergence time for the general quantized consensus a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0788","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.0788","created_at":"2026-05-18T03:25:25.678140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0788v2","created_at":"2026-05-18T03:25:25.678140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0788","created_at":"2026-05-18T03:25:25.678140+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKNJLOPSVPDC","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKNJLOPSVPDCLREI","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKNJLOPS","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AKNJLOPSVPDCLREIRCQJLOUDIL","json":"https://pith.science/pith/AKNJLOPSVPDCLREIRCQJLOUDIL.json","graph_json":"https://pith.science/api/pith-number/AKNJLOPSVPDCLREIRCQJLOUDIL/graph.json","events_json":"https://pith.science/api/pith-number/AKNJLOPSVPDCLREIRCQJLOUDIL/events.json","paper":"https://pith.science/paper/AKNJLOPS"},"agent_actions":{"view_html":"https://pith.science/pith/AKNJLOPSVPDCLREIRCQJLOUDIL","download_json":"https://pith.science/pith/AKNJLOPSVPDCLREIRCQJLOUDIL.json","view_paper":"https://pith.science/paper/AKNJLOPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0788&json=true","fetch_graph":"https://pith.science/api/pith-number/AKNJLOPSVPDCLREIRCQJLOUDIL/graph.json","fetch_events":"https://pith.science/api/pith-number/AKNJLOPSVPDCLREIRCQJLOUDIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKNJLOPSVPDCLREIRCQJLOUDIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKNJLOPSVPDCLREIRCQJLOUDIL/action/storage_attestation","attest_author":"https://pith.science/pith/AKNJLOPSVPDCLREIRCQJLOUDIL/action/author_attestation","sign_citation":"https://pith.science/pith/AKNJLOPSVPDCLREIRCQJLOUDIL/action/citation_signature","submit_replication":"https://pith.science/pith/AKNJLOPSVPDCLREIRCQJLOUDIL/action/replication_record"}},"created_at":"2026-05-18T03:25:25.678140+00:00","updated_at":"2026-05-18T03:25:25.678140+00:00"}