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: "minkowski sum of polytopes defined by their vertices"
  Abstract: Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in [1]. Our approach is based on the use of linear programming and is solvable in polynomial time. The algorithm we developed can be implemented and parallelized in a very easy way.

Connected through hyperedge HE-1 (induced by source paper "robust estimation prediction and control with linear dynamics and generic costs"):
  with members:
    - "interval prediction for continuous time systems with parametric uncertainties"
    - "learning based control of unknown linear systems with thompson sampling"
    - "end to end training of deep visuomotor policies"

Connected through hyperedge HE-2 (induced by source paper "feasible region an actuation aware extension of the support region"):
  with members:
    - "heuristic planning for rough terrain locomotion in presence of external disturbances and variable perception quality"
    - "application of wrench based feasibility analysis to the online trajectory optimization of legged robots"
    - "dynamic walking over rough terrains by nonlinear predictive control of the floating base inverted pendulum"
    - "when to make a step tackling the timing problem in multi contact locomotion by topp mpc"
    - "structured contact force optimization for kino dynamic motion generation"
    - "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)