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 "duality polite water filling and optimization for mimo b mac interference networks and itree networks"):
  Abstract: The general MIMO interference network is considered and is named the B-MAC Network, for it is a combination of multiple interfering broadcast channels and multiaccess channels. Included as special cases are interference channels, X channels, X networks, and most practical wireless networks. The optimization of this important class of networks has been hindered by that beyond the single antenna multiaccess channels, little is known about the optimal input structure, which is found here to be the polite water-filling, satisfied by all Pareto optimal input. This network version of water-filling is polite because it optimally balances between reducing interference to others and maximizing a link’s own rate, offering a method to decompose a network into multiple equivalent single-user channels and thus, paving the way for designing/improving low-complexity centralized/distributed/game-theoretic algorithms for most network optimization problems. Deeply connected is the rate duality extended to the forward and reverse links of the B-MAC networks. As a demonstration, weighted sum-rate maximization algorithms with superior performance and low complexity are designed for B-MAC networks and are analyzed for Interference Tree (iTree) Networks, a sub-class of the B-MAC networks that possesses promising properties for further information theoretic study.

Includes members:
  Member "sum capacity of interference channels with a local view impact of distributed decisions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "mimo b mac interference network optimization under rate constraints by polite water filling and duality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless networks")
  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 "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "mimo broadcast channel optimization under general linear constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dual link algorithm for the weighted sum rate maximization in mimo interference channels")
  Member "a general rate duality of the mimo multiple access channel and the mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on reciprocity in physically consistent tdd systems with coupled antennas")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "on gaussian mimo bc mac duality with multiple transmit covariance constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")

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)