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 "delay aware uplink fronthaul allocation in cloud radio access networks"):
  Abstract: In cloud radio access networks (C-RANs), the baseband units and radio units of base stations are separated, which requires high-capacity fronthaul links connecting both parts. In this paper, we consider the delay-aware fronthaul allocation problem for C-RANs. The stochastic optimization problem is formulated as an infinite horizon average cost Markov decision process. To deal with the curse of dimensionality, we derive a closed-form approximate priority function and the associated error bound using perturbation analysis. Based on the closed-form approximate priority function, we propose a low-complexity delay-aware fronthaul allocation algorithm solving the per-stage optimization problem. The proposed solution is further shown to be asymptotically optimal for sufficiently small cross link path gains. Finally, the proposed fronthaul allocation algorithm is compared with various baselines through simulations, and it is shown that significant performance gain can be achieved.

Includes members:
  Member "dynamic power control for delay aware device to device communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "unified scheduling for predictable communication reliability in cellular networks with d2d links")
  Member "full duplex cloud radio access networks an information theoretic viewpoint":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance of network assisted full duplex for cell free massive mimo")
  Member "optimized backhaul compression for uplink cloud radio access network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "joint power control and fronthaul rate allocation for throughput maximization in ofdma based cloud radio access network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fronthaul compression and precoding design for c rans over ergodic fading channels")
  Member "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm")
  Member "multihop backhaul compression for the uplink of cloud radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust regularized zf in cooperative broadcast channel under distributed csit")
  Member "a survey on delay aware resource control for wireless systems large deviation theory stochastic lyapunov drift and distributed stochastic learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "queue aware dynamic clustering and power allocation for network mimo systems via distributed stochastic learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dynamic resource allocation in co located and cell free massive mimo")

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.IT(Information Theory)