{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QN5GUAD55P2FN4CX3WVVOWXP7F","short_pith_number":"pith:QN5GUAD5","schema_version":"1.0","canonical_sha256":"837a6a007debf456f057ddab575aeff969af7108298f61ca558d2e5bf531e640","source":{"kind":"arxiv","id":"1403.4109","version":3},"attestation_state":"computed","paper":{"title":"Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.SY","authors_text":"Seyed Rasoul Etesami, Tamer Basar","submitted_at":"2014-03-17T14:22:48Z","abstract_excerpt":"In this paper, the question of expected time to convergence is addressed for unbiased quantized consensus on undirected connected graphs, and some strong results are obtained. The paper first provides a tight expression for the expected convergence time of the unbiased quantized consensus over general but fixed networks. It is shown that the maximum expected convergence time lies within a constant factor of the maximum hitting time of an appropriate lazy random walk, using the theory of harmonic functions for reversible Markov chains. Following this, and using electric resistance analogy of th"},"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":"1403.4109","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-03-17T14:22:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"61d7b07c624a4f5325ee3e7c6464da3af3e89b5e4bfc1f785b355e2ae938717f","abstract_canon_sha256":"3e39312a0e26d30a574dca0a4ed49b4037cdc075f1c7ea7a9e23a81a329b1813"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.071264Z","signature_b64":"6gFJqIsSKPqSIbO0xzj1vMD0q1QfEPUk/gWBKOt6tbhD3fUuSyVO/6i0xqWFEdrK/6n5QgD3NJlAJ1gpWm99AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837a6a007debf456f057ddab575aeff969af7108298f61ca558d2e5bf531e640","last_reissued_at":"2026-05-18T00:57:52.070704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.070704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.SY","authors_text":"Seyed Rasoul Etesami, Tamer Basar","submitted_at":"2014-03-17T14:22:48Z","abstract_excerpt":"In this paper, the question of expected time to convergence is addressed for unbiased quantized consensus on undirected connected graphs, and some strong results are obtained. The paper first provides a tight expression for the expected convergence time of the unbiased quantized consensus over general but fixed networks. It is shown that the maximum expected convergence time lies within a constant factor of the maximum hitting time of an appropriate lazy random walk, using the theory of harmonic functions for reversible Markov chains. Following this, and using electric resistance analogy of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4109","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.4109","created_at":"2026-05-18T00:57:52.070788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.4109v3","created_at":"2026-05-18T00:57:52.070788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4109","created_at":"2026-05-18T00:57:52.070788+00:00"},{"alias_kind":"pith_short_12","alias_value":"QN5GUAD55P2F","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QN5GUAD55P2FN4CX","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QN5GUAD5","created_at":"2026-05-18T12:28:46.137349+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/QN5GUAD55P2FN4CX3WVVOWXP7F","json":"https://pith.science/pith/QN5GUAD55P2FN4CX3WVVOWXP7F.json","graph_json":"https://pith.science/api/pith-number/QN5GUAD55P2FN4CX3WVVOWXP7F/graph.json","events_json":"https://pith.science/api/pith-number/QN5GUAD55P2FN4CX3WVVOWXP7F/events.json","paper":"https://pith.science/paper/QN5GUAD5"},"agent_actions":{"view_html":"https://pith.science/pith/QN5GUAD55P2FN4CX3WVVOWXP7F","download_json":"https://pith.science/pith/QN5GUAD55P2FN4CX3WVVOWXP7F.json","view_paper":"https://pith.science/paper/QN5GUAD5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.4109&json=true","fetch_graph":"https://pith.science/api/pith-number/QN5GUAD55P2FN4CX3WVVOWXP7F/graph.json","fetch_events":"https://pith.science/api/pith-number/QN5GUAD55P2FN4CX3WVVOWXP7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QN5GUAD55P2FN4CX3WVVOWXP7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QN5GUAD55P2FN4CX3WVVOWXP7F/action/storage_attestation","attest_author":"https://pith.science/pith/QN5GUAD55P2FN4CX3WVVOWXP7F/action/author_attestation","sign_citation":"https://pith.science/pith/QN5GUAD55P2FN4CX3WVVOWXP7F/action/citation_signature","submit_replication":"https://pith.science/pith/QN5GUAD55P2FN4CX3WVVOWXP7F/action/replication_record"}},"created_at":"2026-05-18T00:57:52.070788+00:00","updated_at":"2026-05-18T00:57:52.070788+00:00"}