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 "parameterized streaming algorithms for vertex cover"):
  Abstract: As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one. However, few results are known for optimization problems over such dynamic graph streams. #R##N#In this paper, we introduce a new approach to handling graph streams, by instead seeking solutions for the parameterized versions of these problems where we are given a parameter $k$ and the objective is to decide whether there is a solution bounded by $k$. By combining kernelization techniques with randomized sketch structures, we obtain the first streaming algorithms for the parameterized versions of the Vertex Cover problem. We consider the following three models for a graph stream on $n$ nodes: #R##N#1. The insertion-only model where the edges can only be added. #R##N#2. The dynamic model where edges can be both inserted and deleted. #R##N#3. The \emph{promised} dynamic model where we are guaranteed that at each timestamp there is a solution of size at most $k$. #R##N#In each of these three models we are able to design parameterized streaming algorithms for the Vertex Cover problem. We are also able to show matching lower bound for the space complexity of our algorithms. #R##N#(Due to the arXiv limit of 1920 characters for abstract field, please see the abstract in the paper for detailed description of our results)

Includes members:
  Member "on feedback vertex set new measure and new structures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hitting long directed cycles is fixed parameter tractable")
  Member "simple deterministic algorithms for fully dynamic maximal matching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")
  Member "feasible sampling of non strict turnstile data streams":
    also connected through other hyperedges:
      (none)
  Member "fully dynamic maximal matching in o log n update time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "a near optimal sublinear time algorithm for approximating the minimum vertex cover size":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "complexity and efficient algorithms for data inconsistency evaluating and repairing")

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)