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 upward planar drawings"):
  Abstract: We prove that every set $\mathcal S$ of $\Delta$ slopes containing the horizontal slope is universal for $1$-bend upward planar drawings of bitonic $st$-graphs with maximum vertex degree $\Delta$, i.e., every such digraph admits a $1$-bend upward planar drawing whose edge segments use only slopes in $\mathcal S$. This result is worst-case optimal in terms of the number of slopes, and, for a suitable choice of $\mathcal S$, it gives rise to drawings with worst-case optimal angular resolution. In addition, we prove that every such set $\mathcal S$ can be used to construct $2$-bend upward planar drawings of $n$-vertex planar $st$-graphs with at most $4n-9$ bends in total. Our main tool is a constructive technique that runs in linear time.

Includes members:
  Member "planar l drawings of directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "upward book embeddings of st graphs")
  Member "1 bend upward planar drawings of sp digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universal slope sets for 1 bend planar drawings")
  Member "bitonic st orderings for upward planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "windrose planarity embedding graphs with direction constrained edges")
  Member "on the total number of bends for planar octilinear drawings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on smooth orthogonal and octilinear drawings relations complexity and kandinsky drawings")
  Member "graph drawings with one bend and few slopes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "universal slope sets for 1 bend planar drawings")
  Member "planar octilinear drawings with one bend per edge":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "drawing subcubic 1 planar graphs with few bends few slopes and large angles")

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)