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: "on the capacity of doubly correlated mimo channels"
  Abstract: In this paper, we analyze the capacity of multiple-input multiple-output (MIMO) Rayleigh-fading channels in the presence of spatial fading correlation at both the transmitter and the receiver, assuming the channel is unknown at the transmitter and perfectly known at the receiver. We first derive the determinant representation for the exact characteristic function of the capacity, which is then used to determine the trace representations for the mean, variance, skewness, kurtosis, and other higher-order statistics (HOS). These results allow us to exactly evaluate two relevant information-theoretic capacity measures - ergodic capacity and outage capacity - and the HOS of the capacity for such a MIMO channel. The analytical framework presented in the paper is valid for arbitrary numbers of antennas, and generalizes the previously known results for independent and identically distributed or one-sided correlated MIMO channels to the case when fading correlation exists on both sides. We verify our analytical results by comparing them with Monte Carlo simulations for a correlation model based on realistic channel measurements as well as a classical exponential correlation model

Connected through hyperedge HE-1 (induced by source paper "exact statistical characterization of 2 times2 gram matrices with arbitrary variance profile"):
  with members:
    - "asymptotic performance of linear receivers in mimo fading channels"
    - "performance analysis of mimo mrc in double correlated rayleigh environments"

Connected through hyperedge HE-2 (induced by source paper "snr estimation in linear systems with gaussian matrices"):
  with members:
    - "constrained perturbation regularization approach for signal estimation using random matrix theory"

Connected through hyperedge HE-3 (induced by source paper "on the spectral efficiency of space constrained massive mimo with linear receivers"):
  with members:
    - "on the spectral efficiency of massive mimo systems with low resolution adcs"
    - "achievable rate of rician large scale mimo channels with transceiver hardware impairments"
    - "space constrained massive mimo hitting the wall of favorable propagation"
    - "the impact of physical channel on performance of subspace based channel estimation in massive mimo systems"
    - "massive mimo with non ideal arbitrary arrays hardware scaling laws and circuit aware design"
    - "power scaling of uplink massive mimo systems with arbitrary rank channel means"
    - "massive mimo for next generation wireless systems"
    - "what will 5g be"

Connected through hyperedge HE-4 (induced by source paper "capacity analysis for spatially non wide sense stationary uplink massive mimo systems"):
  with members:
    - "massive mimo performance evaluation based on measured propagation data"
    - "massive mimo with non ideal arbitrary arrays hardware scaling laws and circuit aware design"
    - "massive mimo for next generation wireless systems"
    - "optimal design of energy efficient multi user mimo systems is massive mimo the answer"
    - "massive mimo for maximal spectral efficiency how many users and pilots should be allocated"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "a coordinated approach to channel estimation in large scale multiple antenna systems"
    - "achieving massive mimo spectral efficiency with a not so large number of antennas"

Connected through hyperedge HE-5 (induced by source paper "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"):
  with members:
    - "closed form output statistics of mimo block fading channels"
    - "diversity versus channel knowledge at finite block length"
    - "on the capacity of large mimo block fading channels"
    - "mutual information of iid complex gaussian signals on block rayleigh faded channels"

Connected through hyperedge HE-6 (induced by source paper "closed form output statistics of mimo block fading channels"):
  with members:
    - "on the capacity of large mimo block fading channels"
    - "mutual information of iid complex gaussian signals on block rayleigh faded channels"

Connected through hyperedge HE-7 (induced by source paper "on the distribution of mimo mutual information an in depth painleve based characterization"):
  with members:
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "open loop spatial multiplexing and diversity communications in ad hoc networks"
    - "living at the edge a large deviations approach to the outage mimo capacity"
    - "energy and spectral efficiency of very large multiuser mimo systems"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"
    - "ergodic capacity analysis of amplify and forward mimo dual hop systems"
    - "transmission capacity of ad hoc networks with spatial diversity"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-8 (induced by source paper "mimo precoding in underlay cognitive radio systems with completely unknown primary csi"):
  with members:
    - "rank constrained schur convex optimization with multiple trace log det constraints"
    - "interference alignment as a rank constrained rank minimization"
    - "beamforming and rate allocation in miso cognitive radio networks"
    - "optimal spectrum sharing in mimo cognitive radio networks via semidefinite programming"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"

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)