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 order types"):
  Abstract: Consider an ordered point set $P = (p_1,\ldots,p_n)$, its order type (denoted by $\chi_P$) is a map which assigns to every triple of points a value in $\{+,-,0\}$ based on whether the points are collinear(0), oriented clockwise(-) or counter-clockwise(+). An abstract order type is a map $\chi : \left[\substack{n\\3}\right] \rightarrow \{+,-,0\}$ (where $\left[\substack{n\\3}\right]$ is the collection of all triples of a set of $n$ elements) that satisfies the following condition: for every set of five elements $S\subset [n]$ its induced order type $\chi_{|S}$ is realizable by a point set. To be precise, a point set $P$ realizes an order type $\chi$,if $\chi_P(p_i,p_j,p_k) = \chi(i,j,k)$, for all $i<j<k$. Planar point sets are among the most basic and natural geometric objects of study in Discrete and Computational Geometry. Properties of point sets are relevant in theory and practice alike. It is known, that deciding if an abstract order type is realizable is complete for the existential theory of the reals. Our results show that order type realizability is much easier for realistic instances than in the worst case. In particular, we can recognize instances in "expected \NP-time". This is one of the first $\exists\mathbb{R}$-complete problems analyzed under the lens of Smoothed Analysis.

Includes members:
  Member "smoothed analysis of the art gallery problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a universality theorem for nested polytopes")
  Member "beyond worst case analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (induced by source paper "beyond worst case analysis")
  Member "intersection graphs of rays and grounded segments":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "recognizing stick graphs with and without length constraints")
  Member "the complexity of tensor rank":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "variety membership testing algebraic natural proofs and geometric complexity theory")
  Member "recognition and complexity of point visibility graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "drawing graphs as spanners")
  Member "intersection graphs of segments and exists mathbb r":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "computing exact solutions of consensus halving and the borsuk ulam theorem")

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)