human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "scheduling in time correlated wireless networks with imperfect csi and stringent constraint"):
  Abstract: In a wireless network, the efficiency of scheduling algorithms over time-varying channels depends heavily on the accuracy of the Channel State Information (CSI), which is usually quite ``costly'' in terms of consuming network resources. Scheduling in such systems is also subject to stringent constraints such as power and bandwidth, which limit the maximum number of simultaneous transmissions. In the meanwhile, communication channels in wireless systems typically fluctuate in a time-correlated manner. We hence design schedulers to exploit the temporal-correlation inherent in channels with memory and ARQ-styled feedback from the users for better channel state knowledge, under the assumption of Markovian channels and the stringent constraint on the maximum number of simultaneously active users. We model this problem under the framework of a Partially Observable Markov Decision Processes. #R##N#In recent work, a low-complexity optimal solution was developed for this problem under a long-term time-average resource constraint. However, in real systems with instantaneous resource constraints, how to optimally exploit the temporal correlation and satisfy realistic stringent constraint on the instantaneous service remains elusive. In this work, we incorporate a stringent constraint on the simultaneously scheduled users and propose a low-complexity scheduling algorithm that dynamically implements user scheduling and dummy packet broadcasting. We show that the throughput region of the optimal policy under the long-term average resource constraint can be asymptotically achieved in the stringent constrained scenario by the proposed algorithm, in the many users limiting regime.

Includes members:
  Member "exploiting hybrid channel information for downlink multi user mimo scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improving dl mu mimo performance in ieee 802 11ac networks through decoupled scheduling")
  Member "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sequential decision making with limited observation capability application to wireless networks")
  Member "asymptotically optimal downlink scheduling over markovian fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constrained restless bandits for dynamic scheduling in cyber physical systems")
  Member "joint scheduling and resource allocation in the ofdma downlink utility maximization under imperfect channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "scheduling with rate adaptation under incomplete knowledge of channel estimator statistics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "low complexity optimal scheduling over time correlated fading channels with arq feedback")
  Member "exploiting channel memory for joint estimation and scheduling in downlink networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "low complexity optimal scheduling over time correlated fading channels with arq feedback")

Question: Please tell me which class the source paper 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)