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: "asymptotically optimal downlink scheduling over markovian fading channels"
  Abstract: We consider the scheduling problem in downlink wireless networks with heterogeneous, Markov-modulated, ON/OFF channels. It is well-known that the performance of scheduling over fading channels heavily depends on the accuracy of the available Channel State Information (CSI), which is costly to acquire. Thus, we consider the CSI acquisition via a practical ARQ-based feedback mechanism whereby channel states are revealed at the end of only scheduled users' transmissions. In the assumed presence of temporally-correlated channel evolutions, the desired scheduler must optimally balance the exploitation-exploration trade-off, whereby it schedules transmissions both to exploit those channels with up-to-date CSI and to explore the current state of those with outdated CSI. #R##N#In earlier works, Whittle's Index Policy had been suggested as a low-complexity and high-performance solution to this problem. However, analyzing its performance in the typical scenario of statistically heterogeneous channel state processes has remained elusive and challenging, mainly because of the highly-coupled and complex dynamics it possesses. In this work, we overcome these difficulties to rigorously establish the asymptotic optimality properties of Whittle's Index Policy in the limiting regime of many users. More specifically: (1) we prove the local optimality of Whittle's Index Policy, provided that the initial state of the system is within a certain neighborhood of a carefully selected state; (2) we then establish the global optimality of Whittle's Index Policy under a recurrence assumption that is verified numerically for the problem at hand. These results establish, for the first time to the best of our knowledge, that Whittle's Index Policy possesses analytically provable optimality characteristics for scheduling over heterogeneous and temporally-correlated channels.

Connected through hyperedge HE-1 (induced by source paper "constrained restless bandits for dynamic scheduling in cyber physical systems"):
  with members:
    - "sequential decision making under uncertainty with dynamic resource constraints"
    - "sequential decision making with limited observation capability application to wireless networks"
    - "a hidden markov restless multi armed bandit model for playout recommendation systems"
    - "whittle index policy for crawling ephemeral content"

Connected through hyperedge HE-2 (induced by source paper "sequential decision making under uncertainty with dynamic resource constraints"):
  with members:
    - "sequential decision making with limited observation capability application to wireless networks"
    - "a hidden markov restless multi armed bandit model for playout recommendation systems"
    - "whittle index policy for crawling ephemeral content"

Connected through hyperedge HE-3 (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"
    - "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
    - "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-4 (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"
    - "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
    - "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-5 (induced by source paper "on the whittle index for restless multi armed hidden markov bandits"):
  with members:
    - "whittle index policy for crawling ephemeral content"
    - "congestion control of tcp flows in internet routers by means of index policy"
    - "on optimality of myopic sensing policy with imperfect sensing in multi channel opportunistic access"
    - "exploiting channel memory for joint estimation and scheduling in downlink networks"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"
    - "joint design and separation principle for opportunistic spectrum access in the presence of sensing errors"

Connected through hyperedge HE-6 (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"
    - "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
    - "de randomizing shannon the design and analysis of a capacity achieving rateless code"
    - "throughput of rateless codes over broadcast erasure channels"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "zero rate feedback can achieve the empirical capacity"

Connected through hyperedge HE-7 (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"
    - "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
    - "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-8 (induced by source paper "network control without csi using rateless codes for downlink cellular systems"):
  with members:
    - "de randomizing shannon the design and analysis of a capacity achieving rateless code"
    - "joint scheduling and resource allocation in ofdma downlink systems via ack nak feedback"
    - "joint scheduling and arq for mu mimo downlink in the presence of inter cell interference"
    - "rateless coding for gaussian 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.NI(Networking and Internet Architecture)