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 "delaunay simplices in diagonally distorted lattices"):
  Abstract: Delaunay protection is a measure of how far a Delaunay triangulation is from being degenerate. In this short paper we study the protection properties and other quality measures of the Delaunay triangulations of a family of lattices that is obtained by distorting the integer grid in $\mathbb{R}^d$. We show that the quality measures of this family are maximized for a certain distortion parameter, and that for this parameter, the lattice is isometric to the permutahedral lattice, which is a well-known object in discrete geometry.

Includes members:
  Member "anisotropic triangulations via discrete riemannian voronoi diagrams":
    also connected through other hyperedges:
      (none)
  Member "polynomial sized topological approximations using the permutahedron":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spectral sparsification of simplicial complexes for clustering and label propagation")
  Member "sphere packing with limited overlap":
    also connected through other hyperedges:
      (none)
  Member "delaunay stability via perturbations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a probabilistic approach to reducing the algebraic complexity of computing delaunay triangulations")
  Member "only distances are required to reconstruct submanifolds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a probabilistic approach to reducing the algebraic complexity of computing delaunay triangulations")
  Member "the stability of delaunay triangulations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "local criteria for triangulation of manifolds")

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)