{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TUZIPR4XHS3ORPSBLPGX4XIHR3","short_pith_number":"pith:TUZIPR4X","schema_version":"1.0","canonical_sha256":"9d3287c7973cb6e8be415bcd7e5d078effc37805d1822d00761e7fbe166cdc94","source":{"kind":"arxiv","id":"1202.1083","version":1},"attestation_state":"computed","paper":{"title":"Convergence Speed of Binary Interval Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.PR","authors_text":"Milan Vojnovic, Moez Draief","submitted_at":"2012-02-06T09:53:16Z","abstract_excerpt":"We consider the convergence time for solving the binary consensus problem using the interval consensus algorithm proposed by B\\' en\\' ezit, Thiran and Vetterli (2009). In the binary consensus problem, each node initially holds one of two states and the goal for each node is to correctly decide which one of these two states was initially held by a majority of nodes.\n  We derive an upper bound on the expected convergence time that holds for arbitrary connected graphs, which is based on the location of eigenvalues of some contact rate matrices. We instantiate our bound for particular networks of "},"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":"1202.1083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-06T09:53:16Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"666004a8d2c934be172cc20e555c91f5905bbd5a0f47fd5ea7ba139f78028e04","abstract_canon_sha256":"e65a18c75312d1f87038b73196665d2acfac3c75300a53cdd1f4a39523750f66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:05.154989Z","signature_b64":"x3LIGjM68maTiaqtuDc9srZeifT+P+oiSQx7m392segP6nM4YvrICs3ZPHph0zdsF1VX+RJ5ghw+t/g2n8pACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d3287c7973cb6e8be415bcd7e5d078effc37805d1822d00761e7fbe166cdc94","last_reissued_at":"2026-05-18T04:03:05.154216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:05.154216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Speed of Binary Interval Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.PR","authors_text":"Milan Vojnovic, Moez Draief","submitted_at":"2012-02-06T09:53:16Z","abstract_excerpt":"We consider the convergence time for solving the binary consensus problem using the interval consensus algorithm proposed by B\\' en\\' ezit, Thiran and Vetterli (2009). In the binary consensus problem, each node initially holds one of two states and the goal for each node is to correctly decide which one of these two states was initially held by a majority of nodes.\n  We derive an upper bound on the expected convergence time that holds for arbitrary connected graphs, which is based on the location of eigenvalues of some contact rate matrices. We instantiate our bound for particular networks of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1083","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.1083","created_at":"2026-05-18T04:03:05.154333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1083v1","created_at":"2026-05-18T04:03:05.154333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1083","created_at":"2026-05-18T04:03:05.154333+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUZIPR4XHS3O","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUZIPR4XHS3ORPSB","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUZIPR4X","created_at":"2026-05-18T12:27:23.164592+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/TUZIPR4XHS3ORPSBLPGX4XIHR3","json":"https://pith.science/pith/TUZIPR4XHS3ORPSBLPGX4XIHR3.json","graph_json":"https://pith.science/api/pith-number/TUZIPR4XHS3ORPSBLPGX4XIHR3/graph.json","events_json":"https://pith.science/api/pith-number/TUZIPR4XHS3ORPSBLPGX4XIHR3/events.json","paper":"https://pith.science/paper/TUZIPR4X"},"agent_actions":{"view_html":"https://pith.science/pith/TUZIPR4XHS3ORPSBLPGX4XIHR3","download_json":"https://pith.science/pith/TUZIPR4XHS3ORPSBLPGX4XIHR3.json","view_paper":"https://pith.science/paper/TUZIPR4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1083&json=true","fetch_graph":"https://pith.science/api/pith-number/TUZIPR4XHS3ORPSBLPGX4XIHR3/graph.json","fetch_events":"https://pith.science/api/pith-number/TUZIPR4XHS3ORPSBLPGX4XIHR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUZIPR4XHS3ORPSBLPGX4XIHR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUZIPR4XHS3ORPSBLPGX4XIHR3/action/storage_attestation","attest_author":"https://pith.science/pith/TUZIPR4XHS3ORPSBLPGX4XIHR3/action/author_attestation","sign_citation":"https://pith.science/pith/TUZIPR4XHS3ORPSBLPGX4XIHR3/action/citation_signature","submit_replication":"https://pith.science/pith/TUZIPR4XHS3ORPSBLPGX4XIHR3/action/replication_record"}},"created_at":"2026-05-18T04:03:05.154333+00:00","updated_at":"2026-05-18T04:03:05.154333+00:00"}