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 "dual link algorithm for the weighted sum rate maximization in mimo interference channels"):
  Abstract: MIMO interference network optimization is important for increasingly crowded wireless communication networks. We provide a new algorithm, named Dual Link algorithm, for the classic problem of weighted sum-rate maximization for MIMO multiaccess channels (MAC), broadcast channels (BC), and general MIMO interference channels with Gaussian input and a total power constraint. For MIMO MAC/BC, the algorithm finds optimal signals to achieve the capacity region boundary. For interference channels with Gaussian input assumption, two of the previous state-of-the-art algorithms are the WMMSE algorithm and the polite water-filling (PWF) algorithm. The WMMSE algorithm is provably convergent, while the PWF algorithm takes the advantage of the optimal transmit signal structure and converges the fastest in most situations but is not guaranteed to converge in all situations. It is highly desirable to design an algorithm that has the advantages of both algorithms. The dual link algorithm is such an algorithm. Its fast and guaranteed convergence is important to distributed implementation and time varying channels. In addition, the technique and a scaling invariance property used in the convergence proof may find applications in other non-convex problems in communication networks.

Includes members:
  Member "the weighted sum rate maximization in mimo interference networks the minimax lagrangian duality and algorithm":
    also connected through other hyperedges:
      (none)
  Member "mimo b mac interference network optimization under rate constraints by polite water filling and duality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless networks")
  Member "duality polite water filling and optimization for mimo b mac interference networks and itree networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the weighted sum rate maximization in mimo interference networks the minimax lagrangian duality and algorithm")
  Member "multiuser miso transmitter optimization for intercell interference mitigation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "mimo broadcast channel optimization under general linear constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vandermonde subspace frequency division multiplexing for two tiered cognitive radio networks")
  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)