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 "ultra reliable communication via optimum power allocation for type i arq in finite block length"):
  Abstract: We analyze the performance of the type-I automatic repeat request (ARQ) protocol with ultra-reliability constraints. First, we show that achieving a very low packet outage probability by using an open loop setup is a difficult task. Thus, we introduce the ARQ protocol as a solution for achieving the required low outage probabilities for ultra reliable communication. For this protocol, we present an optimal power allocation scheme that would allow us to reach any outage probability target in the finite block-length regime. We formulate the power allocation problem as minimization of the average transmitted power under a given outage probability and maximum transmit power constraint. By utilizing the Karush-Kuhn-Tucker (KKT) conditions, we solve the optimal power allocation problem and provide a closed form solution. Next, we analyze the effect of implementing the ARQ protocol on the throughput. We show that by using the proposed power allocation scheme we can minimize the loss of throughput that is caused from the retransmissions. Furthermore, we analyze the effect of the feedback delay length in our scheme.

Includes members:
  Member "understanding the iot connectivity landscape a contemporary m2m radio technology roadmap":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a novel communication paradigm for high capacity and security via programmable indoor wireless environments in next generation wireless systems")
  Member "energy efficient adaptive power allocation for incremental mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "green communication via type i arq finite block length analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "ultra reliable communication in 5g wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "quasi static multiple antenna fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)