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 "smoothed analysis of the art gallery problem"):
  Abstract: In the Art Gallery Problem we are given a polygon $P\subset [0,L]^2$ on $n$ vertices and a number $k$. We want to find a guard set $G$ of size $k$, such that each point in $P$ is seen by a guard in $G$. Formally, a guard $g$ sees a point $p \in P$ if the line segment $pg$ is fully contained inside the polygon $P$. The history and practical findings indicate that irrational coordinates are a "very rare" phenomenon. We give a theoretical explanation. Next to worst case analysis, Smoothed Analysis gained popularity to explain the practical performance of algorithms, even if they perform badly in the worst case. The idea is to study the expected performance on small perturbations of the worst input. The performance is measured in terms of the magnitude $\delta$ of the perturbation and the input size. We consider four different models of perturbation. We show that the expected number of bits to describe optimal guard positions per guard is logarithmic in the input and the magnitude of the perturbation. This shows from a theoretical perspective that rational guards with small bit-complexity are typical. Note that describing the guard position is the bottleneck to show NP-membership. The significance of our results is that algebraic methods are not needed to solve the Art Gallery Problem in typical instances. This is the first time an $\exists\mathbb{R}$-complete problem was analyzed by Smoothed Analysis.

Includes members:
  Member "beyond worst case analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "escaping cannibalization correlation robust pricing for a unit demand buyer")
  Member "the complexity of drawing a graph in a polygonal region":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a framework for robust realistic geometric computations")
  Member "a friendly smoothed analysis of the simplex method":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "smoothed analysis of order types")
  Member "constant approximation algorithms for guarding simple polygons using vertex guards":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the parameterized complexity of guarding almost convex polygons")
  Member "irrational guards are sometimes needed":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the parameterized complexity of guarding almost convex polygons")
  Member "intersection graphs of rays and grounded segments":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "recognizing stick graphs with and without length constraints")
  Member "an approximation algorithm for the art gallery problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the parameterized complexity of guarding almost convex polygons")
  Member "the continuous 1 5d terrain guarding problem discretization optimal solutions and ptas":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a constant factor approximation algorithm for vertex guarding a wv polygon")

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)