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: "minimum enclosing parallelogram with outliers"
  Abstract: We study the problem of minimum enclosing parallelogram with outliers, which asks to find, for a given set of $n$ planar points, a parallelogram with minimum area that encloses at least $(n-t)$ points, where the remaining points are regarded as outliers. We present an exact algorithm with $O(k^{2}t^{4} + n^2\log n)$ runtime and $O(kt^{2})$ space, assuming that no three points lie on the same line. Here $k=k(n,t)$ denotes the number of points on the first $(t+1)$ convex layers. We further propose an sampling algorithm with runtime $O(n+\mbox{poly}(\log{n}, t, 1/\epsilon))$, which with high probability finds a parallelogram covering at least $(1-\epsilon)(n-t)$ and at most $(n-t+1)$ points with area no more than the exact optimal value.

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)