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 "polyline drawings with topological constraints"):
  Abstract: Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of crossings as $G$. Drawing $\Gamma$ fully preserves the topology of $G$ if the planarization of $G$ and the planarization of $\Gamma$ have the same planar embedding. We show that if the set of crossing-free edges of $G$ forms a connected spanning subgraph, then $G$ admits a polyline drawing that partially preserves its topology and that has curve complexity at most three (i.e., at most three bends per edge). If, however, the set of crossing-free edges of $G$ is not a connected spanning subgraph, the curve complexity may be $\Omega(\sqrt{n})$. Concerning drawings that fully preserve the topology, we show that if $G$ has skewness $k$, it admits one such drawing with curve complexity at most $2k$; for skewness-1 graphs, the curve complexity can be reduced to one, which is a tight bound. We also consider optimal $2$-plane graphs and discuss trade-offs between curve complexity and crossing angle resolution of drawings that fully preserve the topology.

Includes members:
  Member "a survey on graph drawing beyond planarity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fan crossing free graphs")
  Member "compact drawings of 1 planar graphs with right angle crossings and few bends":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "drawing graphs with circular arcs and right angle crossings")
  Member "on optimal 2 and 3 planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "book embeddings of nonplanar graphs with small faces in few pages")
  Member "an annotated bibliography on 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fan crossing free graphs")
  Member "new results on edge partitions of 1 plane graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on graph drawing beyond planarity")
  Member "relating graph thickness to planar layers and bend complexity":
    also connected through other hyperedges:
      (none)
  Member "straight line drawability of a planar graph plus an edge":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on graph drawing beyond planarity")
  Member "convex arc drawings of pseudolines":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "arrangements of approaching pseudo lines")

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.CG(Computational Geometry)