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 "convex relaxations of probabilistic ac optimal power flow for interconnected ac and hvdc grids"):
  Abstract: High voltage direct current (HVDC) systems interconnect ac grids to increase reliability, connect offshore wind generation, and enable coupling of electricity markets. Considering the growing uncertainty in power infeed and the complexity introduced by additional controls, robust decision support tools are necessary. This paper proposes a chance constrained ac optimal power flow (AC-OPF) for ac and HVDC grids, which considers wind uncertainty, fully utilizes HVDC control capabilities, and uses the semidefinite relaxation of the AC-OPF. We consider a joint chance constraint for both ac and HVDC systems, we introduce a piecewise affine approximation to achieve the tractability of the chance constraint, and we allow corrective control policies for HVDC converters and generators to be determined. An active loss penalty term in the objective function and a systematic procedure to choose the penalty weights allow us to obtain ac-feasible solutions. We introduce Benders decomposition to maintain the scalability. Using realistic forecast data, we demonstrate our approach on a 53-bus and a 214-bus ac–dc systems, obtaining tight near-global optimality guarantees. With a Monte Carlo analysis, we show that a chance-constrained dc optimal power flow leads to violations, whereas our proposed approach complies with the joint chance constraint.

Includes members:
  Member "convex relaxations and approximations of chance constrained ac opf problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "chance constrained ac optimal power flow integrating hvdc lines and controllability")
  Member "convex relaxations of chance constrained ac optimal power flow":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "chance constrained ac optimal power flow a polynomial chaos approach")

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)