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: "robust rate maximization game under bounded channel uncertainty"
  Abstract: We consider the problem of decentralized power allocation for competitive rate-maximization in a frequency-selective Gaussian interference channel under bounded channel uncertainty. We formulate a distribution-free robust framework for the rate-maximization game. We present the robust-optimization equilibrium for this game and derive sufficient conditions for its existence and uniqueness. We show that an iterative waterfilling algorithm converges to this equilibrium under certain sufficient conditions. We analyse the social properties of the equilibrium under varying channel uncertainty bounds for the two-user case. We also observe an interesting phenomenon that the equilibrium moves towards a frequency-division multiple access solution for any set of channel coefficients under increasing channel uncertainty bounds. We further prove that increasing channel uncertainty can lead to a more efficient equilibrium, and hence, a better sum rate in certain two-user communication systems. Finally, we confirm, through simulations, this improvement in equilibrium efficiency is also observed in systems with a higher number of users.

Connected through hyperedge HE-1 (induced by source paper "interference coordination via power domain channel estimation"):
  with members:
    - "ultra dense small cell networks turning density into energy efficiency"
    - "coordination in distributed networks via coded actions with application to power control"
    - "resource allocation for energy efficient 3 way relay channels"
    - "compressive rate estimation with applications to device to device communications"
    - "energy aware competitive power allocation for heterogeneous networks under qos constraints"
    - "crawford sobel meet lloyd max on the grid"
    - "coded power control performance analysis"
    - "power optimization in random wireless networks"

Connected through hyperedge HE-2 (induced by source paper "distributed resource allocation for relay aided device to device communication under channel uncertainties a stable matching approach"):
  with members:
    - "matching theory for priority based cell association in the downlink of wireless small cell networks"
    - "matching theory for future wireless networks fundamentals and applications"
    - "resource allocation under channel uncertainties for relay aided device to device communication underlaying lte a cellular networks"
    - "resource allocation for network integrated device to device communications using smart relays"
    - "resource management for device to device underlay communication"

Connected through hyperedge HE-3 (induced by source paper "resource allocation under channel uncertainties for relay aided device to device communication underlaying lte a cellular networks"):
  with members:
    - "low rate machine type communication via wireless device to device d2d links"
    - "resource allocation for network integrated device to device communications using smart relays"
    - "refim a practical interference management in heterogeneous wireless access networks"

Connected through hyperedge HE-4 (induced by source paper "worst case robust distributed power allocation in shared unlicensed spectrum"):
  with members:
    - "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity"
    - "power control in cognitive radio networks how to cross a multi lane highway"
    - "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria"
    - "competitive design of multiuser mimo systems based on game theory a unified view"
    - "on peak versus average interference power constraints for protecting primary users in cognitive radio networks"
    - "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms"

Connected through hyperedge HE-5 (induced by source paper "robust additively coupled games"):
  with members:
    - "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms"
    - "a game theoretic approach to energy efficient modulation in cdma networks with delay qos constraints"

Connected through hyperedge HE-6 (induced by source paper "robust spectrum sharing via worst case approach"):
  with members:
    - "optimal linear precoding strategies for wideband noncooperative systems based on game theory part i nash equilibria"
    - "optimal linear precoding strategies for wideband non cooperative systems based on game theory part ii algorithms"

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)