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 "the weighted sum rate maximization in mimo interference networks the minimax lagrangian duality and algorithm"):
  Abstract: We take a new perspective on the weighted sum-rate maximization in multiple-input multiple-output (MIMO) interference networks, by formulating an equivalent max-min problem. This seemingly trivial reformulation has significant implications: the Lagrangian duality of the equivalent max-min problem provides an elegant way to establish the sum-rate duality between an interference network and its reciprocal when such a duality exists, and more importantly, suggests a novel iterative minimax algorithm for the weighted sum-rate maximization. Moreover, the design and convergence proof of the algorithm use only general convex analysis. They apply and extend to any max-min problems with similar structure, and thus provide a general class of algorithms for such optimization problems. This paper presents a promising step and lends hope for establishing a general framework based on the minimax Lagrangian duality for characterizing the weighted sum-rate and developing efficient algorithms for general MIMO interference networks.

Includes members:
  Member "duality polite water filling and optimization for mimo b mac interference networks and itree networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dual link algorithm for the weighted sum rate maximization in mimo interference channels")
  Member "multiuser miso transmitter optimization for intercell interference mitigation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "linear precoding in cooperative mimo cellular networks with limited coordination clusters":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stochastic modeling and analysis of user centric network mimo systems")
  Member "mimo broadcast channel optimization under general linear constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dual link algorithm for the weighted sum rate maximization in mimo interference channels")
  Member "on gaussian mimo bc mac duality with multiple transmit covariance constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "weighted sum rate optimization for cognitive radio mimo broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cooperative prediction and sensing based spectrum sharing in cognitive radio networks")

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)