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 "atomic embeddability clustered planarity and thickenability"):
  Abstract: We study the atomic embeddability testing problem, which is a common generalization of clustered planarity (c-planarity, for short) and thickenability testing, and present a polynomial-time algorithm for this problem, thereby giving the first polynomial-time algorithm for c-planarity. #R##N#C-planarity was introduced in 1995 by Feng, Cohen, and Eades as a variant of graph planarity, in which the vertex set of the input graph is endowed with a hierarchical clustering and we seek an embedding (crossing free drawing) of the graph in the plane that respects the clustering in a certain natural sense. Until now, it has been an open problem whether c-planarity can be tested efficiently, despite relentless efforts. The thickenability problem for simplicial complexes emerged in the topology of manifolds in the 1960s. A 2-dimensional simplicial complex is thickenable if it embeds in some orientable 3-dimensional manifold. Recently, Carmesin announced that thickenability can be tested in polynomial time. #R##N#Our algorithm for atomic embeddability combines ideas from Carmesin's work with algorithmic tools previously developed for weak embeddability testing. We express our results purely in terms of graphs on surfaces, and rely on the machinery of topological graph theory. #R##N#Finally, we give a polynomial-time reduction from atomic embeddability to thickenability thereby showing that both problems are polynomially equivalent, and show that a slight generalization of atomic embeddability to the setting in which clusters are toroidal graphs is NP-complete.

Includes members:
  Member "recognizing weak embeddings of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "hanani tutte for approximating maps of graphs":
    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 "clustered planarity with pipes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "recognizing weakly simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimum cuts in surface graphs")
  Member "detecting weakly simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimum cuts in surface graphs")
  Member "simultaneous embedding edge orderings relative positions cutvertices":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an spqr tree like embedding representation for upward planarity")
  Member "clustered planarity testing revisited":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "simultaneous embedding of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an spqr tree like embedding representation for upward planarity")

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)