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 the expected maximum degree of gabriel and yao graphs"
  Abstract: Motivated by applications of Gabriel graphs and Yao graphs in wireless ad-hoc networks, we show that the maximal degree of a random Gabriel graph or Yao graph defined on $n$ points drawn uniformly at random from a unit square grows as $\Theta (\log n / \log \log n)$ in probability.

Connected through hyperedge HE-1 (induced by source paper "distribution sensitive construction of the greedy spanner"):
  with members:
    - "computing the greedy spanner in linear space"
    - "minimum dilation stars"

Connected through hyperedge HE-2 (induced by source paper "10 gabriel graphs are hamiltonian"):
  with members:
    - "matching in gabriel graphs"

Connected through hyperedge HE-3 (induced by source paper "on the average number of edges in theta graphs"):
  with members:
    - "the θ 5 graph is a spanner"
    - "on the stretch factor of the theta 4 graph"
    - "probabilistic bounds on the length of a longest edge in delaunay graphs of random points in d dimensions"

Connected through hyperedge HE-4 (induced by source paper "probabilistic bounds on the length of a longest edge in delaunay graphs of random points in d dimensions"):
  with members:
    - "communication efficient construction of the plane localized delaunay graph"

Connected through hyperedge HE-5 (induced by source paper "on the number of higher order delaunay triangulations"):
  with members:
    - "bounds on the maximum multiplicity of some common geometric graphs"
    - "counting triangulations of planar 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)