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 "optimal 3d angular resolution for low degree graphs"):
  Abstract: We show that every graph of maximum degree three can be drawn in three dimensions with at most two bends per edge, and with 120-degree angles between any two edge segments meeting at a vertex or a bend. We show that every graph of maximum degree four can be drawn in three dimensions with at most three bends per edge, and with 109.5-degree angles, i.e., the angular resolution of the diamond lattice, between any two edge segments meeting at a vertex or bend.

Includes members:
  Member "maximizing the total resolution of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stress plus x spx graph layout")
  Member "notes on large angle crossing graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graphs with large total angular resolution")
  Member "isometric diamond subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "steinitz theorems for simple orthogonal polyhedra")
  Member "trees with convex faces and optimal angles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "realization and connectivity of the graphs of origami flat foldings")
  Member "the geometric thickness of low degree graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a constructive arboricity approximation scheme")

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)