human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "optimal morphs of convex drawings"
  Abstract: We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity. The linear bound is asymptotically optimal in the worst case.

Connected through hyperedge HE-1 (induced by source paper "how to morph a tree on a small grid"):
  with members:
    - "upward planar morphs"
    - "pole dancing 3d morphs for tree drawings"
    - "optimal morphs of planar orthogonal drawings"
    - "how to morph planar graph drawings"
    - "morphing schnyder drawings of planar triangulations"
    - "morphing planar graph drawings optimally"
    - "drawing graphs in the plane with a prescribed outer face and polynomial area"

Connected through hyperedge HE-2 (induced by source paper "morphing contact representations of graphs"):
  with members:
    - "upward planar morphs"
    - "optimal morphs of planar orthogonal drawings"
    - "square contact representations of partial 2 trees and triconnected simply nested graphs"
    - "how to morph planar graph drawings"
    - "on self approaching and increasing chord drawings of 3 connected planar graphs"

Connected through hyperedge HE-3 (induced by source paper "upward planar morphs"):
  with members:
    - "how to morph planar graph drawings"
    - "morphing planar graph drawings with unidirectional moves"
    - "morphing planar graph drawings optimally"

Connected through hyperedge HE-4 (induced by source paper "convexity increasing morphs of planar graphs"):
  with members:
    - "how to morph planar graph drawings"
    - "powers of tensors and fast matrix multiplication"

Question: Please tell me which class the center node 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)