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 "random sampling applied to the mst problem in the node congested clique model"):
  Abstract: The Congested Clique model, proposed by Lotker et al. [SPAA'03, SICOMP'05], was introduced in order to provide a simple abstraction for overlay networks. Congested Clique is a model of distributed (or parallel) computing, in which there are $n$ players (nodes) with unique identifiers from set {1, ..., n}, which perform computations in synchronous rounds. Each round consists of the phase of unlimited local computation and the communication phase. While communicating, each pair of nodes is allowed to exchange a single message of size $\mathcal{O}(\log n)$ bits. #R##N#Since, in a single round, each player can communicate with even $\Theta(n)$ other players, the model seems to be to powerful to imitate bandwidth restriction emerging from the underlying network. In this paper we study a restricted version of the Congested Clique model, the Node Congested Clique model, proposed by Augustine et al. [arxiv1805]. The additional restriction is that in a single communication phase, a player is allowed to send / receive only $\mathcal{O}(\log n)$ messages. #R##N#In this paper, we provide communication primitives that improve the round complexity of the MST (Minimum Spanning Tree) algorithm by Augustine et al. [arxiv1805] to $\mathcal{O}(\log^3 n)$ rounds. Moreover, we propose a different approach to this problem that requires only $\mathcal{O}(\log^3 n / \log \log n)$ rounds, and has smaller dependence on the weights of the edges. #R##N#Besides the faster MST algorithm, we consider the key contributions to be: #R##N#- an efficient implementation of some basic protocols, #R##N#- a tighter analysis of a special case of the sampling approach by Karger, Klein and Tarjan [JACM'95] (and related results by Pemmaraju and Sardeshmukh [FSTTCS'16]), #R##N#- an application of sparse recovery techniques going slightly beyond the standard usage of linear graph sketching by Ahn, Guha and McGregor [SODA'12]

Includes members:
  Member "mst in o 1 rounds of the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how fast can you update your mst dynamic algorithms for cluster computing")
  Member "round compression for parallel matching algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "deterministic mst sparsification in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved massively parallel computation algorithms for mis matching and vertex cover")
  Member "distributed computation of large scale graph problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "optimal deterministic routing and sorting on the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "finding connected components on map reduce in logarithmic rounds":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")

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.DS(Data Structures and Algorithms)