Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with
  Local Communication   Iterative Approximate Byzantine Consensus (IABC) is a fundamental problem of
fault-tolerant distributed computing where machines seek to achieve approximate
consensus to arbitrary exactness in the presence of Byzantine failures. We
present a novel algorithm for this problem, named Relay-IABC, which relies on
the usage of a multi-hop relayed messaging system and crytographically secure
message signatures. The use of signatures and relays allows the strict
necessary network conditions of traditional IABC algorithms to be circumvented.
In addition, we show evidence that Relay-IABC achieves faster convergence than
traditional algorithms even under these strict network conditions with both
theoretical analysis and experimental results.

24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
19
The categories of this paper are: eess
33
The categories of this paper are: plasm-ph
29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
3
The categories of this paper are: physics
34
The categories of this paper are: chem-ph
27
The categories of this paper are: comp-gas
2
The categories of this paper are: math
35
The categories of this paper are: mtrl-th
7
The categories of this paper are: hep-th
0
The categories of this paper are: hep-ph
11
The categories of this paper are: hep-lat