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 "green communication via type i arq finite block length analysis"):
  Abstract: This paper studies the effect of optimal power allocation on the performance of communication systems utilizing automatic repeat request (ARQ). Considering Type-I ARQ, the problem is cast as the minimization of the outage probability subject to an average power constraint. The analysis is based on some recent results on the achievable rates of finite-length codes and we investigate the effect of codewords length on the performance of ARQ-based systems. We show that the performance of ARQ protocols is (almost) insensitive to the length of the codewords, for codewords of length $\ge 50$ channel uses. Also, optimal power allocation improves the power efficiency of the ARQ-based systems substantially. For instance, consider a Rayleigh fading channel, codewords of rate 1 nats-per-channel-use and outage probability $10^{-3}.$ Then, with a maximum of 2 and 3 transmissions, the implementation of power-adaptive ARQ reduces the average power, compared to the open-loop communication setup, by 17 and 23 dB, respectively, a result which is (almost) independent of the codewords length. Also, optimal power allocation increases the diversity gain of the ARQ protocols considerably.

Includes members:
  Member "green communication via power optimized harq protocols":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast harq over finite blocklength codes a technique for low latency reliable communication")
  Member "on noisy arq in block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "balance queueing and retransmission latency optimal massive mimo design")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "quasi static simo fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "fundamental tradeoffs on green wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal linear precoding in multi user mimo systems a large system analysis")
  Member "performance of hybrid arq in block fading channels a fixed outage probability analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)