human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "resource allocation for secure multi user downlink miso urllc systems"):
  with members:
    - "resource allocation for multi user downlink miso ofdma urllc systems"
    - "resource allocation for multi user downlink urllc ofdma systems"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "robust and secure resource allocation for full duplex miso multicarrier noma systems"
    - "wiretap channels nonasymptotic fundamental limits"
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"

Connected through hyperedge HE-2 (induced by source paper "recursive optimization of finite blocklength allocation to mitigate age of information outage"):
  with members:
    - "real time remote estimation with hybrid arq in wireless networked control"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "julia a fresh approach to numerical computing"
    - "policy iteration for factored mdps"

Connected through hyperedge HE-3 (induced by source paper "saddlepoint approximations for short packet wireless communications"):
  with members:
    - "efficient error correcting codes in the short blocklength regime"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "5g wireless network slicing for embb urllc and mmtc a communication theoretic view"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "joint sum rate and error probability optimization finite blocklength analysis"
    - "coherent multiple antenna block fading channels at finite blocklength"
    - "on single antenna rayleigh block fading channels at finite blocklength"
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"

Connected through hyperedge HE-4 (induced by source paper "finite blocklength allocation towards robust age of information optimization"):
  with members:
    - "real time remote estimation with hybrid arq in wireless networked control"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "energy latency tradeoff in ultra reliable low latency communication with retransmissions"
    - "wirelessly powered communication networks with short packets"
    - "julia a fresh approach to numerical computing"
    - "policy iteration for factored mdps"

Question: Please tell me which class the center node 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)