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 "steinitz theorems for simple orthogonal polyhedra"):
  Abstract: We define a  simple orthogonal polyhedron  to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex.By analogy to Steinitz's theorem characterizing the graphs of convex polyhedra, we find graph-theoretic characterizations of three classes of simple orthogonal polyhedra:  corner polyhedra , which can be drawn by isometric projection in the plane with only one hidden vertex,  xyz polyhedra , in which each axis-parallel line through a vertex contains exactly one other vertex, and arbitrary simple orthogonal polyhedra. In particular, the graphs of  xyz  polyhedra are exactly the bipartite cubic polyhedral graphs, and every bipartite cubic polyhedral graph with a 4-connected dual graph is the graph of a corner polyhedron. Based on our characterizations we find efficient algorithms for constructing orthogonal polyhedra from their graphs.

Includes members:
  Member "adjacency preserving spatial treemaps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the parametric closure problem")
  Member "the complexity of bendless three dimensional orthogonal graph drawing":
    also connected through other hyperedges:
      (none)
  Member "orientation constrained rectangular layouts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adjacency preserving spatial treemaps")
  Member "area universal rectangular layouts":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing stable demers cartograms")
  Member "isometric diamond subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal 3d angular resolution for low degree graphs")
  Member "the lattice dimension of a graph":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "shortest path problem in rectangular complexes of global nonpositive curvature")
  Member "nonorthogonal polyhedra built from rectangles":
    also connected through other hyperedges:
      (none)

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)