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 "near linear time constant factor approximation algorithm for branch decomposition of planar graphs"):
  Abstract: We give an algorithm which for an input planar graph $G$ of $n$ vertices and integer $k$, in $\min\{O(n\log^3n),O(nk^2)\}$ time either constructs a branch-decomposition of $G$ with width at most $(2+\delta)k$, $\delta>0$ is a constant, or a $(k+1)\times \lceil{\frac{k+1}{2}}\rceil$ cylinder minor of $G$ implying ${\mathop {\rm bw}}(G)>k$, ${\mathop {\rm bw}}(G)$ is the branchwidth of $G$. This is the first $\tilde{O}(n)$ time constant-factor approximation for branchwidth/treewidth and largest grid/cylinder minors of planar graphs and improves the previous $\min\{O(n^{1+\epsilon}),O(nk^3)\}$ ($\epsilon>0$ is a constant) time constant-factor approximations. For a planar graph $G$ and $k={\mathop {\rm bw}}(G)$, a branch-decomposition of width at most $(2+\delta)k$ and a $g\times \frac{g}{2}$ cylinder/grid minor with $g=\frac{k}{\beta}$, $\beta>2$ is constant, can be computed by our algorithm in $\min\{O(n\log^3n\log k),O(nk^2\log k)\}$ time

Includes members:
  Member "all pairs minimum cuts in near linear time for surface embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimum cuts in surface graphs")
  Member "structured recursive separator decompositions for planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the edge crossings of the greedy spanner")
  Member "approximate tree decompositions of planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hitting topological minors is fpt")
  Member "min st cut oracle for planar graphs with near linear preprocessing time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimum cuts in surface graphs")
  Member "exact distance oracles for planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a divide and conquer algorithm for two point l_1 shortest path queries in polygonal domains")

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)