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 "how to morph a tree on a small grid"):
  Abstract: In this paper we study planar morphs between straight-line planar grid drawings of trees. A morph consists of a sequence of morphing steps, where in a morphing step vertices move along straight-line trajectories at constant speed. We show how to construct planar morphs that simultaneously achieve a reduced number of morphing steps and a polynomially-bounded resolution. We assume that both the initial and final drawings lie on the grid and we ensure that each morphing step produces a grid drawing; further, we consider both upward drawings of rooted trees and drawings of arbitrary trees.

Includes members:
  Member "upward planar morphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "upward book embeddings of st graphs")
  Member "pole dancing 3d morphs for tree drawings":
    also connected through other hyperedges:
      (none)
  Member "optimal morphs of planar orthogonal drawings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "morphing contact representations of graphs")
  Member "how to morph planar graph drawings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "morphing contact representations of graphs")
  Member "optimal morphs of convex drawings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "morphing contact representations of graphs")
  Member "morphing schnyder drawings of planar triangulations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the weighted barycenter drawing recognition problem")
  Member "morphing planar graph drawings optimally":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "upward planar morphs")
  Member "drawing graphs in the plane with a prescribed outer face and polynomial area":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "circumscribing polygons and polygonizations for disjoint line segments")

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)