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 "hanani tutte for approximating maps of graphs"):
  Abstract: We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing if a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise non-intersecting "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once.

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 "bounded embeddings of graphs in the plane":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hanani tutte for radial planarity ii")
  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 "embedding graphs into embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "clustered planarity flat clustered planarity")
  Member "detecting weakly simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimum cuts in surface graphs")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "toward the hanani tutte theorem for clustered graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "clustered planarity with pipes")
  Member "clustered planarity testing revisited":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")

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)