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 planar orthogonal drawings"
  Abstract: We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial embedding. Our morph uses a linear number of linear morphs (linear interpolations between two drawings) and preserves linear complexity throughout the process, thereby answering an open question from Biedl et al. #R##N#Our algorithm first unifies the two drawings to ensure an equal number of (virtual) bends on each edge. We then interpret bends as vertices which form obstacles for so-called wires: horizontal and vertical lines separating the vertices of $\Gamma_O$. These wires define homotopy classes with respect to the vertices of $G$ (for the combinatorial embedding of $G$ shared by $\Gamma_I$ and $\Gamma_O$). These homotopy classes can be represented by orthogonal polylines in $\Gamma_I$. We argue that the structural difference between the two drawings can be captured by the spirality of the wires in $\Gamma_I$, which guides our morph from $\Gamma_I$ to $\Gamma_O$.

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"
    - "how to morph planar graph drawings"
    - "optimal morphs of convex 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"
    - "square contact representations of partial 2 trees and triconnected simply nested graphs"
    - "how to morph planar graph drawings"
    - "optimal morphs of convex drawings"
    - "on self approaching and increasing chord drawings of 3 connected planar graphs"

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)