human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "truly tight in delta bounds for bipartite maximal matching and variants"):
  Abstract: In a recent breakthrough result, Balliu et al. [FOCS'19] proved a deterministic $\Omega(\min(\Delta,\log n /\log \log n))$-round and a randomized $\Omega(\min(\Delta,\log \log n/\log \log \log n))$-round lower bound for the complexity of the bipartite maximal matching problem on $n$-node graphs in the LOCAL model of distributed computing. #R##N#Both lower bounds are asymptotically tight as a function of the maximum degree $\Delta$. #R##N#We provide truly tight bounds in $\Delta$ for the complexity of bipartite maximal matching and many natural variants, up to and including the additive constant. #R##N#As a by-product, our results yield a considerably simplified version of the proof by Balliu et al. #R##N#We show that our results can be obtained via bounded automatic round elimination, a version of the recent automatic round elimination technique by Brandt [PODC'19] that is particularly suited for automatization from a practical perspective. #R##N#In this context, our work can be seen as another step towards the automatization of lower bounds in the LOCAL model.

Includes members:
  Member "an automatic speedup theorem for distributed problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the topology of local computing in networks")
  Member "classification of distributed binary labeling problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed graph problems through an automata theoretic lens")
  Member "lower bounds for maximal matchings and maximal independent sets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed maximum matching verification in congest")
  Member "locality of not so weak coloring":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "seeing far vs seeing wide volume complexity of local graph problems")
  Member "hardness of minimal symmetry breaking in distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "seeing far vs seeing wide volume complexity of local graph problems")
  Member "the complexity of distributed edge coloring with small palettes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed edge coloring in time quasi polylogarithmic in delta")
  Member "improved deterministic distributed matching via rounding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed maximum matching verification in congest")
  Member "an exponential separation between randomized and deterministic complexity in the local model":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed graph problems through an automata theoretic lens")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DC(Distributed, Parallel, and Cluster Computing)