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 "finite block length analysis of the incremental redundancy harq"):
  Abstract: This letter studies the power-limited throughput of a communication system utilizing incremental redundancy (INR) hybrid automatic repeat request (HARQ). We use some recent results on the achievable rates of finite-length codes to analyze the system performance. With codewords of finite length, we derive closed-form expressions for the outage probabilities of INR HARQ and study the throughput in the cases with variable-length coding. Moreover, we evaluate the effect of feedback delay on the throughput and derive sufficient conditions for the usefulness of the HARQ protocols, in terms of power-limited throughput. The results show that, for a large range of HARQ feedback delays, the throughput is increased by finite-length coding INR HARQ, if the sub-codeword lengths are properly adapted.

Includes members:
  Member "green communication via type i arq finite block length analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "quasi static simo fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint power control and rate allocation enabling ultra reliability and energy efficiency in simo wireless networks")
  Member "quasi static multiple antenna fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robust urllc packet scheduling of ofdm systems")

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)