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 "evolutionary acyclic graph partitioning"):
  Abstract: Directed graphs are widely used to model data flow and execution dependencies in streaming applications. This enables the utilization of graph partitioning algorithms for the problem of parallelizing computation for multiprocessor architectures. However due to resource restrictions, an acyclicity constraint on the partition is necessary when mapping streaming applications to an embedded multiprocessor. Here, we contribute a multi-level algorithm for the acyclic graph partitioning problem. Based on this, we engineer an evolutionary algorithm to further reduce communication cost, as well as to improve load balancing and the scheduling makespan on embedded multiprocessor architectures.

Includes members:
  Member "graph partitioning with acyclicity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "recent advances in graph partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "distributed evolutionary graph partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "asymptotically optimal randomized rumor spreading":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "randomized rumor spreading in ad hoc networks with buffers")
  Member "engineering multilevel graph partitioning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hypergraph partitioning with embeddings")
  Member "engineering a scalable high quality graph partitioner":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "recent advances in scalable network generation")

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)