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: "hybrid arq in multiple antenna slow fading channels performance limits and optimal linear dispersion code design"
  Abstract: This paper focuses on studying the fundamental performance limits and linear dispersion code design for the MIMO-ARQ slow fading channel. Optimal average rate of well-known HARQ protocols is analyzed. The optimal design of space-time coding for the MIMO-ARQ channel is discussed. Information-theoretic measures are used to optimize the rate assignment and derive the optimum design criterion, which is then used to evaluate the optimality of existing space-time codes. A different design criterion, which is obtained from the error probability analysis of space-time coded MIMO-HARQ, is presented. Examples are studied to reveal the gain of ARQ feedback in space-time coded MIMO systems.

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

Connected through hyperedge HE-3 (induced by source paper "cross layer chase combining with selective retransmission analysis and throughput optimization for ofdm systems"):
  with members:
    - "green communication via power optimized harq protocols"
    - "coding versus arq in fading channels how reliable should the phy be"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-4 (induced by source paper "analysis and throughput optimization of selective chase combining for ofdm systems"):
  with members:
    - "green communication via power optimized harq protocols"
    - "coding versus arq in fading channels how reliable should the phy be"

Connected through hyperedge HE-5 (induced by source paper "green communication via power optimized harq protocols"):
  with members:
    - "fundamental limits of cooperation"
    - "bit allocation law for multiantenna channel feedback quantization single user case"
    - "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"
    - "capacity definitions of general channels with receiver side information"

Connected through hyperedge HE-6 (induced by source paper "coordinated hybrid automatic repeat request extended version"):
  with members:
    - "harq feedback in spectrum sharing networks"

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)