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: "exploiting hybrid channel information for downlink multi user mimo scheduling"
  Abstract: We investigate the downlink multi-user MIMO (MU-MIMO) scheduling problem in the presence of imperfect Channel State Information at the transmitter (CSIT) that comprises of coarse and current CSIT as well as finer but delayed CSIT. This scheduling problem is characterized by an intricate `exploitation - exploration tradeoff' between scheduling the users based on current CSIT for immediate gains, and scheduling them to obtain finer albeit delayed CSIT and potentially larger future gains. We solve this scheduling problem by formulating a frame based joint scheduling and feedback approach, where in each frame a policy is obtained as the solution to a Markov Decision Process. We prove that our proposed approach can be made arbitrarily close to the optimal and then demonstrate its significant gains over conventional MU-MIMO scheduling.

Connected through hyperedge HE-1 (induced by source paper "improving dl mu mimo performance in ieee 802 11ac networks through decoupled scheduling"):
  with members:
    - "mu mimo mac protocols for wireless local area networks a survey"
    - "proportional fair mu mimo in 802 11 wlans"
    - "on the performance of packet aggregation in ieee 802 11ac mu mimo wlans"

Connected through hyperedge HE-2 (induced by source paper "low complexity optimal scheduling over time correlated fading channels with arq feedback"):
  with members:
    - "green communication via power optimized harq protocols"
    - "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-3 (induced by source paper "scheduling in time correlated wireless networks with imperfect csi and stringent constraint"):
  with members:
    - "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"

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)