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: "green communication via power optimized harq protocols"
  Abstract: Recently, the efficient use of energy has become an essential research topic for green communication. This paper studies the effect of optimal power controllers on the performance of delay-sensitive communication setups that utilize hybrid automatic repeat request (HARQ). The results are obtained for repetition time diversity (RTD) and incremental redundancy (INR) HARQ protocols. In all cases, the optimal power allocation, minimizing the outage-limited average transmission power, is obtained under both continuous and bursting communication models. Also, we investigate the system throughput in different conditions. The results indicate that the power efficiency is substantially increased if adaptive power allocation is utilized. For example, assume a Rayleigh fading channel with a maximum of two (re)transmission rounds with rates {1, [1/2]} nats-per-channel-use and an outage probability constraint 10-3. Then, compared with uniform power allocation, optimal power allocation in RTD reduces the average power by 9 and 11 dB in the bursting and continuous communication models, respectively. In INR, these values are obtained to be 8 and 9 dB, respectively.

Connected through hyperedge HE-1 (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 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"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-2 (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"
    - "outage exponent a unified performance metric for parallel fading channels"
    - "on the bivariate nakagami m cumulative distribution function closed form expression and applications"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-3 (induced by source paper "low complexity optimal scheduling over time correlated fading channels with arq feedback"):
  with members:
    - "exploiting hybrid channel information for downlink multi user mimo scheduling"
    - "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "joint scheduling and resource allocation in the ofdma downlink utility maximization under imperfect channel state information"
    - "scheduling with rate adaptation under incomplete knowledge of channel estimator statistics"
    - "exploiting channel memory for joint estimation and scheduling in downlink networks"
    - "optimality of myopic sensing in multi channel opportunistic access"

Connected through hyperedge HE-4 (induced by source paper "on the performance of the relay arq networks"):
  with members:
    - "green communication via type i arq finite block length analysis"
    - "lecture notes on network information theory"
    - "distributed power allocation strategies for parallel relay networks"

Connected through hyperedge HE-5 (induced by source paper "cross layer chase combining with selective retransmission analysis and throughput optimization for ofdm systems"):
  with members:
    - "coding versus arq in fading channels how reliable should the phy be"
    - "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-6 (induced by source paper "analysis and throughput optimization of selective chase combining for ofdm systems"):
  with members:
    - "coding versus arq in fading channels how reliable should the phy be"
    - "hybrid arq in multiple antenna slow fading channels performance limits and optimal linear dispersion code design"

Connected through hyperedge HE-7 (induced by source paper "energy efficient adaptive power allocation for incremental mimo systems"):
  with members:
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-8 (induced by source paper "reinforcement based data transmission in temporally correlated fading channels partial csit scenario"):
  with members:
    - "on noisy arq in block fading channels"
    - "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"

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)