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 "linear kernels for separating a graph into components of bounded size"):
  Abstract: Abstract   The p-Size Separator problem is to check whether we can delete at most k vertices in a given graph such that each connected component of the remaining graph has at most p vertices. We prove a kernel of    O  (  p  k  )    vertices for this problem, i.e., a linear vertex kernel for each fixed    p  ≥  1   . Our proofs are based on extremal combinatorial arguments and the main result can be regarded as a generalization of the Nemhauser and Trotter's theorem for the  Vertex Cover  problem. Our techniques are possible to be used to improve kernel algorithms based on the expansion lemma or crown decompositions.

Includes members:
  Member "on a generalization of nemhauser and trotter s local optimization theorem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "kernelization and parameterized algorithms for 3 path vertex cover")
  Member "deleting edges to restrict the size of an epidemic a new application for treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "two dichotomies for model checking in multi layer structures")
  Member "on the computational complexity of vertex integrity and component order connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subgraph isomorphism on graph classes that exclude a substructure")
  Member "minimum bisection is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fixed parameter tractability of counting small minimum s t cuts")
  Member "minimum k way cut of bounded size is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the number of minimum k cuts improving the karger stein bound")
  Member "finding small separators in linear time via treewidth reduction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fixed parameter tractability of counting small minimum s t cuts")
  Member "hitting forbidden minors approximation and kernelization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "structural parameterization for graph deletion problems over data streams")
  Member "multicut is fpt":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parameterized inapproximability for steiner orientation by gap amplification")

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)