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 "computational topology of graphs on surfaces"):
  Abstract: Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn on surfaces. Typical questions include representing surfaces and graphs embedded on them computationally, deciding whether a graph embeds on a surface, solving computational problems related to homotopy, optimizing curves and graphs on surfaces, and solving standard graph algorithm problems more efficiently in the case of surface-embedded graphs.

Includes members:
  Member "untangling planar curves":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lower bounds for planar electrical reduction")
  Member "shortest path embeddings of graphs on surfaces":
    also connected through other hyperedges:
      (none)
  Member "a direct proof of the strong hanani tutte theorem on the projective plane":
    also connected through other hyperedges:
      (none)
  Member "minimum cycle and homology bases of surface embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimum cuts in surface graphs")
  Member "crossing number is hard for kernelization":
    also connected through other hyperedges:
      (none)
  Member "computing the geometric intersection number of curves":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "topologically trivial closed walks in directed surface graphs")
  Member "how to walk your dog in the mountains with no magic leash":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "homotopy height grid major height and graph drawing height")
  Member "beyond the euler characteristic approximating the genus of general graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polylogarithmic approximation for minimum planarization almost")

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)