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 "resource allocation for multi user downlink miso ofdma urllc systems"):
  Abstract: This paper considers the resource allocation algorithm design for downlink multiple-input single-output (MISO) orthogonal frequency division multiple access (OFDMA) ultra-reliable low latency communication (URLLC) systems. To meet the stringent delay requirements of URLLC, short packet transmission is adopted and taken into account for resource allocation algorithm design. The resource allocation is optimized for maximization of the weighted system sum throughput subject to quality-of-service (QoS) constraints regarding the URLLC users' number of transmitted bits, packet error probability, and delay. Despite the non-convexity of the resulting optimization problem, the optimal solution is found via monotonic optimization. The corresponding optimal resource allocation policy can serve as a performance upper bound for sub-optimal low-complexity solutions. We develop such a low-complexity resource allocation algorithm to strike a balance between performance and complexity. Our simulation results reveal the importance of using multiple antennas for reducing the latency and improving the reliability of URLLC systems. Moreover, the proposed sub-optimal algorithm is shown to closely approach the performance of the proposed optimal algorithm and outperforms two baseline schemes by a considerable margin, especially when the users have heterogeneous delay requirements. Finally, conventional resource allocation designs based on Shannon's capacity formula are shown to be not applicable in MISO OFDMA-URLLC systems as they may violate the users' delay constraints.

Includes members:
  Member "resource allocation for multi user downlink urllc ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "energy latency tradeoff in ultra reliable low latency communication with retransmissions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback")
  Member "robust and secure resource allocation for full duplex miso multicarrier noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "joint sum rate and error probability optimization finite blocklength analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an energy efficient controller for wirelessly powered communication networks")
  Member "cross layer optimization for ultra reliable and low latency radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "resource allocation for secure multi user downlink miso urllc systems")
  Member "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed federated learning for ultra reliable low latency vehicular communications")

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)