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: "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
  Abstract: This paper focuses on the downlink of a cellular system and studies opportunistic multiuser scheduling under imperfect channel state information, by exploiting the memory inherent in the channel. The channel between the base station and each user is modeled by a two-state Markov chain and the scheduled user sends back an ARQ feedback that arrives at the scheduler with a random delay, i.i.d. across users and time. The scheduler indirectly estimates the channel via accumulated delayed-ARQ feedback and uses this information to make scheduling decisions. The throughput maximization problem is formulated as a partially observable Markov decision process (POMDP). For the case of two users in the system, it is shown that a greedy policy is sum throughput optimal for any distribution on the ARQ feedback delay. For the case of more than two users, the greedy policy is suboptimal and numerical studies demonstrate that it has near optimal performance. Also, the greedy policy can be implemented by a simple algorithm that does not require the statistics of the underlying Markov channel or the ARQ feedback delay, thus making it robust against errors in system parameter estimation. Establishing an equivalence between the two-user system and a genie-aided system, a simple closed form expression for the sum capacity of the downlink is obtained. Further, inner and outer bounds on the capacity region of the downlink are obtained.

Connected through hyperedge HE-1 (induced by source paper "sequential decision making with limited observation capability application to wireless networks"):
  with members:
    - "a hidden markov restless multi armed bandit model for playout recommendation systems"
    - "opportunistic scheduling as restless bandits"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "downlink scheduling over markovian fading channels"
    - "optimality of myopic sensing in multi channel opportunistic access"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"

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"
    - "exploiting hybrid channel information for downlink multi user mimo scheduling"
    - "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 "second order statistics of mimo rayleigh interference channels theory applications and analysis"):
  with members:
    - "joint scheduling and arq for mu mimo downlink in the presence of inter cell interference"

Connected through hyperedge HE-4 (induced by source paper "scheduling of multicast and unicast services under limited feedback by using rateless codes"):
  with members:
    - "network control without csi using rateless codes for downlink cellular systems"
    - "de randomizing shannon the design and analysis of a capacity achieving rateless code"
    - "throughput of rateless codes over broadcast erasure channels"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "zero rate feedback can achieve the empirical capacity"

Connected through hyperedge HE-5 (induced by source paper "scheduling in time correlated wireless networks with imperfect csi and stringent constraint"):
  with members:
    - "exploiting hybrid channel information for downlink multi user mimo scheduling"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "exploiting channel correlation and pu traffic memory for opportunistic spectrum scheduling"):
  with members:
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"

Connected through hyperedge HE-7 (induced by source paper "exploiting channel memory for joint estimation and scheduling in downlink networks"):
  with members:
    - "optimality of myopic sensing in multi channel opportunistic access"
    - "reinforcement learning a survey"

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)