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: "tolerance analysis by polytopes"
  Abstract: To determine the relative position of any two surfaces in a system, one approach is to use operations (Minkowski sum and intersection) on sets of constraints. These constraints are made compliant with half-spaces of R n where each set of half-spaces defines an operand polyhedron. These operands are generally unbounded due to the inclusion of degrees of invariance for surfaces and degrees of freedom for joints defining theoretically unlimited displacements. To solve operations on operands, Minkowski sums in particular, "cap" half-spaces are added to each polyhedron to make it compliant with a polytope which is by definition a bounded polyhedron. The difficulty of this method lies in controlling the influence of these additional half-spaces on the topology of polytopes calculated by sum or intersection. This is necessary to validate the geometric tolerances that ensure the compliance of a mechanical system in terms of functional requirements. In tolerance analysis, sets of constraints can be compliant with operand polyhedra.These operands are generally unbounded due to the inclusion of degrees of freedom.Cap half-spaces are added to each polyhedron to make it compliant with a polytope.The influence of the cap half-spaces on the topology of polytopes must be controlled.It is necessary to ensure the compliance of a mechanism in terms of requirements.

Connected through hyperedge HE-1 (induced by source paper "adapting polytopes dimension for managing degrees of freedom in tolerancing analysis"):
  with members:
    - "minkowski sum of hv polytopes in rn"

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)