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 "independent sets in vertex arrival streams"):
  Abstract: We consider the classic maximal and maximum independent set problems in three models of graph streams: #R##N#In the edge-arrival model we see a stream of edges which collectively define a graph, this model has been well-studied for a variety of problems. We first show that the space complexity for a one-pass streaming algorithm to find a maximal independent set is quadratic (i.e. we must store all edges). We further show that the problem does not become much easier if we only require approximate maximality. #R##N#In the "explicit" vertex stream model, the input stream is a sequence of vertices making up the graph, where every vertex arrives along with its incident edges that connect to previously arrived vertices. Various graph problems require substantially less space to solve in this setting than for edge-arrival streams. We show that every one-pass $c$-approximation algorithm for maximum independent set (MIS) on explicit vertex streams requires space $\Omega(\frac{n^2}{c^7})$, where $n$ is the number of vertices of the input graph, and it is already known that space $\tilde{\Theta}(\frac{n^2}{c^2})$ is necessary and sufficient in the edge arrival model (Halldorsson et al. 2012). The MIS problem is thus not significantly easier to solve under the explicit vertex arrival order assumption. Our result is proved via a reduction to a new multi-party communication problem closely related to pointer jumping. #R##N#In the "implicit" vertex stream model, the input stream consists of a sequence of objects, one per vertex. The algorithm is equipped with a function that can map a pair of objects to the presence or absence of an edge, thus defining the graph. This model captures, for example, geometric intersection graphs such as unit disc graphs. Our final set of results consists of several improved upper and lower bounds for ball intersection graphs, in both explicit and implicit streams.

Includes members:
  Member "correlation clustering in data streams":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fair correlation clustering")
  Member "interval selection in the streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weighted maximum independent set of geometric objects in turnstile streams")
  Member "space constrained interval selection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "weighted maximum independent set of geometric objects in turnstile streams")

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)