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 "clique cover and graph separation new incompressibility results"):
  Abstract: The field of kernelization studies polynomial-time preprocessing routines for hard problems in the framework of parameterized complexity. Although a framework for proving kernelization lower bounds has been discovered in 2008 and successfully applied multiple times over the last three years, establishing kernelization complexity of many important problems remains open. In this paper we show that, unless NP is a subset of coNP/poly and the polynomial hierarchy collapses up to its third level, the following parameterized problems do not admit a polynomial-time preprocessing algorithm that reduces the size of an instance to polynomial in the parameter: #R##N#- EDGE CLIQUE COVER, parameterized by the number of cliques, #R##N#- DIRECTED EDGE/VERTEX MULTIWAY CUT, parameterized by the size of the cutset, even in the case of two terminals, #R##N#- EDGE/VERTEX MULTICUT, parameterized by the size of the cutset, and #R##N#- k-WAY CUT, parameterized by the size of the cutset. #R##N#The existence of a polynomial kernelization for EDGE CLIQUE COVER was a seasoned veteran in open problem sessions. Furthermore, our results complement very recent developments in designing parameterized algorithms for cut problems by Marx and Razgon [STOC'11], Bousquet et al. [STOC'11], Kawarabayashi and Thorup [FOCS'11] and Chitnis et al. [SODA'12].

Includes members:
  Member "kernelization lower bounds by cross composition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "subexponential parameterized algorithms and kernelization on almost chordal graphs")
  Member "fixed parameter tractability of multicut in directed acyclic graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a relaxation of the directed disjoint paths problem a global congestion metric helps")
  Member "kernelization of packing problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the approximate compressibility of connected vertex cover")
  Member "representative sets and irrelevant vertices new tools for kernelization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on quasipolynomial multicut mimicking networks and kernelization of multiway cut problems")
  Member "preprocessing for treewidth a combinatorial analysis through kernelization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "measuring what matters a hybrid approach to dynamic programming with treewidth")
  Member "co nondeterminism in compositions a kernelization lower bound for a ramsey type problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "frameworks for solving turing kernel lower bound problem and finding natural candidate problems in np intermediate")
  Member "compression via matroids a randomized polynomial kernel for odd cycle transversal":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parameterized algorithms and data reduction for the short secluded s t path problem")
  Member "large isolating cuts shrink the multiway cut":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs")

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)