{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ARDRFDSBBU3BMQ7EHUT3SX2R7D","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":"5d39dceea072a8483784474b614e5cf2d9176dce1befddec07211df6a500c23d","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-18T18:32:22Z","title_canon_sha256":"1da68c031d51185fccc30b39cb8ece19bddce4513a4a4727e9186e2febb62345"},"schema_version":"1.0","source":{"id":"1101.3520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3520","created_at":"2026-05-18T04:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3520v1","created_at":"2026-05-18T04:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3520","created_at":"2026-05-18T04:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"ARDRFDSBBU3B","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ARDRFDSBBU3BMQ7E","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ARDRFDSB","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:6160e886050529f270fd6fe59b22d04a99d998375e7420db1c15f7329d1966d2","target":"graph","created_at":"2026-05-18T04:31:22Z","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 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","authors_text":"Guanfeng Liang, Nitin Vaidya","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-18T18:32:22Z","title":"Error-Free Multi-Valued Consensus with Byzantine Failures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3520","kind":"arxiv","version":1},"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:f3e95d31a338a0c1af3879f0fcc2dd882ac018d7a1ccedd488b43d528af15d87","target":"record","created_at":"2026-05-18T04:31:22Z","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":"5d39dceea072a8483784474b614e5cf2d9176dce1befddec07211df6a500c23d","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-18T18:32:22Z","title_canon_sha256":"1da68c031d51185fccc30b39cb8ece19bddce4513a4a4727e9186e2febb62345"},"schema_version":"1.0","source":{"id":"1101.3520","kind":"arxiv","version":1}},"canonical_sha256":"0447128e410d361643e43d27b95f51f8dd15f8a805ff04e66dbf5c23674f8417","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0447128e410d361643e43d27b95f51f8dd15f8a805ff04e66dbf5c23674f8417","first_computed_at":"2026-05-18T04:31:22.913627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:22.913627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qzeBiZbpu4JfjPTe+V//25djhoG5U/5AFny4wh6Xr6kK1d+CXsdX7/ycpcnNawKnxXigUYO6Ay7xwF6EdfuxAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:22.914030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3e95d31a338a0c1af3879f0fcc2dd882ac018d7a1ccedd488b43d528af15d87","sha256:6160e886050529f270fd6fe59b22d04a99d998375e7420db1c15f7329d1966d2"],"state_sha256":"877eacae8eaf4018f202adfc3a6a1f5de0bd9610527d4fdb5af87df7288771c2"}