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 "fixed parameter tractability of graph deletion problems over data streams"):
  Abstract: In this work, we initiate a systematic study of parameterized streaming complexity of graph deletion problems: ${\cal F}$-Subgraph Deletion, ${\cal F}$-Minor Deletion and Cluster Vertex Deletion in the four most well-studied streaming models: the EA (edge arrival), DEA (dynamic edge arrival), VA (vertex arrival) and AL (adjacency list) models. We also consider the streaming complexities of a collection of widely-studied problems that are special variants of ${\cal F}$-Subgraph Deletion, namely Feedback Vertex Set, Even Cycle Transversal, Odd Cycle Transversal, Triangle Deletion, and Cluster Vertex Deletion. #R##N#Except for the Triangle Deletion and Cluster Vertex Deletion problems, we show that none of the other problems have space-efficient streaming algorithms when the problems are parameterized by $k$, the solution size. In fact, we show that these problems admit $\Omega(n\log n)$ lower bounds in all the four models stated above. This improves the lower bounds given by Chitnis et al. (SODA'16) for the EA model. For the Triangle Deletion and Cluster Vertex Deletion problems, the question of lower bounds for the problems parameterized by $k$ is open for the AL model. For all other models, we show an improved lower bound of $\Omega(n\log n)$ for Triangle Deletion. With regards to Cluster Vertex Deletion, we extend the results of Chitnis et al. (SODA'16) in the EA model to the DEA and VA models. #R##N#We exploit the power of parameterization - a usual approach taken in parameterized algorithms - to study a problem with respect to parameters greater than the solution size or consider some structural parameters. Parameterized by vertex cover size $K$, some of these problems on some of the graph streaming models do not admit space-efficient streaming algorithms, while it does so for others

Includes members:
  Member "on the streaming complexity of fundamental geometric problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "structural parameterization for graph deletion problems over data streams")
  Member "tight bounds for single pass streaming complexity of the set cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "preprocessing subgraph and minor problems when does a small vertex cover help":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "measuring what matters a hybrid approach to dynamic programming with treewidth")

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.CC(Computational Complexity)