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 "recent advances in graph partitioning"):
  Abstract: We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.

Includes members:
  Member "on the parameterized complexity of computing balanced partitions in graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity")
  Member "semi external algorithms for graph partitioning and clustering":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scalable graph algorithms")
  Member "tree based coarsening and partitioning of complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generating realistic scaled complex networks")
  Member "a multilevel bilinear programming algorithm for the vertex separator problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "recent advances in scalable network generation")
  Member "parallel graph partitioning for complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "algorithms for mapping parallel processes onto grid and torus architectures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "topology induced enhancement of mappings")
  Member "partitioning complex networks via size constrained clustering":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "scalable graph algorithms")
  Member "community detection and graph partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "weighted laplacian and its theoretical applications")

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)