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 "memetic multilevel hypergraph partitioning"):
  Abstract: Hypergraph partitioning has a wide range of important applications such as VLSI design or scientific computing. With focus on solution quality, we develop the first multilevel memetic algorithm to tackle the problem. Key components of our contribution are new effective multilevel recombination and mutation operations that provide a large amount of diversity. We perform a wide range of experiments on a benchmark set containing instances from application areas such VLSI, SAT solving, social networks, and scientific computing. Our new algorithm computes the best result on almost all instances.

Includes members:
  Member "social hash partitioner a scalable distributed hypergraph partitioner":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed edge partitioning for trillion edge graphs")
  Member "k way hypergraph partitioning via n level recursive bisection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "recent advances in graph partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "distributed evolutionary graph partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "engineering multilevel graph partitioning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hypergraph partitioning with embeddings")

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)