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 "towards optimality preserving aggregation for scheduling distributed energy resources"):
  Abstract: Scheduling the power exchange between a population of heterogeneous distributed energy resources and the corresponding upper-level system is an important control problem in power systems. A key challenge is the large number of (partially uncertain) parameters and decision variables that increase the computational burden and that complicate the structured consideration of uncertainties. Reducing the number of decision variables by means of aggregation can alleviate these issues. However, despite the frequent use of aggregation for storage, few works in the literature provide formal justification. In the present paper, we investigate aggregation of heterogeneous (storage) devices with time-varying power and energy constraints. In particular, we propose mild conditions on the constraints of each device guaranteeing the applicability of an aggregated model in scheduling without any loss of optimality in comparison to the complete problem. We conclude with a discussion of limitations and possible extensions of our findings.

Includes members:
  Member "robustly maximal utilisation of energy constrained distributed resources":
    also connected through other hyperedges:
      (none)
  Member "achieving the dispatchability of distribution feeders through prosumers data driven forecasting and model predictive control of electrochemical storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reliable dispatch of renewable generation via charging of dynamic pev populations")

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