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 "transmit without regrets online optimization in mimo ofdm cognitive radio systems"):
  Abstract: In this paper, we examine cognitive radio systems that evolve dynamically over time due to changing user and environmental conditions. To combine the advantages of orthogonal frequency division multiplexing (OFDM) and multiple-input, multiple-output (MIMO) technologies, we consider a MIMO-OFDM cognitive radio network where wireless users with multiple antennas communicate over several non-interfering frequency bands. As the network's primary users (PUs) come and go in the system, the communication environment changes constantly (and, in many cases, randomly). Accordingly, the network's unlicensed, secondary users (SUs) must adapt their transmit profiles "on the fly" in order to maximize their data rate in a rapidly evolving environment over which they have no control. In this dynamic setting, static solution concepts (such as Nash equilibrium) are no longer relevant, so we focus on dynamic transmit policies that lead to no regret: specifically, we consider policies that perform at least as well as (and typically outperform) even the best fixed transmit profile in hindsight. Drawing on the method of matrix exponential learning and online mirror descent techniques, we derive a no-regret transmit policy for the system's SUs which relies only on local channel state information (CSI). Using this method, the system's SUs are able to track their individually evolving optimum transmit profiles remarkably well, even under rapidly (and randomly) changing conditions. Importantly, the proposed augmented exponential learning (AXL) policy leads to no regret even if the SUs' channel measurements are subject to arbitrarily large observation errors (the imperfect CSI case), thus ensuring the method's robustness in the presence of uncertainties.

Includes members:
  Member "distributed learning policies for power allocation in multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low complexity distributed radio access network slicing algorithms and experimental results")
  Member "distributed algorithms for learning and cognitive medium access with logarithmic regret":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "my fair bandit distributed learning of max min fairness with multi player bandits")
  Member "optimal spectrum sharing in mimo cognitive radio networks via semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algorithm hardware co optimization of the memristor based framework for solving socp and homogeneous qcqp problems")
  Member "regularization techniques for learning with matrices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed learning with sublinear communication")
  Member "multi agent q learning of channel selection in multi user cognitive radio systems a two by two case":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "20 years of evolution from cognitive to intelligent communications")
  Member "adaptive channel allocation spectrum etiquette for cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "machine learning for resource management in cellular and iot networks potentials current solutions and open challenges")

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.IT(Information Theory)