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 "risk sensitive optimal control of queues"):
  Abstract: We consider the problem of designing risk-sensitive optimal control policies for scheduling packet transmissions in a stochastic wireless network. A single client is connected to an access point (AP) through a wireless channel. Packet transmission incurs a cost $C$, while packet delivery yields a reward of $R$ units. The client maintains a finite buffer of size $B$, and a penalty of $L$ units is imposed upon packet loss which occurs due to finite queueing buffer. #R##N#We show that the risk-sensitive optimal control policy for such a simple set-up is of threshold type, i.e., it is optimal to carry out packet transmissions only when $Q(t)$, i.e., the queue length at time $t$ exceeds a certain threshold $\tau$. It is also shown that the value of threshold $\tau$ increases upon increasing the cost per unit packet transmission $C$. Furthermore, it is also shown that a threshold policy with threshold equal to $\tau$ is optimal for a set of problems in which cost $C$ lies within an interval $[C_l,C_u]$. Equations that need to be solved in order to obtain $C_l,C_u$ are also provided.

Includes members:
  Member "optimal routing for delay sensitive traffic in overlay networks":
    also connected through other hyperedges:
      (none)
  Member "throughput optimal decentralized scheduling of multi hop networks with end to end deadline constraints unreliable links":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quality of service in multihop wireless networks diffusion approximation")
  Member "index policies for optimal mean variance trade off of inter delivery times in real time sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "closed form whittle s index enabled random access for timely status update")
  Member "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal age energy trade off via sleep wake scheduling")
  Member "capacity and scheduling of access points for multiple live video streams":
    also connected through other hyperedges:
      (none)
  Member "pathwise performance of debt based policies for wireless networks with hard delay constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal information updating based on value of information")

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)