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 "finding all global minimum cuts in practice"):
  Abstract: We present a practically efficient algorithm that finds all global minimum cuts in huge undirected graphs. Our algorithm uses a multitude of kernelization rules to reduce the graph to a small equivalent instance and then finds all minimum cuts using an optimized version of the algorithm of Nagamochi, Nakao and Ibaraki. In shared memory we are able to find all minimum cuts of graphs with up to billions of edges and millions of minimum cuts in a few minutes. We also give a new linear time algorithm to find the most balanced minimum cuts given as input the representation of all minimum cuts.

Includes members:
  Member "engineering kernelization for maximum cut":
    also connected through other hyperedges:
      (none)
  Member "shared memory branch and reduce for multiterminal cuts":
    also connected through other hyperedges:
      (none)
  Member "faster algorithms for edge connectivity via random 2 out contractions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "wegotyoucovered the winning solver from the pace 2019 implementation challenge vertex cover track":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "data reduction for maximum matching on real world graphs theory and experiments")
  Member "exactly solving the maximum weight independent set problem on large real world graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "scalable graph algorithms")
  Member "experimental evaluation of parameterized algorithms for feedback vertex set":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exploiting database management systems and treewidth for counting")
  Member "practical access to dynamic programming on tree decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exploiting database management systems and treewidth for counting")
  Member "practical minimum cut algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scalable graph algorithms")

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)