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 "distributed computation in node capacitated networks"):
  Abstract: In this paper, we study distributed graph algorithms in networks in which the nodes have a limited communication capacity. Many distributed systems are built on top of an underlying networking infrastructure, for example by using a virtual communication topology known as an overlay network. Although this underlying network might allow each node to directly communicate with a large number of other nodes, the amount of communication that a node can perform in a fixed amount of time is typically much more limited. We introduce the Node-Capacitated Clique model as an abstract communication model, which allows us to study the effect of nodes having limited communication capacity on the complexity of distributed graph computations. In this model, the $n$ nodes of a network are connected as a clique and communicate in synchronous rounds. In each round, every node can exchange messages of $O(\log n)$ bits with at most $O(\log n)$ other nodes. When solving a graph problem, the input graph $G$ is defined on the same set of $n$ nodes, where each node knows which other nodes are its neighbors in $G$. To initiate research on the Node-Capacitated Clique model, we present distributed algorithms for the Minimum Spanning Tree (MST), BFS Tree, Maximal Independent Set, Maximal Matching, and Vertex Coloring problems. We show that even with only $O(\log n)$ concurrent interactions per node, the MST problem can still be solved in polylogarithmic time. In all other cases, the runtime of our algorithms depends linearly on the arboricity of $G$, which is a constant for many important graph families such as planar graphs.

Includes members:
  Member "distributed symmetry breaking algorithms for congested cliques":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed mst a smoothed analysis")
  Member "competitive routing in hybrid communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "shortest paths in a hybrid network model")
  Member "further algebraic algorithms in the congested clique model and applications to graph theoretic problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "near optimal approximate shortest paths and transshipment in distributed and streaming models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "derandomizing local distributed algorithms under bandwidth restrictions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "algebraic methods in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "fast distributed algorithms for connectivity and mst in large graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "construction and impromptu repair of an mst in a distributed network with o m communication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "message reduction in the local model is a free lunch")

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)