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: "distance k sectors exist"
  Abstract: The bisector of two nonempty sets P and Q in R^d is the set of all points with equal distance to P and to Q. A distance k-sector of P and Q, where k>=2 is an integer, is a (k-1)-tuple (C"1,C"2,...,C"k"-"1) such that C"i is the bisector of C"i"-"1 and C"i"+"1 for every i=1,2,...,k-1, where C"0=P and C"k=Q. This notion, for the case where P and Q are points in R^2, was introduced by Asano, Matousek, and Tokuyama, motivated by a question of Murata in VLSI design. They established the existence and uniqueness of the distance 3-sector in this special case. We prove the existence of a distance k-sector for all k and for every two disjoint, nonempty, closed sets P and Q in Euclidean spaces of any (finite) dimension (uniqueness remains open), or more generally, in proper geodesic spaces. The core of the proof is a new notion of k-gradation for P and Q, whose existence (even in an arbitrary metric space) is proved using the Knaster-Tarski fixed point theorem, by a method introduced by Reem and Reich for a slightly different purpose.

Connected through hyperedge HE-1 (induced by source paper "on the computation of zone and double zone diagrams"):
  with members:
    - "on the possibility of simple parallel computing of voronoi diagrams and delaunay graphs"
    - "the projector algorithm a simple parallel algorithm for computing voronoi diagrams and delaunay graphs"
    - "the geometric stability of voronoi diagrams in normed spaces which are not uniformly convex"
    - "zone diagrams in euclidean spaces and in other normed spaces"
    - "the geometric stability of voronoi diagrams with respect to small changes of the sites"

Connected through hyperedge HE-2 (induced by source paper "complexity theory for operators in analysis"):
  with members:
    - "computational complexity of smooth differential equations"
    - "zone diagrams in euclidean spaces and in other normed spaces"
    - "lipschitz continuous ordinary differential equations are polynomial space complete"
    - "on the complexity of real functions"

Connected through hyperedge HE-3 (induced by source paper "the geometric stability of voronoi diagrams in normed spaces which are not uniformly convex"):
  with members:
    - "on the computation of zone and double zone diagrams"
    - "kinetic stable delaunay graphs"
    - "the geometric stability of voronoi diagrams with respect to small changes of the sites"

Connected through hyperedge HE-4 (induced by source paper "on the existence of a neutral region"):
  with members:
    - "zone diagrams in euclidean spaces and in other normed spaces"
    - "the geometric stability of voronoi diagrams with respect to small changes of the sites"

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)