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 capacity and optimal signaling for gaussian mimo channels under interference constraints full version"):
  Abstract: Gaussian MIMO channel under total transmit and interference power constraints (TPC and IPC) is considered. A closed-form solution for the optimal transmit covariance matrix in the general case is obtained using the KKT-based approach (up to dual variables). While closed-from solutions for optimal dual variables are possible in special cases, an iterative bisection algorithm (IBA) is proposed to find the optimal dual variables in the general case and its convergence is proved for some special cases. Numerical experiments illustrate its efficient performance. Bounds for the optimal dual variables are given, which facilitate numerical solutions. An interplay between the TPC and IPC is studied, including the transition from power-limited to interference-limited regimes as the total transmit power increases. Sufficient and necessary conditions for each constraint to be redundant are given. A number of explicit closed-form solutions are obtained, including full-rank and rank-1 (beamforming) cases as well as the case of identical eigenvectors (typical for massive MIMO settings). A bound on the rank of optimal covariance is established. A number of unusual properties of optimal covariance matrix are pointed out.

Includes members:
  Member "the capacity of gaussian mimo channels under total and per antenna power constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mimo capacity with average total and per antenna power constraints")
  Member "resource management in non orthogonal multiple access networks for 5g and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey of rate optimal power domain noma schemes for enabling technologies of future wireless networks")
  Member "interference management in 5g reverse tdd hetnets with wireless backhaul a large system analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance of network assisted full duplex for cell free massive mimo")
  Member "multiuser miso transmitter optimization for intercell interference mitigation":
    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 "cooperative algorithms for mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reduced dimension design of mimo over the air computing for data aggregation in clustered iot networks")
  Member "dynamic resource allocation in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint power control and passive beamforming in irs assisted spectrum sharing")
  Member "miso capacity with per antenna power constraint":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy efficiency of distributed antenna systems with wireless power transfer")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "vector gaussian successive refinement with degraded side information")

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)