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 "diversity in combinatorial optimization"):
  Abstract: When modeling an application of practical relevance as an instance of a combinatorial problem X, we are often interested not merely in finding one optimal solution for that instance, but in finding a sufficiently diverse collection of good solutions. In this work we introduce an intuitive notion of diversity of a collection of solutions which suits a large variety of combinatorial problems of practical interest. We then present an algorithmic framework which---automatically---converts a tree-decomposition-based dynamic programming algorithm for a given combinatorial problem X into a dynamic programming algorithm for the diverse version of X. Surprisingly, our algorithm has a polynomial dependence on the diversity parameter. Going further, we devise a framework to translate kernels of a certain type for a given combinatorial problem X into kernels of a slightly larger size for its diverse version.

Includes members:
  Member "what is known about vertex cover kernelization":
    also connected through other hyperedges:
      (none)
  Member "propagation via kernelization the vertex cover constraint":
    also connected through other hyperedges:
      (none)
  Member "guarantees and limits of preprocessing in constraint satisfaction and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity and approximability of parameterized max csps")
  Member "efficient classification for metric data":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness for non parametric classification a generic attack and defense")
  Member "parameterized complexity and kernel bounds for hard planning problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "guarantees and limits of preprocessing in constraint satisfaction and reasoning")
  Member "limits of preprocessing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "guarantees and limits of preprocessing in constraint satisfaction and reasoning")
  Member "kernels for global constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity and approximability of parameterized max csps")

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)