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 "mimo b mac interference network optimization under rate constraints by polite water filling and duality"):
  Abstract: We take two new approaches to design efficient algorithms for transmitter optimization under rate constraints in order to guarantee the Quality of Service for MIMO B-MAC interference networks. A B-MAC network is a generalized interference network that is a combination of multiple interfering broadcast channels (BC) and multiaccess channels (MAC). Two related optimization problems, maximizing the minimum of weighted rates under a sum-power constraint and minimizing the sum-power under rate constraints, are considered. The first approach takes advantage of existing algorithms for SINR problems by building a bridge between rate and SINR through the design of optimal mappings between them. The second approach exploits the polite water-filling structure, which is the network version of water-filling satisfied by all the Pareto optimal input of a large class of achievable regions of B-MAC networks. It replaces most generic optimization algorithms currently used for such networks and reduces the complexity while demonstrating superior performance even in non-convex cases. Both centralized and distributed algorithms are designed and the performance is analyzed in addition to numeric examples.

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 "technical report mimo b mac interference network optimization under rate constraints by polite water filling and duality":
    also connected through other hyperedges:
      (none)
  Member "mimo broadcast channel optimization under general linear constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "approaching the capacity of wireless networks through distributed interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")

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)