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 "reduced and aggregated distribution grid representations approximated by polyhedral sets"):
  Abstract: In this paper we present a novel tractable method to compute reduced and aggregated distribution grid representations that provide an interface in the form of active and reactive power (PQ) capability areas for improving transmission service operator - distribution service operator (TSO-DSO) interactions. Based on a lossless linear power flow approximation we derive polyhedral sets to determine a reduced PQ operating region capturing all voltage magnitude and branch power flow constraints of the entire distribution grid. To demonstrate the usefulness of our method, we compare the capability area obtained from the polyhedral approximation with an area generated by multiple optimal power flow (OPF) solutions for different distribution grids. While the approximation errors are reasonable, especially for low voltage (LV) grids, the computational complexity to compute the PQ capability area can be significantly reduced with our proposed method.

Includes members:
  Member "linear quadratic programming based optimal power flow using linear power flow and absolute loss approximations":
    also connected through other hyperedges:
      (none)
  Member "pandapower an open source python tool for convenient modeling analysis and optimization of electric power systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "methods for actors in the electric power system to prevent detect and react to ict attacks and failures")

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)