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 "finding secluded places of special interest in graphs"):
  Abstract: Finding a vertex subset in a graph that satisfies a certain property is one of the most-studied topics in algorithmic graph theory. The focus herein is often on minimizing or maximizing the size of the solution, that is, the size of the desired vertex set. In several applications, however, we also want to limit the "exposure" of the solution to the rest of the graph. This is the case, for example, when the solution represents persons that ought to deal with sensitive information or a segregated community. In this work, we thus explore the (parameterized) complexity of finding such secluded vertex subsets for a wide variety of properties that they shall fulfill. More precisely, we study the constraint that the (open or closed) neighborhood of the solution shall be bounded by a parameter and the influence of this constraint on the complexity of minimizing separators, feedback vertex sets, F-free vertex deletion sets, dominating sets, and the maximization of independent sets.

Includes members:
  Member "parameterized complexity of secluded connectivity problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized algorithms and data reduction for the short secluded s t path problem")
  Member "towards optimal and expressive kernelization for d hitting set":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal size problem kernels for d hitting set in linear time and space")
  Member "on the parameterized complexity of cutting a few vertices from a graph":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the parameterized complexity of finding secluded solutions to some classical optimization problems on graphs")
  Member "secluded connectivity problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameterized algorithms and data reduction for the short secluded s t path problem")
  Member "approximation and tidying a problem kernel for s plex cluster vertex deletion":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on adaptive algorithms for maximum matching")
  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")

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)