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: "unfolding manhattan towers"
  Abstract: We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4x5x1 refinement of the vertex grid.

Connected through hyperedge HE-1 (induced by source paper "unfolding genus 2 orthogonal polyhedra with linear refinement"):
  with members:
    - "unfolding orthogonal polyhedra with quadratic refinement the delta unfolding algorithm"
    - "epsilon unfolding orthogonal polyhedra"
    - "ununfoldable polyhedra with convex faces"

Connected through hyperedge HE-2 (induced by source paper "unfolding orthogonal polyhedra with quadratic refinement the delta unfolding algorithm"):
  with members:
    - "epsilon unfolding orthogonal polyhedra"
    - "ununfoldable polyhedra with convex faces"

Connected through hyperedge HE-3 (induced by source paper "unfolding orthogonal terrains"):
  with members:
    - "open problems from cccg 2002"

Connected through hyperedge HE-4 (induced by source paper "epsilon unfolding orthogonal polyhedra"):
  with members:
    - "grid vertex unfolding orthogonal polyhedra"
    - "open problems from cccg 2002"
    - "vertex unfoldings of simplicial manifolds"

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)