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 "universal slope sets for 1 bend planar drawings"):
  Abstract: We describe a set of $\Delta -1$ slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree $\Delta \geq 4$; this establishes a new upper bound of $\Delta-1$ on the 1-bend planar slope number. By universal we mean that every planar graph of degree $\Delta$ has a planar drawing with at most one bend per edge and such that the slopes of the segments forming the edges belong to the given set of slopes. This improves over previous results in two ways: Firstly, the best previously known upper bound for the 1-bend planar slope number was $\frac{3}{2} (\Delta -1)$ (the known lower bound being $\frac{3}{4} (\Delta -1)$); secondly, all the known algorithms to construct 1-bend planar drawings with $O(\Delta)$ slopes use a different set of slopes for each graph and can have bad angular resolution, while our algorithm uses a universal set of slopes, which also guarantees that the minimum angle between any two edges incident to a vertex is $\frac{\pi}{(\Delta-1)}$.

Includes members:
  Member "1 bend upward planar drawings of sp digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "universal slope sets for upward planar drawings")
  Member "on the total number of bends for planar octilinear drawings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universal slope sets for upward planar drawings")
  Member "graph drawings with one bend and few slopes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "universal slope sets for upward planar drawings")
  Member "orthogonal graph drawing with inflexible edges":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an spqr tree like embedding representation for upward planarity")
  Member "planar octilinear drawings with one bend per edge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "drawing subcubic 1 planar graphs with few bends few slopes and large angles")
  Member "outerplanar graph drawings with few slopes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "level planar drawings with few slopes")
  Member "drawing trees with perfect angular resolution and polynomial area":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "bipartite and series parallel graphs without planar lombardi drawings")

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)