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 "near linear lower bounds for distributed distance computations even in sparse networks"):
  Abstract: We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for computing the diameter in sparse networks, which was previously known only for dense networks [Frishknecht et al., SODA 2012]. In fact, we can even modify our construction to obtain graphs with constant degree, using a simple but powerful degree-reduction technique which we define. #R##N#Moreover, our technique allows us to show $\widetilde{\Omega}(n)$ lower bounds for computing $(\frac{3}{2}-\varepsilon)$-approximations of the diameter or the radius, and for computing a $(\frac{5}{3}-\varepsilon)$-approximation of all eccentricities. For radius, we are unaware of any previous lower bounds. For diameter, these greatly improve upon previous lower bounds and are tight up to polylogarithmic factors [Frishknecht et al., SODA 2012], and for eccentricities the improvement is both in the lower bound and in the approximation factor [Holzer and Wattenhofer, PODC 2012]. #R##N#Interestingly, our technique also allows showing an almost-linear lower bound for the verification of $(\alpha,\beta)$-spanners, for $\alpha < \beta+1$.

Includes members:
  Member "distributed construction of purely additive spanners":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond alice and bob improved inapproximability for maximum independent set in congest")
  Member "an almost tight distributed algorithm for computing single source shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parallel approximate undirected shortest paths via low hop emulators")
  Member "algebraic methods in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "subtree isomorphism revisited":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tighter connections between formula sat and shaving logs")
  Member "approximation of distances and shortest paths in the broadcast congest clique":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "popular conjectures imply strong lower bounds for dynamic problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "edit distance cannot be computed in strongly subquadratic time unless seth is false":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  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.DC(Distributed, Parallel, and Cluster Computing)