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 "latency capacity and distributed mst"):
  Abstract: Consider the problem of building a minimum-weight spanning tree for a given graph $G$. In this paper, we study the cost of distributed MST construction where each edge has a latency and a capacity, along with the weight. Edge latencies capture the delay on the links of the communication network, while capacity captures their throughput (in this case the rate at which messages can be sent). Depending on how the edge latencies relate to the edge weights, we provide several tight bounds on the time required to construct an MST. When there is no correlation between the latencies and the weights, we show that (unlike the sub-linear time algorithms in the standard \textsf{CONGEST} model, on small diameter graphs), the best time complexity that can be achieved is $\tilde{\Theta}(D+n/c)$, where edges have capacity $c$ and $D$ refers to the latency diameter of the graph. However, if we restrict all edges to have equal latency $\ell$ and capacity $c$, we give an algorithm that constructs an MST in $\tilde{O}(D + \sqrt{n\ell/c})$ time. Next, we consider the case where latencies are exactly equal to the weights. Here we show that, perhaps surprisingly, the bottleneck parameter in determining the running time of an algorithm is the total weight $W$ of the constructed MST by showing a tight bound of $\tilde{\Theta}(D + \sqrt{W/c})$. In each case, we provide matching lower bounds.

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 "broadcast and minimum spanning tree with o m messages in the asynchronous congest model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "near optimal schedules for simultaneous multicasts")
  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 "a time and message optimal distributed algorithm for minimum spanning trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improved algorithm for min cuts in distributed networks")
  Member "construction and impromptu repair of an mst in a distributed network with o m communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "message reduction in the local model is a free lunch")
  Member "distributed verification and hardness of distributed approximation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "beyond alice and bob improved inapproximability for maximum independent set in congest")

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)