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 "congested clique algorithms for graph spanners"):
  Abstract: Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling schemes and routing to solving linear systems and spectral sparsification. A $k$-spanner maintains pairwise distances up to multiplicative factor of $k$. It is a folklore that for every $n$-vertex graph $G$, one can construct a $(2k-1)$ spanner with $O(n^{1+1/k})$ edges. In a distributed setting, such spanners can be constructed in the standard CONGEST model using $O(k^2)$ rounds, when randomization is allowed. #R##N#In this work, we consider spanner constructions in the congested clique model, and show: (1) A randomized construction of a $(2k-1)$-spanner with $\widetilde{O}(n^{1+1/k})$ edges in $O(\log k)$ rounds. The previous best algorithm runs in $O(k)$ rounds. (2) A deterministic construction of a $(2k-1)$-spanner with $\widetilde{O}(n^{1+1/k})$ edges in $O(\log k +(\log\log n)^3)$ rounds. The previous best algorithm runs in $O(k\log n)$ rounds. This improvement is achieved by a new derandomization theorem for hitting sets which might be of independent interest. (3) A deterministic construction of a $O(k)$-spanner with $O(k \cdot n^{1+1/k})$ edges in $O(\log k)$ rounds.

Includes members:
  Member "distributed symmetry breaking algorithms for congested cliques":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed mst a smoothed analysis")
  Member "brief announcement semi mapreduce meets congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graph sparsification for derandomizing massively parallel computation with low space")
  Member "improved deterministic distributed construction of spanners":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "near additive spanners in low polynomial deterministic congest time")
  Member "transitive closure spanners":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient and simple algorithms for fault tolerant spanners")

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)