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: "performance of hybrid arq in block fading channels a fixed outage probability analysis"
  Abstract: This paper studies the performance of hybrid-ARQ (automatic repeat request) in Rayleigh block fading channels. The long-term average transmitted rate is analyzed in a fast-fading scenario where the transmitter only has knowledge of channel statistics, and, consistent with contemporary wireless systems, rate adaptation is performed such that a target outage probability (after a maximum number of H-ARQ rounds) is maintained. H-ARQ allows for early termination once decoding is possible, and thus is a coarse, and implicit, mechanism for rate adaptation to the instantaneous channel quality. Although the rate with H-ARQ is not as large as the ergodic capacity, which is achievable with rate adaptation to the instantaneous channel conditions, even a few rounds of H-ARQ make the gap to ergodic capacity reasonably small for operating points of interest. Furthermore, the rate with H-ARQ provides a significant advantage compared to systems that do not use H-ARQ and only adapt rate based on the channel statistics.

Connected through hyperedge HE-1 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback"):
  with members:
    - "fast harq over finite blocklength codes a technique for low latency reliable communication"
    - "low latency short packet transmissions fixed length or harq"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "energy latency tradeoff in ultra reliable low latency communication with retransmissions"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "moderate deviation asymptotics for variable length codes with feedback"
    - "coherent multiple antenna block fading channels at finite blocklength"

Connected through hyperedge HE-2 (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"
    - "on noisy arq in block fading channels"

Connected through hyperedge HE-3 (induced by source paper "delay analysis of spatially coded mimo zfbf with retransmissions in random networks"):
  with members:
    - "capacity of cellular wireless network"
    - "impact of los nlos propagation and path loss in ultra dense cellular networks"
    - "heterogeneous cellular networks with spatio temporal traffic delay analysis and scheduling"
    - "managing interference correlation through random medium access"
    - "diversity polynomials for the analysis of temporal correlations in wireless networks"
    - "diversity loss due to interference correlation"
    - "open loop spatial multiplexing and diversity communications in ad hoc networks"
    - "throughput delay reliability tradeoff with arq in wireless ad hoc networks"

Connected through hyperedge HE-4 (induced by source paper "fast harq over finite blocklength codes a technique for low latency reliable communication"):
  with members:
    - "mimo channel modeling and capacity analysis for 5g millimeter wave wireless systems"
    - "modelling decoding errors in harq"
    - "green communication via power optimized harq protocols"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "millimeter wave channel modeling and cellular capacity evaluation"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"

Connected through hyperedge HE-5 (induced by source paper "amc and harq how to increase the throughput"):
  with members:
    - "generalized harq protocols with delayed channel state information and average latency constraints"
    - "how to boost the throughput of harq with off the shelf codes"
    - "harq and amc friends or foes"
    - "adaptive cross packet harq"
    - "delayed channel state information incremental redundancy with backtrack retransmission"

Connected through hyperedge HE-6 (induced by source paper "asymptotic outage analysis of harq ir over time correlated nakagami m fading channels"):
  with members:
    - "energy efficient adaptive power allocation for incremental mimo systems"
    - "green communication via power optimized harq protocols"
    - "outage exponent a unified performance metric for parallel fading channels"
    - "on the bivariate nakagami m cumulative distribution function closed form expression and applications"

Connected through hyperedge HE-7 (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"
    - "on noisy arq in block fading channels"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "adaptive cross packet harq"):
  with members:
    - "how to boost the throughput of harq with off the shelf codes"
    - "harq and amc friends or foes"
    - "rate adaptation for secure harq protocols"
    - "harq buffer management an information theoretic view"
    - "delayed channel state information incremental redundancy with backtrack retransmission"
    - "block fading channels with delayed csit at finite blocklength"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "mimo arq with multi bit feedback outage 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)