human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "deterministic mst sparsification in the congested clique"
  Abstract: We give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to $n^{1+\varepsilon}$ while preserving the minimum spanning forest, where $\varepsilon > 0$ is any constant. This implies that in the congested clique model, it is sufficient to improve MST and other connectivity algorithms on graphs with slightly superlinear number of edges to obtain a general improvement. As a byproduct, we also obtain a simple alternative proof showing that MST can be computed deterministically in $O(\log \log n)$ rounds.

Connected through hyperedge HE-1 (induced by source paper "improved massively parallel computation algorithms for mis matching and vertex cover"):
  with members:
    - "correlation clustering in data streams"
    - "mst in o 1 rounds of the congested clique"
    - "coresets meet edcs algorithms for matching and vertex cover on massive graphs"
    - "simple round compression for parallel vertex cover"
    - "round compression for parallel matching algorithms"
    - "derandomizing local distributed algorithms under bandwidth restrictions"
    - "algebraic methods in the congested clique"
    - "a deterministic almost tight distributed algorithm for approximating single source shortest paths"

Connected through hyperedge HE-2 (induced by source paper "random sampling applied to the mst problem in the node congested clique model"):
  with members:
    - "mst in o 1 rounds of the congested clique"
    - "round compression for parallel matching algorithms"
    - "distributed computation of large scale graph problems"
    - "optimal deterministic routing and sorting on the congested clique"
    - "finding connected components on map reduce in logarithmic rounds"

Question: Please tell me which class the center node 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)