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: "miso capacity with per antenna power constraint"
  Abstract: We establish in closed-form the capacity and the optimal signaling scheme for a MISO channel with per-antenna power constraint. Two cases of channel state information are considered: constant channel known at both the transmitter and receiver, and Rayleigh fading channel known only at the receiver. For the first case, the optimal signaling scheme is beamforming with the phases of the beam weights matched to the phases of the channel coefficients, but the amplitudes independent of the channel coefficients and dependent only on the constrained powers. For the second case, the optimal scheme is to send independent signals from the antennas with the constrained powers. In both cases, the capacity with per-antenna power constraint is usually less than that with sum power constraint.

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:
    - "the capacity of gaussian mimo channels under total and per antenna power constraints"
    - "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"
    - "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 "energy efficiency of distributed antenna systems with wireless power transfer"):
  with members:
    - "energy efficient swipt in iot distributed antenna systems"
    - "wirelessly powered backscatter communications waveform design and snr energy tradeoff"
    - "fundamental green tradeoffs progresses challenges and impacts on 5g networks"
    - "power allocation for secure swipt systems with wireless powered cooperative jamming"
    - "wireless information and power transfer nonlinearity waveform design and rate energy tradeoff"
    - "artificial noise aided secrecy information and power transfer in ofdma systems"
    - "information and energy cooperation in ofdm relaying protocols and optimization"
    - "secure and green swipt in distributed antenna networks with limited backhaul capacity"

Connected through hyperedge HE-3 (induced by source paper "on estimating maximum sum rate of mimo systems with successive zero forcing dirty paper coding and per antenna power constraint"):
  with members:
    - "learning to optimize training deep neural networks for interference management"
    - "alternating optimization for capacity region of gaussian mimo broadcast channels with per antenna power constraint"
    - "low complexity approaches for mimo capacity with per antenna power constraint"

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

Connected through hyperedge HE-5 (induced by source paper "non coherent rate splitting for the miso bc with magnitude csit"):
  with members:
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"

Connected through hyperedge HE-6 (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 capacity of gaussian mimo channels under total and per antenna power constraints"
    - "the sphere packing bound via augustin s method"

Connected through hyperedge HE-7 (induced by source paper "unified overview of matrix monotonic optimization for mimo transceivers"):
  with members:
    - "a framework for joint design of pilot sequence and linear precoder"
    - "on weighted mse model for mimo transceiver optimization"
    - "a framework for transceiver designs for multi hop communications with covariance shaping constraints"
    - "fifty years of mimo detection the road to large scale mimos"
    - "convex separable problems with linear constraints in signal processing and communications"
    - "matrix monotonic optimization for mimo systems"
    - "robust transceiver with tomlinson harashima precoding for amplify and forward mimo relaying systems"

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

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)