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 "wegotyoucovered the winning solver from the pace 2019 implementation challenge vertex cover track"):
  Abstract: We present the winning solver of the PACE 2019 Implementation Challenge, Vertex Cover Track. The minimum vertex cover problem is one of a handful of problems for which kernelization---the repeated reducing of the input size via data reduction rules---is known to be highly effective in practice. Our algorithm uses a portfolio of techniques, including an aggressive kernelization strategy, local search, branch-and-reduce, and a state-of-the-art branch-and-bound solver. Of particular interest is that several of our techniques were not from the literature on the vertex over problem: they were originally published to solve the (complementary) maximum independent set and maximum clique problems. #R##N#Aside from illustrating our solver's performance in the PACE 2019 Implementation Challenge, our experiments provide several key insights not yet seen before in the literature. First, kernelization can boost the performance of branch-and-bound clique solvers enough to outperform branch-and-reduce solvers. Second, local search can significantly boost the performance of branch-and-reduce solvers. And finally, somewhat surprisingly, kernelization can sometimes make branch-and-bound algorithms perform worse than running branch-and-bound alone.

Includes members:
  Member "scalable kernelization for maximum independent sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finding all global minimum cuts in practice")
  Member "exact algorithms for maximum independent set":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hitting topological minors is fpt")
  Member "accelerating local search for the maximum independent set problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding all global minimum cuts in practice")
  Member "on the power of simple reductions for the maximum independent set problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph profiling for vertex cover targeted reductions in a branch and reduce solver")
  Member "trajectory based dynamic map labeling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "temporal map labeling a new unified framework with experiments")
  Member "efficient classification for metric data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robustness for non parametric classification a generic attack and defense")
  Member "linear time fpt algorithms via network flow":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "graph profiling for vertex cover targeted reductions in a branch and reduce solver")

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)