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: "minimum energy to send k bits over multiple antenna fading channels"
  Abstract: This paper investigates the minimum energy required to transmit $k$ information bits with a given reliability over a multiple-antenna Rayleigh block-fading channel, with and without channel state information (CSI) at the receiver. No feedback is assumed. It is well known that the ratio between the minimum energy per bit and the noise level converges to $-1.59$ dB as $k$ goes to infinity, regardless of whether CSI is available at the receiver or not. This paper shows that lack of CSI at the receiver causes a slowdown in the speed of convergence to $-1.59$ dB as $k\to\infty$ compared to the case of perfect receiver CSI. Specifically, we show that, in the no-CSI case, the gap to $-1.59$ dB is proportional to $((\log k) /k)^{1/3}$, whereas when perfect CSI is available at the receiver, this gap is proportional to $1/\sqrt{k}$. In both cases, the gap to $-1.59$ dB is independent of the number of transmit antennas and of the channel's coherence time. Numerically, we observe that, when the receiver is equipped with a single antenna, to achieve an energy per bit of $ - 1.5$ dB in the no-CSI case, one needs to transmit at least $7\times 10^7$ information bits, whereas $6\times 10^4$ bits suffice for the case of perfect CSI at the receiver.

Connected through hyperedge HE-1 (induced by source paper "joint power control and rate allocation enabling ultra reliability and energy efficiency in simo wireless networks"):
  with members:
    - "distributed rate control in downlink noma networks with reliability constraints"
    - "rate control under finite blocklength for downlink cellular networks with reliability constraints"
    - "distributed optimization for energy efficient fog computing in the tactile internet"
    - "energy latency tradeoff in ultra reliable low latency communication with retransmissions"
    - "joint uplink and downlink resource configuration for ultra reliable and low latency communications"
    - "ultra reliable and low latency communications in 5g downlink physical layer aspects"
    - "ultra reliable cooperative short packet communications with wireless energy transfer"
    - "on the effective energy efficiency of ultra reliable networks in the finite blocklength regime"

Connected through hyperedge HE-2 (induced by source paper "rate control under finite blocklength for downlink cellular networks with reliability constraints"):
  with members:
    - "ultra reliable and low latency communications in 5g downlink physical layer aspects"
    - "ultra reliable cooperative short packet communications with wireless energy transfer"
    - "ultra reliable short message cooperative relaying protocols under nakagami m fading"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-3 (induced by source paper "coherent multiple antenna block fading channels at finite blocklength"):
  with members:
    - "a beta beta achievability bound with applications"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "optimum power control at finite blocklength"
    - "bounds on the second order coding rate of the mimo rayleigh block fading channel"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "diversity versus channel knowledge at finite block length"

Connected through hyperedge HE-4 (induced by source paper "beta beta bounds finite blocklength analog of the golden formula"):
  with members:
    - "simple channel coding bounds"

Connected through hyperedge HE-5 (induced by source paper "joint source channel coding with feedback"):
  with members:
    - "joint source channel coding with feedback extended"
    - "asymptotic expansions for gaussian channels with feedback under a peak power constraint"
    - "variable length compression allowing errors extended"
    - "variable length compression allowing errors"
    - "active sequential hypothesis testing"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "fixed length lossy compression in the finite blocklength regime"
    - "information theoretic viewpoints on optimal causal coding decoding problems"

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)