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 "shortest paths in a hybrid network model"):
  Abstract: We introduce a communication model for hybrid networks, where nodes have access to two different communication modes: a local mode where communication is only possible between specific pairs of nodes, and a global mode where communication between any pair of nodes is possible. This can be motivated, for instance, by wireless networks in which we combine direct device-to-device communication (e.g., using WiFi) with communication via a shared infrastructure (like base stations, the cellular network, or satellites). #R##N#Typically, communication over short-range connections is cheaper and can be done at a much higher rate. Hence, we are focusing here on the LOCAL model (in which the nodes can exchange an unbounded amount of information in each round) for the local connections while for the global communication we assume the so-called node-capacitated clique model, where in each round every node can exchange only $O(\log n)$-bit messages with just $O(\log n)$ other nodes. #R##N#In order to explore the power of combining local and global communication, we study the impact of hybrid communication on the complexity of computing shortest paths in the graph given by the local connections. Specifically, for the all-pairs shortest paths problem (APSP), we show that an exact solution can be computed in time $\tilde O\big(n^{2/3}\big)$ and that approximate solutions can be computed in time $\tilde \Theta\big(\!\sqrt{n}\big)$. For the single-source shortest paths problem (SSSP), we show that an exact solution can be computed in time $\tilde O\big(\!\sqrt{\mathsf{SPD}}\big)$, where $\mathsf{SPD}$ denotes the shortest path diameter. We further show that a $\big(1\!+\!o(1)\big)$-approximate solution can be computed in time $\tilde O\big(n^{1/3}\big)$. Additionally, we show that for every constant $\varepsilon>0$, it is possible to compute an $O(1)$-approximate solution in time $\tilde O(n^\varepsilon)$.

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 "mst in o 1 rounds of the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how fast can you update your mst dynamic algorithms for cluster computing")
  Member "a faster distributed single source shortest paths algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed edge connectivity in sublinear time")
  Member "distributed exact shortest paths in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "distributed edge connectivity in sublinear time")
  Member "competitive routing in hybrid communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed computation in node capacitated networks")

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)