human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "the capacity of gaussian mimo channels under total and per antenna power constraints"
  Abstract: The capacity of a fixed Gaussian multiple-input multiple-output (MIMO) channel and the optimal transmission strategy under the total power (TP) constraint and full channel state information are well-known. This problem remains open in the general case under individual per-antenna (PA) power constraints, while some special cases have been solved. These include a full-rank solution for the MIMO channel and a general solution for the multiple-input single-output (MISO) channel. In this paper, the fixed Gaussian MISO channel is considered and its capacity as well as optimal transmission strategies are determined in a closed form under the joint total and per-antenna power constraints in the general case. In particular, the optimal strategy is hybrid and includes two parts: first is equal-gain transmission and second is maximum-ratio transmission, which are responsible for the PA and TP constraints respectively. The optimal beamforming vector is given in a closed-form and an accurate yet simple approximation to the capacity is proposed. Finally, the above results are extended to the MIMO case by establishing the ergodic capacity of fading MIMO channels under the joint power constraints when the fading distribution is right unitary-invariant (of which i.i.d. and semi-correlated Rayleigh fading are special cases). Unlike the fixed MISO case, the optimal signaling is shown to be isotropic in this case.

Connected through hyperedge HE-1 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version"):
  with members:
    - "resource management in non orthogonal multiple access networks for 5g and beyond"
    - "interference management in 5g reverse tdd hetnets with wireless backhaul a large system analysis"
    - "multiuser miso transmitter optimization for intercell interference mitigation"
    - "cooperative algorithms for mimo interference channels"
    - "dynamic resource allocation in cognitive radio networks"
    - "miso capacity with per antenna power constraint"
    - "capacity bounds for the gaussian interference channel"
    - "on gaussian mimo bc mac duality with multiple transmit covariance constraints"

Connected through hyperedge HE-2 (induced by source paper "mimo capacity with average total and per antenna power constraints"):
  with members:
    - "the capacity of mimo channels with per antenna power constraint"
    - "miso capacity with per antenna power constraint"

Connected through hyperedge HE-3 (induced by source paper "the sphere packing bound for memoryless channels"):
  with members:
    - "on exact asymptotics of the error probability in channel coding symmetric channels"
    - "a simple derivation of the refined spb for the constant composition codes"
    - "the renyi capacity and center"
    - "saddlepoint approximations for short packet wireless communications"
    - "the augustin capacity and center"
    - "the augustin center and the sphere packing bound for memoryless channels"
    - "the sphere packing bound via augustin s method"
    - "exact asymptotics for the random coding error probability"

Connected through hyperedge HE-4 (induced by source paper "on the capacity of gaussian mimo channels under the joint power constraints"):
  with members:
    - "miso capacity with per antenna power constraint"

Connected through hyperedge HE-5 (induced by source paper "upper and lower bounds on the capacity of amplitude constrained mimo channels"):
  with members:
    - "an upper bound for the capacity of amplitude constrained scalar awgn channel"
    - "interference as noise friend or foe"
    - "capacity bounds for discrete time amplitude constrained additive white gaussian noise channels"
    - "on the capacity of vector gaussian channels with bounded inputs"
    - "miso capacity with per antenna power constraint"
    - "on the boundedness of the support of optimal input measures for rayleigh fading channels"

Question: Please tell me which class the center node 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)