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: "energy efficiency of fixed rate wireless transmissions under queueing constraints and channel uncertainty"
  Abstract: Energy efficiency of fixed-rate transmissions is studied in the presence of queueing constraints and channel uncertainty. It is assumed that neither the transmitter nor the receiver has channel side information prior to transmission. The channel coefficients are estimated at the receiver via minimum mean-square-error (MMSE) estimation with the aid of training symbols. It is further assumed that the system operates under statistical queueing constraints in the form of limitations on buffer violation probabilities. The optimal fraction of of power allocated to training is identified. Spectral efficiency--bit energy tradeoff is analyzed in the low-power and wideband regimes by employing the effective capacity formulation. In particular, it is shown that the bit energy increases without bound in the low-power regime as the average power vanishes. On the other hand, it is proven that the bit energy diminishes to its minimum value in the wideband regime as the available bandwidth increases. For this case, expressions for the minimum bit energy and wideband slope are derived. Overall, energy costs of channel uncertainty and queueing constraints are identified.

Connected through hyperedge HE-1 (induced by source paper "performance analysis of ultra reliable short message decode and forward relaying protocols"):
  with members:
    - "network slicing for ultra reliable low latency communication in industry 4 0 scenarios"
    - "ultra reliable short message cooperative relaying protocols under nakagami m fading"
    - "on the performance of ultra reliable decode and forward relaying under the finite blocklength"
    - "wireless access for ultra reliable low latency communication urllc principles and building blocks"
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "energy efficient design for tactile internet"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"

Connected through hyperedge HE-2 (induced by source paper "throughput analysis of buffer constrained wireless systems in the finite blocklength regime"):
  with members:
    - "coding versus arq in fading channels how reliable should the phy be"
    - "the impact of qos constraints on the energy efficiency of fixed rate wireless transmissions"
    - "analysis of energy efficiency in fading channels under qos constraints"

Connected through hyperedge HE-3 (induced by source paper "mimo wireless communications under statistical queueing constraints"):
  with members:
    - "the impact of qos constraints on the energy efficiency of fixed rate wireless transmissions"
    - "analysis of energy efficiency in fading channels under qos constraints"
    - "capacity of sparse multipath channels in the ultra wideband regime"
    - "channel uncertainty in ultra wideband communication 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)