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 "a time and message optimal distributed algorithm for minimum spanning trees"):
  Abstract: This paper presents a randomized Las Vegas distributed algorithm that constructs a minimum spanning tree (MST) in weighted networks with optimal (up to polylogarithmic factors) time and message complexity. This algorithm runs in $\tilde{O}(D + \sqrt{n})$ time and exchanges $\tilde{O}(m)$ messages (both with high probability), where $n$ is the number of nodes of the network, $D$ is the diameter, and $m$ is the number of edges. This is the first distributed MST algorithm that matches \emph{simultaneously} the time lower bound of $\tilde{\Omega}(D + \sqrt{n})$ [Elkin, SIAM J. Comput. 2006] and the message lower bound of $\Omega(m)$ [Kutten et al., J.ACM 2015] (which both apply to randomized algorithms). #R##N#The prior time and message lower bounds are derived using two completely different graph constructions; the existing lower bound construction that shows one lower bound {\em does not} work for the other. To complement our algorithm, we present a new lower bound graph construction for which any distributed MST algorithm requires \emph{both} $\tilde{\Omega}(D + \sqrt{n})$ rounds and $\Omega(m)$ messages.

Includes members:
  Member "time message trade offs in distributed algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "message reduction in the local model is a free lunch")
  Member "round and message optimal distributed graph algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "near optimal schedules for simultaneous multicasts")
  Member "symmetry breaking in the congest model time and message efficient algorithms for ruling sets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deterministic distributed ruling sets of line graphs")
  Member "a simple deterministic distributed mst algorithm with near optimal time and message complexities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved algorithm for min cuts in distributed networks")
  Member "low congestion shortcuts without embedding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "near optimal schedules for simultaneous multicasts")
  Member "a deterministic almost tight distributed algorithm for approximating single source shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams")
  Member "construction and impromptu repair of an mst in a distributed network with o m communication":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "message reduction in the local model is a free lunch")
  Member "distributed symmetry breaking in hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient distributed computation of mis and generalized mis in linear hypergraphs")

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)