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 plane constrained bounded degree spanners"
  Abstract: Let $P$ be a finite set of points in the plane and $S$ a set of non-crossing line segments with endpoints in $P$. The visibility graph of $P$ with respect to $S$, denoted $Vis(P,S)$, has vertex set $P$ and an edge for each pair of vertices $u,v$ in $P$ for which no line segment of $S$ properly intersects $uv$. We show that the constrained half-$\theta_6$-graph (which is identical to the constrained Delaunay graph whose empty visible region is an equilateral triangle) is a plane 2-spanner of $Vis(P,S)$. We then show how to construct a plane 6-spanner of $Vis(P,S)$ with maximum degree $6+c$, where $c$ is the maximum number of segments of $S$ incident to a vertex.

Connected through hyperedge HE-1 (induced by source paper "drawing graphs as spanners"):
  with members:
    - "optimal monotone drawings of trees"
    - "strongly monotone drawings of planar graphs"
    - "on planar greedy drawings of 3 connected planar graphs"
    - "on monotone drawings of trees"
    - "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 "plane hop spanners for unit disk graphs simpler and better"):
  with members:
    - "on geometric spanners of euclidean and unit disk graphs"

Connected through hyperedge HE-3 (induced by source paper "routing on the visibility graph"):
  with members:
    - "constrained routing between non visible vertices"
    - "towards tight bounds on theta graphs"
    - "upper bounds on the spanning ratio of constrained theta graphs"
    - "competitive local routing with constraints"

Connected through hyperedge HE-4 (induced by source paper "fault tolerant additive weighted geometric spanners"):
  with members:
    - "efficient construction of spanners in d dimensions"
    - "from hierarchical partitions to hierarchical covers optimal fault tolerant spanners for doubling metrics"
    - "bounded degree planar geometric spanners"
    - "spanners of additively weighted point sets"
    - "geometric spanners with small chromatic number"
    - "sparse geometric graphs with small dilation"
    - "fast construction of nets in low dimensional metrics and their applications"

Connected through hyperedge HE-5 (induced by source paper "constrained routing between non visible vertices"):
  with members:
    - "upper bounds on the spanning ratio of constrained theta graphs"
    - "competitive local routing with constraints"

Connected through hyperedge HE-6 (induced by source paper "constrained generalized delaunay graphs are plane spanners"):
  with members:
    - "the stretch factor of the delaunay triangulation is less than 1 998"
    - "on the stretch factor of convex delaunay graphs"

Connected through hyperedge HE-7 (induced by source paper "there are plane spanners of maximum degree 4"):
  with members:
    - "the stretch factor of the delaunay triangulation is less than 1 998"
    - "π 2 angle yao graphs are spanners"
    - "on geometric spanners of euclidean and unit disk graphs"

Connected through hyperedge HE-8 (induced by source paper "competitive local routing with constraints"):
  with members:
    - "optimal local routing on delaunay triangulations defined by empty equilateral triangles"
    - "upper bounds on the spanning ratio of constrained theta graphs"

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)