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 "reachability and shortest paths in the broadcast congest model"):
  Abstract: In this paper we study the time complexity of the single-source reachability problem and the single-source shortest path problem for directed unweighted graphs in the Broadcast CONGEST model. We focus on the case where the diameter $D$ of the underlying network is constant. We show that for the case where $D = 1$ there is, quite surprisingly, a very simple algorithm that solves the reachability problem in $1$(!) round. In contrast, for networks with $D = 2$, we show that any distributed algorithm (possibly randomized) for this problem requires $\Omega(\sqrt{n/ \log{n}}\,)$ rounds. Our results therefore completely resolve (up to a small polylogarithmic factor) the complexity of the single-source reachability problem for a wide range of diameters. Furthermore, we show that when $D = 1$, it is even possible to get a $3$-approximation for the all-pairs shortest path problem (for directed unweighted graphs) in just $2$ rounds. We also prove a stronger lower bound of $\Omega(\sqrt{n}\,)$ for the single-source shortest path problem for unweighted directed graphs that holds even when the diameter of the underlying network is $2$. As far as we know this is the first lower bound that achieves $\Omega(\sqrt{n}\,)$ for this problem.

Includes members:
  Member "fast approximate shortest paths in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast approximate shortest paths in the congested clique")
  Member "distributed exact weighted all pairs shortest paths in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simple and fast distributed computation of betweenness centrality")
  Member "distributed exact shortest paths in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed edge connectivity in sublinear time")
  Member "improved distributed algorithms for exact shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed edge connectivity in sublinear time")
  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 partial distance estimation and applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fast approximate shortest paths in the congested clique")
  Member "distributed approximation algorithms for weighted shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed edge connectivity in sublinear time")

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)