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: "a linear time algorithm for the geodesic center of a simple polygon"
  Abstract: Given two points in a simple polygon $P$ of $n$ vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within $P$. The geodesic center of $P$ is the unique point in $P$ that minimizes the largest geodesic distance to all other points of $P$. In 1989, Pollack, Sharir and Rote [Disc. \& Comput. Geom. 89] showed an $O(n\log n)$-time algorithm that computes the geodesic center of $P$. Since then, a longstanding question has been whether this running time can be improved (explicitly posed by Mitchell [Handbook of Computational Geometry, 2000]). In this paper we affirmatively answer this question and present a linear time algorithm to solve this problem.

Connected through hyperedge HE-1 (induced by source paper "a time space trade off for computing the geodesic center of a simple polygon"):
  with members:
    - "computational geometry column 67"
    - "a new balanced subdivision of a simple polygon for time space trade off algorithms"
    - "shortest path in a polygon using sublinear space"

Connected through hyperedge HE-2 (induced by source paper "geodesic farthest point voronoi diagram in linear time"):
  with members:
    - "computing a geodesic two center of points in a simple polygon"
    - "voronoi diagrams for a moderate sized point set in a simple polygon"
    - "detecting weakly simple polygons"

Connected through hyperedge HE-3 (induced by source paper "the geodesic farthest point voronoi diagram in a simple polygon"):
  with members:
    - "voronoi diagrams for a moderate sized point set in a simple polygon"

Connected through hyperedge HE-4 (induced by source paper "the geodesic 2 center problem in a simple polygon"):
  with members:
    - "on the geodesic centers of polygonal domains"
    - "detecting weakly simple polygons"
    - "packing and covering a polygon with geodesic disks"

Connected through hyperedge HE-5 (induced by source paper "on the geodesic centers of polygonal domains"):
  with members:
    - "computing the geodesic centers of a polygonal domain"
    - "the geodesic diameter of polygonal domains"

Connected through hyperedge HE-6 (induced by source paper "computing the geodesic centers of a polygonal domain"):
  with members:
    - "the geodesic diameter of polygonal domains"

Connected through hyperedge HE-7 (induced by source paper "diffuse reflection radius in a simple polygon"):
  with members:
    - "an algorithm for computing constrained reflection paths in simple polygon"
    - "computing the l_1 geodesic diameter and center of a simple polygon in linear time"
    - "weak visibility queries of line segments in simple polygons"

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)