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 capacity with average total and per antenna power constraints"):
  Abstract: MIMO capacity with a joint total and per-antenna average power constraint is considered in this work. The problem arises when, besides having a limited available power at the transmitter, also the individual antennas cannot radiate power beyond the limits of their corresponding RF chains. Closed-form results are illustrated in specific cases and, in particular, in the unit-rank channel matrix case. Lower-complexity optimization problems are derived for the other cases. Numerical complexity is derived in terms of the number of equivalent real variables for the optimization problem and a general formula is provided depending on the channel matrix rank. Numerical results are included to validate and illustrate the application of the proposed optimization algorithms and also to evaluate the time complexity of its implementation.

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 "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "the capacity of mimo channels with per antenna power constraint":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "alternating optimization for capacity region of gaussian mimo broadcast channels with per antenna power constraint")
  Member "miso capacity with per antenna power constraint":
    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")

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)