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: "joint sum rate and error probability optimization finite blocklength analysis"
  Abstract: We study the tradeoff between the sum rate and the error probability in downlink of wireless networks. Using the recent results on the achievable rates of finite-length codewords, the problem is cast as a joint optimization of the network sum rate and the per-user error probability. We develop an efficient algorithm based on the divide-and-conquer technique to simultaneously maximize the network sum rate and minimize the maximum users’ error probability and to evaluate the effect of the codeword length on the system performance. The results show that, in delay-constrained scenarios, optimizing the per-user error probability plays a key role in achieving high throughput.

Connected through hyperedge HE-1 (induced by source paper "an energy efficient controller for wirelessly powered communication networks"):
  with members:
    - "swipt using hybrid arq over time varying channels"
    - "optimal and near optimal policies for wireless power transfer in energy limited and power limited scenarios"
    - "joint transfer of energy and information in a two hop relay channel"
    - "optimal energy and data routing in networks with energy cooperation"
    - "battery powered devices in wpcns"
    - "wireless powered relaying with finite block length codes"
    - "on wireless energy and information transfer in relay networks"
    - "communications and signals design for wireless power transmission"

Connected through hyperedge HE-2 (induced by source paper "saddlepoint approximations for short packet wireless communications"):
  with members:
    - "secure short packet communications for mission critical iot applications"
    - "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"
    - "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-3 (induced by source paper "secure short packet communications for mission critical iot applications"):
  with members:
    - "short packet downlink transmission with non orthogonal multiple access"
    - "wiretap channels nonasymptotic fundamental limits"
    - "finite blocklength bounds for wiretap channels"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "finite block length analysis of the incremental redundancy harq"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "ultra reliable communication in 5g wireless systems"
    - "non asymptotic output statistics of random binning and its applications"

Connected through hyperedge HE-4 (induced by source paper "resource allocation for multi user downlink miso ofdma urllc systems"):
  with members:
    - "resource allocation for multi user downlink urllc ofdma systems"
    - "energy latency tradeoff in ultra reliable low latency communication with retransmissions"
    - "robust and secure resource allocation for full duplex miso multicarrier noma systems"
    - "cross layer optimization for ultra reliable and low latency radio access networks"
    - "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"
    - "ultra reliable communication in 5g wireless systems"

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)