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 "energy efficiency of hybrid arq under statistical queuing constraints"):
  Abstract: In this paper, energy efficiency of hybrid automatic repeat request (HARQ) schemes with statistical queuing constraints is studied for both constant-rate and random Markov arrivals by characterizing the minimum energy per bit and wideband slope. The energy efficiency is investigated when either an outage constraint is imposed and (the transmission rate is selected accordingly) or the transmission rate is optimized to maximize the throughput. In both cases, it is also assumed that there is a limitation on the number of retransmissions due to deadline constraints. Under these assumptions, closed-form expressions are obtained for the minimum energy per bit and wideband slope for HARQ with chase combining (CC). Through numerical results, the performances of HARQ-CC and HARQ with incremental redundancy (IR) are compared. Moreover, the impact of source variations/burstiness, deadline constraints, outage probability, queuing constraints on the energy efficiency is analyzed.

Includes members:
  Member "wireless caching technical misconceptions and business barriers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "performance of hybrid arq in block fading channels a fixed outage probability analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback")

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)