human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "10 gabriel graphs are hamiltonian"):
  Abstract: Given a set $S$ of points in the plane, the $k$-Gabriel graph of $S$ is the geometric graph with vertex set $S$, where $p_i,p_j\in S$ are connected by an edge if and only if the closed disk having segment $\bar{p_ip_j}$ as diameter contains at most $k$ points of $S \setminus \{p_i,p_j\}$. We consider the following question: What is the minimum value of $k$ such that the $k$-Gabriel graph of every point set $S$ contains a Hamiltonian cycle? For this value, we give an upper bound of 10 and a lower bound of 2. The best previously known values were 15 and 1, respectively.

Includes members:
  Member "matching in gabriel graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "strong matching of points with geometric shapes")
  Member "on the expected maximum degree of gabriel and yao graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distribution sensitive construction of the greedy spanner")

Question: Please tell me which class the source paper 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)