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: "minimizing energy consumption and peak power of series elastic actuators a convex optimization framework for elastic element design"
  Abstract: Compared to rigid actuators, Series Elastic Actuators (SEAs) offer a potential reduction of motor energy consumption and peak power, though these benefits are highly dependent on the design of the torque-elongation profile of the elastic element. In the case of linear springs, natural dynamics is a traditional method for this design, but it has two major limitations: arbitrary load trajectories are difficult or impossible to analyze and it does not consider actuator constraints. Parametric optimization is also a popular design method that addresses these limitations, but solutions are only optimal within the space of the parameters. To overcome these limitations, we propose a non-parametric convex optimization program for the design of the nonlinear elastic element that minimizes energy consumption and peak power for an arbitrary periodic reference trajectory. To obtain convexity, we introduce a convex approximation to the expression of peak power; energy consumption is shown to be convex without approximation. The combination of peak power and energy consumption in the cost function leads to a multiobjective convex optimization framework that comprises the main contribution of this paper. As a case study, we recover the elongation-torque profile of a cubic spring, given its natural oscillation as the reference load. We then design nonlinear SEAs for an ankle prosthesis that minimize energy consumption and peak power for different trajectories and extend the range of achievable tasks when subject to actuator constraints.

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.RO(Robotics)