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: "rooted uniform monotone minimum spanning trees"
  Abstract: We study the construction of the minimum cost spanning geometric graph of a given rooted point set $P$ where each point of $P$ is connected to the root by a path that satisfies a given property. We focus on two properties, namely the monotonicity w.r.t. a single direction ($y$-monotonicity) and the monotonicity w.r.t. a single pair of orthogonal directions ($xy$-monotonicity). We propose algorithms that compute the rooted $y$-monotone ($xy$-monotone) minimum spanning tree of $P$ in $O(|P|\log^2 |P|)$ (resp. $O(|P|\log^3 |P|)$) time when the direction (resp. pair of orthogonal directions) of monotonicity is given, and in $O(|P|^2\log|P|)$ time when the optimum direction (resp. pair of orthogonal directions) has to be determined. We also give simple algorithms which, given a rooted connected geometric graph, decide if the root is connected to every other vertex by paths that are all monotone w.r.t. the same direction (pair of orthogonal directions).

Connected through hyperedge HE-1 (induced by source paper "uniform 2d monotone minimum spanning graphs"):
  with members:
    - "angle monotone graphs construction and local routing"
    - "drawing a rooted tree as a rooted y monotone minimum spanning tree"
    - "simple compact monotone tree drawings"
    - "angle monotone paths in non obtuse triangulations"
    - "optimal monotone drawings of trees"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "drawing a rooted tree as a rooted y monotone minimum spanning tree"):
  with members:
    - "tree drawings revisited"
    - "simple compact monotone tree drawings"
    - "optimal monotone drawings of trees"

Connected through hyperedge HE-3 (induced by source paper "exploring increasing chord paths and trees"):
  with members:
    - "gabriel triangulations and angle monotone graphs local routing and recognition"
    - "partitioning graph drawings and triangulated simple polygons into greedily routable regions"
    - "on self approaching and increasing chord drawings of 3 connected planar graphs"
    - "increasing chord graphs on point sets"
    - "self approaching graphs"

Connected through hyperedge HE-4 (induced by source paper "angle monotone paths in non obtuse triangulations"):
  with members:
    - "gabriel triangulations and angle monotone graphs local routing and recognition"
    - "unfolding convex polyhedra via radially monotone cut trees"
    - "increasing chord graphs on point sets"

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)