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 "simple and local independent set approximation"):
  Abstract: We bound the performance guarantees that follow from Tur\'an-like bounds for unweighted and weighted independent sets in bounded-degree graphs. In particular, a randomized approach of Boppana forms a simple 1-round distributed algorithm, as well as a streaming and preemptive online algorithm. We show it gives a tight $(\Delta+1)/2$-approximation in unweighted graphs of maximum degree $\Delta$, which is best possible for 1-round distributed algorithms. For weighted graphs, it gives only a $\Delta$-approximation, but a simple modification results in an asymptotic expected $0.529 \Delta$-approximation. This compares with a recent, more complex $\Delta$-approximation~\cite{BCGS17}, which holds deterministically.

Includes members:
  Member "independent set size approximation in graph streams":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "weighted maximum independent set of geometric objects in turnstile streams")
  Member "quadratic and near quadratic lower bounds for the congest model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed maximum matching verification in congest")
  Member "distributed approximation of maximum independent set and maximum matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed maximum matching verification in congest")
  Member "on the complexity of local distributed graph problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed edge coloring in time quasi polylogarithmic in delta")
  Member "on the lov asz theta function for independent sets in sparse graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bilu linial stability certified algorithms and the independent set problem")
  Member "local computation lower and upper bounds":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed maximum matching verification in congest")

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)