Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Hardness of minimal symmetry breaking in distributed computing   A graph is weakly $2$-colored if the nodes are labeled with colors black and
white such that each black node is adjacent to at least one white node and vice
versa. In this work we study the distributed computational complexity of weak
$2$-coloring in the standard LOCAL model of distributed computing, and how it
is related to the distributed computational complexity of other graph problems.
First, we show that weak $2$-coloring is a minimal distributed
symmetry-breaking problem for regular even-degree trees and high-girth graphs:
if there is any non-trivial locally checkable labeling problem that is solvable
in $o(\log^* n)$ rounds with a distributed graph algorithm in the middle of a
regular even-degree tree, then weak $2$-coloring is also solvable in $o(\log^*
n)$ rounds there. Second, we prove a tight lower bound of $\Omega(\log^* n)$
for the distributed computational complexity of weak $2$-coloring in regular
trees; previously only a lower bound of $\Omega(\log \log^* n)$ was known. By
minimality, the same lower bound holds for any non-trivial locally checkable
problem inside regular even-degree trees.

27
The categories of this paper are: comp-gas
28
The categories of this paper are: alg-geom
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
31
The categories of this paper are: ao-sci
30
The categories of this paper are: q-alg
15
The categories of this paper are: nucl-ex
19
The categories of this paper are: eess
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
18
The categories of this paper are: econ