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 "secure short packet communications for mission critical iot applications"):
  Abstract: In pervasive Internet of Things (IoT) applications, the use of short packets is expected to meet the stringent latency requirement in ultra-reliable low-latency communications; however, the incurred security issues and the impact of finite blocklength coding on the physical-layer security have not been well understood. This paper comprehensively investigates the performance of secure short-packet communications in a mission-critical IoT system with an external multi-antenna eavesdropper. An analytical framework is proposed to approximate the average achievable secrecy throughput of the system with finite blocklength coding. To gain more insight, a simple case with a single-antenna access point (AP) is considered first, in which the secrecy throughput is approximated in a closed form. Based on that result, the optimal blocklengths to maximize the secrecy throughput with and without the reliability and latency constraints, respectively, are derived. For the case with a multi-antenna AP, following the proposed analytical framework, closed-form approximations for the secrecy throughput are obtained under both beamforming and artificial-noise-aided transmission schemes. Numerical results verify the accuracy of the proposed approximations and illustrate the impact of the system parameters on the tradeoff between transmission latency and reliability under the secrecy constraint.

Includes members:
  Member "short packet downlink transmission with non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "wiretap channels nonasymptotic fundamental limits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resource allocation for secure multi user downlink miso urllc systems")
  Member "joint sum rate and error probability optimization finite blocklength analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an energy efficient controller for wirelessly powered communication networks")
  Member "finite blocklength bounds for wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "massive machine type communications in 5g physical and mac layer solutions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "principles of physical layer security in multiuser wireless networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "ultra reliable communication in 5g wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")

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)