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: "on monotone drawings of trees"
  Abstract: A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with $n$ vertices on an $O(n^{1.5}) \times O(n^{1.5})$ grid whose angles are close to the best possible angular resolution. Our drawings are convex, that is, if every edge to a leaf is substituted by a ray, the (unbounded) faces form convex regions. It is known that convex drawings are monotone and, in the case of trees, also crossing-free. #R##N#A monotone drawing is strongly monotone if, for every pair of vertices, the direction that witnesses the monotonicity comes from the vector that connects the two vertices. We show that every tree admits a strongly monotone drawing. For biconnected outerplanar graphs, this is easy to see. On the other hand, we present a simply-connected graph that does not have a strongly monotone drawing in any embedding.

Connected through hyperedge HE-1 (induced by source paper "drawing graphs as spanners"):
  with members:
    - "on plane constrained bounded degree spanners"
    - "optimal monotone drawings of trees"
    - "strongly monotone drawings of planar graphs"
    - "on planar greedy drawings of 3 connected planar graphs"
    - "lower bounds on the dilation of plane spanners"
    - "recognition and complexity of point visibility graphs"
    - "on self approaching and increasing chord drawings of 3 connected planar graphs"
    - "increasing chord graphs on point sets"

Connected through hyperedge HE-2 (induced by source paper "drawing planar graphs with few segments on a polynomial grid"):
  with members:
    - "drawing planar graphs with few geometric primitives"
    - "drawing graphs on few circles and few spheres"
    - "experimental analysis of the accessibility of drawings with few segments"
    - "optimal monotone drawings of trees"
    - "the complexity of drawing graphs on few lines and few planes"
    - "strongly monotone drawings of planar graphs"
    - "drawing graphs on few lines and few planes"
    - "on self approaching and increasing chord drawings of 3 connected planar graphs"

Connected through hyperedge HE-3 (induced by source paper "monotone drawings of k inner planar graphs"):
  with members:
    - "simple compact monotone tree drawings"
    - "optimal monotone drawings of trees"
    - "orderly spanning trees with applications"

Connected through hyperedge HE-4 (induced by source paper "simple compact monotone tree drawings"):
  with members:
    - "optimal monotone drawings of trees"

Connected through hyperedge HE-5 (induced by source paper "on planar greedy drawings of 3 connected planar graphs"):
  with members:
    - "strongly monotone drawings of planar graphs"
    - "drawing planar graphs with many collinear vertices"
    - "gabriel triangulations and angle monotone graphs local routing and recognition"
    - "on self approaching and increasing chord drawings of 3 connected planar graphs"
    - "increasing chord graphs on point sets"
    - "self approaching graphs"
    - "euclidean greedy drawings of trees"
    - "succinct greedy geometric routing in the euclidean plane"

Connected through hyperedge HE-6 (induced by source paper "rooted uniform monotone minimum spanning trees"):
  with members:
    - "optimal monotone drawings of trees"
    - "strongly monotone drawings of planar graphs"
    - "gabriel triangulations and angle monotone graphs local routing and recognition"
    - "on self approaching and increasing chord drawings of 3 connected planar graphs"
    - "increasing chord graphs on point sets"
    - "self approaching graphs"
    - "monotone grid drawings of planar graphs"

Connected through hyperedge HE-7 (induced by source paper "strongly monotone drawings of planar graphs"):
  with members:
    - "on self approaching and increasing chord drawings of 3 connected planar graphs"
    - "increasing chord graphs on point sets"
    - "euclidean greedy drawings of trees"
    - "monotone grid drawings of planar graphs"

Connected through hyperedge HE-8 (induced by source paper "monotone simultaneous embeddings of paths in r d"):
  with members:
    - "strongly monotone drawings of planar graphs"
    - "simultaneous embedding of planar graphs"
    - "on a tree and a path with no geometric simultaneous embedding"

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)