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: "on order types of random point sets"
  Abstract: Let $P$ be a set of $n$ random points chosen uniformly in the unit square. In this paper, we examine the typical resolution of the order type of $P$. First, we show that with high probability, $P$ can be rounded to the grid of step $\frac{1}{n^{3+\epsilon}}$ without changing its order type. Second, we study algorithms for determining the order type of a point set in terms of the the number of coordinate bits they require to know. We give an algorithm that requires on average $4n \log_2 n + O(n)$ bits to determine the order type of $P$, and show that any algorithm requires at least $4n \log_2 n − O(n \log \log n)$ bits. Both results extend to more general models of random point sets.

Connected through hyperedge HE-1 (induced by source paper "chirotopes of random points in space are realizable on a small integer grid"):
  with members:
    - "subquadratic encodings for point configurations"

Connected through hyperedge HE-2 (induced by source paper "a framework for robust realistic geometric computations"):
  with members:
    - "chirotopes of random points in space are realizable on a small integer grid"
    - "smoothed analysis of order types"
    - "optimal curve straightening is exists mathbb r complete"
    - "beyond worst case analysis"
    - "the complexity of drawing a graph in a polygonal region"
    - "on the complexity of minimum link path problems"
    - "recognition and complexity of point visibility graphs"
    - "convex hull of points lying on lines in o nlogn time after preprocessing"

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)