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: "optimal placement and sizing of distributed battery storage in low voltage grids using receding horizon control strategies"
  Abstract: In this paper, we present a novel methodology for leveraging Receding Horizon Control, also known as Model Predictive Control (MPC) strategies for distributed battery storage in a planning problem using a Benders decomposition technique. Longer prediction horizons lead to better storage placement strategies but also higher computational complexity that can quickly become computationally prohibitive. The MPC strategy proposed here in conjunction with a Benders decomposition technique effectively reduces the computational complexity to a manageable level. We use the CIGRE low voltage benchmark grid as a case study for solving an optimal placement and sizing problem for different control strategies with different MPC prediction horizons. The objective of the MPC strategy is to maximize the photovoltaic utilization and minimize battery degradation in a local residential area, while satisfying all grid constraints. For this case study, we show that the economic value of battery storage is higher when using MPC-based storage control strategies than when using heuristic storage control strategies, because MPC strategies explicitly exploit the value of forecast information. The economic merit of this approach can be further increased by explicitly incorporating a battery degradation model in the MPC strategy.

Connected through hyperedge HE-1 (induced by source paper "battery degradation maps for power system optimization and as a benchmark reference"):
  with members:
    - "modeling and optimal operation of distributed battery storage in low voltage grids"

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.SY(Systems and Control)