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 "level planar drawings with few slopes"):
  Abstract: We introduce and study level-planar straight-line drawings with a fixed number $\lambda$ of slopes. For proper level graphs, we give an $O(n \log^2 n / \log \log n)$-time algorithm that either finds such a drawing or determines that no such drawing exists. Moreover, we consider the partial drawing extension problem, where we seek to extend an immutable drawing of a subgraph to a drawing of the whole graph, and the simultaneous drawing problem, which asks about the existence of drawings of two graphs whose restrictions to their shared subgraph coincide. We present $O(n^{4/3} \log n)$-time and $O({\lambda} n^{10/3} \log n)$-time algorithms for these respective problems on proper level-planar graphs. We complement these positive results by showing that testing whether non-proper level graphs admit level-planar drawings with $\lambda$ slopes is $\textsf{NP}$-hard even in restricted cases.

Includes members:
  Member "drawing k linear metro maps":
    also connected through other hyperedges:
      (none)
  Member "experimental analysis of the accessibility of drawings with few segments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "drawing planar graphs with few segments on a polynomial grid")
  Member "simultaneous orthogonal planarity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hierarchical partial planarity")
  Member "beyond level planarity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "extending upward planar graph drawings")
  Member "outerplanar graph drawings with few slopes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "drawing subcubic 1 planar graphs with few bends few slopes and large angles")
  Member "simultaneous embedding of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "atomic embeddability clustered planarity and thickenability")
  Member "multiple source multiple sink maximum flow in directed planar graphs in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "minimum cuts in surface graphs")
  Member "shortest paths in planar graphs with real lengths in o n log 2n log log n time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "min cost flow in unit capacity planar graphs")

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)