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 "searching for a compressed polyline with a minimum number of vertices discrete solution"):
  Abstract: There are many practical applications that require the simplification of polylines. Some of the goals are to reduce the amount of information, improve processing time, or simplify editing. Simplification is usually done by removing some of the vertices, making the resultant polyline go through a subset of the source polyline vertices. If the resultant polyline is required to pass through original vertices, it often results in extra segments, and all segments are likely to be shifted due to fixed endpoints. Therefore, such an approach does not necessarily produce a new polyline with the minimum number of vertices. Using an algorithm that finds the compressed polyline with the minimum number of vertices reduces the amount of memory required and the postprocessing time. However, even more important, when the resultant polylines are edited by an operator, the polylines with the minimum number of vertices decrease the operator time, which reduces the cost of processing the data. A viable solution to finding a polyline within a specified tolerance with the minimum number of vertices is described in this paper.

Includes members:
  Member "optimal compression of a polyline with segments and arcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polyline defined nc trajectories parametrization a compact analysis and solution focused on 3d printing")
  Member "on the expected complexity of random convex hulls":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "convex hulls of random order types")

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)