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: "maximal parallelograms in convex polygons"
  Abstract: Given a convex polygon $P$ of $n$ vertices in the plane, we consider the problem of finding the maximum area parallelogram (MAP) inside $P$. Previously, the best algorithm for this problem runs in time $O(n^2)$, and this was achieved by utilizing some nontrivial properties of the MAP. In this paper, we exhibit an algorithm for finding the MAP in time $O(n\log^2n)$, greatly improving the previous result. The main technical ingredient of our algorithm is a new geometric structure of a convex polygon $P$, which we call $Nest(P)$. Roughly speaking, $Nest(P)$ is an arrangement of certain line segments, each of which is parallel to an edge of $P$. It enjoys several nice properties, e.g., it is a planar division over the exterior of $P$, and one natural subdivision of it has a monotone property with the boundary of $P$. Indeed, $Nest(P)$ captures the essential nature of the MAPs; we reduce the optimization problem of finding the MAPs in $P$ to a location query problem comprising $O(n)$ basic location queries about $Nest(P)$. Each of these queries can be solved in $O(\log^2n)$ time without building $Nest(P)$ explicitly. Putting these together we obtain an $O(n\log^2n)$-time algorithm. #R##N#We believe that the techniques developed in this paper will be useful for solving other related problems, and the structure $Nest(P)$ is of independent interest in convex geometry.

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)