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: "graph drawings with one bend and few slopes"
  Abstract: We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these paths is small. We prove that $\lceil\frac{\Delta}{2}\rceil$ edge slopes suffice for outerplanar drawings of outerplanar graphs with maximum degree $\Delta\geq 3$. This matches the obvious lower bound. We also show that $\lceil\frac{\Delta}{2}\rceil+1$ edge slopes suffice for drawings of general graphs, improving on the previous bound of $\Delta+1$. Furthermore, we improve previous upper bounds on the number of slopes needed for planar drawings of planar and bipartite planar graphs.

Connected through hyperedge HE-1 (induced by source paper "universal slope sets for upward planar drawings"):
  with members:
    - "planar l drawings of directed graphs"
    - "1 bend upward planar drawings of sp digraphs"
    - "bitonic st orderings for upward planar graphs"
    - "on the total number of bends for planar octilinear drawings"
    - "planar octilinear drawings with one bend per edge"

Connected through hyperedge HE-2 (induced by source paper "universal slope sets for 1 bend planar drawings"):
  with members:
    - "1 bend upward planar drawings of sp digraphs"
    - "on the total number of bends for planar octilinear drawings"
    - "orthogonal graph drawing with inflexible edges"
    - "planar octilinear drawings with one bend per edge"
    - "outerplanar graph drawings with few slopes"
    - "drawing trees with perfect angular resolution and polynomial area"

Connected through hyperedge HE-3 (induced by source paper "1 bend upward planar drawings of sp digraphs"):
  with members:
    - "outerplanar graph drawings with few slopes"

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)