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 "algebraic methods in the congested clique"):
  Abstract: In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an $O(n^{1-2/\omega})$ round matrix multiplication algorithm, where $\omega < 2.3728639$ is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include: #R##N#-- triangle and 4-cycle counting in $O(n^{0.158})$ rounds, improving upon the $O(n^{1/3})$ triangle detection algorithm of Dolev et al. [DISC 2012], #R##N#-- a $(1 + o(1))$-approximation of all-pairs shortest paths in $O(n^{0.158})$ rounds, improving upon the $\tilde{O} (n^{1/2})$-round $(2 + o(1))$-approximation algorithm of Nanongkai [STOC 2014], and #R##N#-- computing the girth in $O(n^{0.158})$ rounds, which is the first non-trivial solution in this model. #R##N#In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.

Includes members:
  Member "approximation of distances and shortest paths in the broadcast congest clique":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "minimum weight spanning tree construction in o log log log n rounds on the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed symmetry breaking algorithms for congested cliques")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "distributed approximation algorithms for weighted shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed edge connectivity in sublinear time")
  Member "lessons from the congested clique applied to mapreduce":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "near constant time distributed algorithms on a congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed approximation algorithms for steiner tree in the mathcal congested mathcal clique")
  Member "faster all pairs shortest paths via circuit complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deterministic algorithms for decremental approximate shortest paths faster and simpler")
  Member "efficient computation of representative sets with applications in parameterized and exact algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "extensor coding")

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)