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 secure multi user downlink miso urllc systems"):
  Abstract: In this paper, we study resource allocation algorithm design for secure multi-user downlink ultra-reliable low latency communication (URLLC). To enhance physical layer security (PLS), the base station (BS) is equipped with multiple antennas and artificial noise (AN) is injected by the BS to impair the eavesdroppers' channels. To meet the stringent delay requirements in secure URLLC systems, short packet transmission (SPT) is adopted and taken into consideration for resource allocation design. The resource allocation algorithm design is formulated as an optimization problem for minimization of the total transmit power, while guaranteeing quality-of-service (QoS) constraints regarding the URLLC users' number of transmitted bits, packet error probability, information leakage, and delay. Due to the non-convexity of the optimization problem, finding a global solution entails a high computational complexity. Thus, we propose a low-complexity algorithm based successive convex approximation (SCA) to find a sub-optimal solution. Our simulation results show that the proposed resource allocation algorithm design ensures the secrecy of the URLLC users' transmissions, and yields significant power savings compared to a baseline scheme.

Includes members:
  Member "secure short packet communications for mission critical iot applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "recursive optimization of finite blocklength allocation to mitigate age of information outage")
  Member "resource allocation for multi user downlink miso ofdma urllc systems":
    also connected through other hyperedges:
      (none)
  Member "resource allocation for multi user downlink urllc ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "ultra reliable and low latency wireless communication tail risk and scale":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimized age of information tail for ultra reliable low latency communications in vehicular networks")
  Member "robust and secure resource allocation for full duplex miso multicarrier noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "wiretap channels nonasymptotic fundamental limits":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication for generating correlation a unifying survey")
  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 "saddlepoint approximations for short packet wireless communications")
  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")

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)