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: "joint scheduling and resource allocation in the ofdma downlink utility maximization under imperfect channel state information"
  Abstract: We consider the problem of simultaneous user-scheduling, power-allocation, and rate-selection in an orthogonal frequency division multiple access (OFDMA) downlink, with the goal of maximizing expected sum-utility under a sum-power constraint. In doing so, we consider a family of generic goodput-based utilities that facilitate, e.g., throughput-based pricing, quality-of-service enforcement, and/or the treatment of practical modulation-and-coding schemes (MCS). Since perfect knowledge of channel state information (CSI) may be difficult to maintain at the base-station, especially when the number of users and/or subchannels is large, we consider scheduling and resource allocation under imperfect CSI, where the channel state is described by a generic probability distribution. First, we consider the “continuous” case where multiple users and/or code rates can time-share a single OFDMA subchannel and time slot. This yields a nonconvex optimization problem that we convert into a convex optimization problem and solve exactly using a dual optimization approach. Second, we consider the “discrete” case where only a single user and code rate is allowed per OFDMA subchannel per time slot. For the mixed-integer optimization problem that arises, we discuss the connections it has with the continuous case and show that it can solved exactly in some situations. For the other situations, we present a bound on the optimality gap. For both cases, we provide algorithmic implementations of the obtained solution. Finally, we study, numerically, the performance of the proposed algorithms under various degrees of CSI uncertainty, utilities, and OFDMA system configurations. In addition, we demonstrate advantages relative to existing state-of-the-art algorithms.

Connected through hyperedge HE-1 (induced by source paper "robust urllc packet scheduling of ofdm systems"):
  with members:
    - "ultrareliable and low latency communication techniques for tactile internet services"
    - "a vision of 6g wireless systems applications trends technologies and open research problems"
    - "resource allocation for multi user downlink urllc ofdma systems"
    - "resource allocation and harq optimization for urllc traffic in 5g wireless networks"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "cross layer optimization for ultra reliable and low latency radio access networks"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"
    - "coordinated beamforming for multiuser miso interference channel under rate outage constraints"

Connected through hyperedge HE-2 (induced by source paper "optimizing joint data and power transfer in energy harvesting multiuser wireless networks"):
  with members:
    - "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities"
    - "wireless power meets energy harvesting a joint energy allocation approach in ofdm based system"
    - "distributed power control in interference channels with qos constraints and rf energy harvesting a game theoretic approach"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "power allocation strategies in energy harvesting wireless cooperative networks"
    - "throughput maximization in wireless powered communication networks"
    - "wireless information and power transfer energy efficiency optimization in ofdma systems"

Connected through hyperedge HE-3 (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"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "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-4 (induced by source paper "robust rate adaptation and proportional fair scheduling with imperfect csi"):
  with members:
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

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"
    - "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "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 "joint scheduling and resource allocation in ofdma downlink systems via ack nak feedback"):
  with members:
    - "cross layer design of fdd ofdm systems based on ack nak feedbacks"

Connected through hyperedge HE-7 (induced by source paper "asymptotically optimal downlink scheduling over markovian fading channels"):
  with members:
    - "scheduling with rate adaptation under incomplete knowledge of channel estimator statistics"
    - "exploiting channel memory for multi user wireless scheduling without channel measurement capacity regions and algorithms"
    - "exploiting channel memory for joint estimation and scheduling in downlink networks"
    - "optimality of myopic sensing in multi channel opportunistic access"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"
    - "approximation algorithms for restless bandit problems"
    - "reinforcement learning a survey"

Connected through hyperedge HE-8 (induced by source paper "downlink scheduling over markovian fading channels"):
  with members:
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "scheduling with rate adaptation under incomplete knowledge of channel estimator statistics"
    - "exploiting channel memory for joint estimation and scheduling in downlink networks"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"
    - "approximation algorithms for restless bandit problems"
    - "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)