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: "on noisy arq in block fading channels"
  Abstract: Assuming noisy feedback channels, this paper investigates the data transmission efficiency and robustness of different automatic repeat request (ARQ) schemes using adaptive power allocation. Considering different block-fading channel assumptions, the long-term throughput, the delay-limited throughput, the outage probability, and the feedback load of different ARQ protocols are studied. A closed-form expression for the power-limited throughput optimization problem is obtained, which is valid for different ARQ protocols and feedback channel conditions. Furthermore, the paper presents numerical investigations on the robustness of different ARQ protocols to feedback errors. It is shown that many analytical assertions about the ARQ protocols are valid both when the channel remains fixed during all retransmission rounds and when it (in)dependently changes in each round. As demonstrated, optimal power allocation is crucial for the performance of noisy ARQ schemes when the goal is to minimize the outage probability.

Connected through hyperedge HE-1 (induced by source paper "balance queueing and retransmission latency optimal massive mimo design"):
  with members:
    - "delay performance of the multiuser miso downlink under imperfect csi and finite length coding"
    - "outage of periodic downlink wireless networks with hard deadlines"
    - "massive mimo has unlimited capacity"
    - "on the ergodic rate lower bounds with applications to massive mimo"
    - "delay performance of miso wireless communications"
    - "massive mimo ten myths and one critical question"
    - "massive mimo performance evaluation based on measured propagation data"
    - "massive mimo for next generation wireless systems"

Connected through hyperedge HE-2 (induced by source paper "bitwise retransmission schemes for resources constrained uplink sensor networks"):
  with members:
    - "enhancing satellite system throughput using adaptive harq for delay tolerant services in mobile communications"

Connected through hyperedge HE-3 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario"):
  with members:
    - "massive mimo multicasting in noncooperative cellular networks"
    - "distributed compressive csit estimation and feedback for fdd multi user massive mimo systems"
    - "massive mimo for next generation wireless systems"
    - "finite block length analysis of the incremental redundancy harq"
    - "downlink training techniques for fdd massive mimo systems open loop and closed loop training with memory"
    - "noncoherent trellis coded quantization a practical limited feedback technique for massive mimo systems"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-4 (induced by source paper "on the performance of rf fso links with and without hybrid arq"):
  with members:
    - "on the performance of the relay arq networks"
    - "finite block length analysis of the incremental redundancy harq"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "lecture notes on network information theory"
    - "on the capacity of free space optical intensity channels"
    - "hybrid arq in multiple antenna slow fading channels performance limits and optimal linear dispersion code design"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-5 (induced by source paper "reinforcement based data transmission in temporally correlated fading channels partial csit scenario"):
  with members:
    - "green communication via power optimized harq protocols"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "coding versus arq in fading channels how reliable should the phy be"
    - "robust rate adaptive wireless communication using ack nak feedback"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"
    - "mimo broadcast channels with finite rate feedback"
    - "limited feedback beamforming over temporally correlated channels"

Connected through hyperedge HE-6 (induced by source paper "green communication via type i arq finite block length analysis"):
  with members:
    - "green communication via power optimized harq protocols"
    - "finite block length analysis of the incremental redundancy harq"
    - "quasi static simo fading channels at finite blocklength"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "fundamental tradeoffs on green wireless networks"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

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)