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 "computing the girth of a planar graph in linear time"):
  Abstract: The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an $n$-node unweighted undirected planar graph. The first nontrivial algorithm for the problem, given by Djidjev, runs in $O(n^{5/4}\log n)$ time. Chalermsook, Fakcharoenphol, and Nanongkai reduced the running time to $O(n\log^2 n)$. Weimann and Yuster further reduced the running time to $O(n\log n)$. In this paper, we solve the problem in $O(n)$ time.

Includes members:
  Member "improved minimum cuts and maximum flows in undirected planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "faster energy maximization for faster maximum flow")
  Member "planar subgraph isomorphism revisited":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "detecting and counting small patterns in planar graphs in subexponential parameterized time")
  Member "subgraph isomorphism in planar graphs and related problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on subgraph counting concepts algorithms and applications to network motifs and graphlets")
  Member "minimum cuts in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "approximating spectral clustering via sampling a review")

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)