{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ARDRFDSBBU3BMQ7EHUT3SX2R7D","short_pith_number":"pith:ARDRFDSB","schema_version":"1.0","canonical_sha256":"0447128e410d361643e43d27b95f51f8dd15f8a805ff04e66dbf5c23674f8417","source":{"kind":"arxiv","id":"1101.3520","version":1},"attestation_state":"computed","paper":{"title":"Error-Free Multi-Valued Consensus with Byzantine Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Guanfeng Liang, Nitin Vaidya","submitted_at":"2011-01-18T18:32:22Z","abstract_excerpt":"In this paper, we present an efficient deterministic algorithm for consensus in presence of Byzantine failures. Our algorithm achieves consensus on an $L$-bit value with communication complexity $O(nL + n^4 L^{0.5} + n^6)$ bits, in a network consisting of $n$ processors with up to $t$ Byzantine failures, such that $t<n/3$. For large enough $L$, communication complexity of the proposed algorithm approaches $O(nL)$ bits. In other words, for large $L$, the communication complexity is linear in the number of processors in the network. This is an improvement over the work of Fitzi and Hirt (from PO"},"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":"1101.3520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-18T18:32:22Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"1da68c031d51185fccc30b39cb8ece19bddce4513a4a4727e9186e2febb62345","abstract_canon_sha256":"5d39dceea072a8483784474b614e5cf2d9176dce1befddec07211df6a500c23d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:22.914030Z","signature_b64":"qzeBiZbpu4JfjPTe+V//25djhoG5U/5AFny4wh6Xr6kK1d+CXsdX7/ycpcnNawKnxXigUYO6Ay7xwF6EdfuxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0447128e410d361643e43d27b95f51f8dd15f8a805ff04e66dbf5c23674f8417","last_reissued_at":"2026-05-18T04:31:22.913627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:22.913627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error-Free Multi-Valued Consensus with Byzantine Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Guanfeng Liang, Nitin Vaidya","submitted_at":"2011-01-18T18:32:22Z","abstract_excerpt":"In this paper, we present an efficient deterministic algorithm for consensus in presence of Byzantine failures. Our algorithm achieves consensus on an $L$-bit value with communication complexity $O(nL + n^4 L^{0.5} + n^6)$ bits, in a network consisting of $n$ processors with up to $t$ Byzantine failures, such that $t<n/3$. For large enough $L$, communication complexity of the proposed algorithm approaches $O(nL)$ bits. In other words, for large $L$, the communication complexity is linear in the number of processors in the network. This is an improvement over the work of Fitzi and Hirt (from PO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3520","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":"1101.3520","created_at":"2026-05-18T04:31:22.913685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3520v1","created_at":"2026-05-18T04:31:22.913685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3520","created_at":"2026-05-18T04:31:22.913685+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARDRFDSBBU3B","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARDRFDSBBU3BMQ7E","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARDRFDSB","created_at":"2026-05-18T12:26:24.575870+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/ARDRFDSBBU3BMQ7EHUT3SX2R7D","json":"https://pith.science/pith/ARDRFDSBBU3BMQ7EHUT3SX2R7D.json","graph_json":"https://pith.science/api/pith-number/ARDRFDSBBU3BMQ7EHUT3SX2R7D/graph.json","events_json":"https://pith.science/api/pith-number/ARDRFDSBBU3BMQ7EHUT3SX2R7D/events.json","paper":"https://pith.science/paper/ARDRFDSB"},"agent_actions":{"view_html":"https://pith.science/pith/ARDRFDSBBU3BMQ7EHUT3SX2R7D","download_json":"https://pith.science/pith/ARDRFDSBBU3BMQ7EHUT3SX2R7D.json","view_paper":"https://pith.science/paper/ARDRFDSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3520&json=true","fetch_graph":"https://pith.science/api/pith-number/ARDRFDSBBU3BMQ7EHUT3SX2R7D/graph.json","fetch_events":"https://pith.science/api/pith-number/ARDRFDSBBU3BMQ7EHUT3SX2R7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARDRFDSBBU3BMQ7EHUT3SX2R7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARDRFDSBBU3BMQ7EHUT3SX2R7D/action/storage_attestation","attest_author":"https://pith.science/pith/ARDRFDSBBU3BMQ7EHUT3SX2R7D/action/author_attestation","sign_citation":"https://pith.science/pith/ARDRFDSBBU3BMQ7EHUT3SX2R7D/action/citation_signature","submit_replication":"https://pith.science/pith/ARDRFDSBBU3BMQ7EHUT3SX2R7D/action/replication_record"}},"created_at":"2026-05-18T04:31:22.913685+00:00","updated_at":"2026-05-18T04:31:22.913685+00:00"}