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 "embedding graphs into embedded graphs"):
  Abstract: A drawing of a graph $G$ in the plane is weakly simple if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph $G$ in the plane is weakly simple, can be carried out in polynomial time, if a desired embedding of $G$ belongs to a fixed isotopy class. In other words, we show that c-planarity with pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when $G$ is a cycle.

Includes members:
  Member "recognizing weakly simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimum cuts in surface graphs")
  Member "a new perspective on clustered planarity as a combinatorial embedding problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "detecting weakly simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimum cuts in surface graphs")
  Member "simultaneous pq ordering with applications to constrained embedding problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "atomic embeddability clustered planarity and thickenability")

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)