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: "exact joint distribution analysis of zero forcing v blast gains with greedy ordering"
  Abstract: We derive the joint probability distribution of zero-forcing (ZF) V-BLAST gains under a greedy selection of decoding order and no error propagation. Unlike the previous approximated analyses, a mathematical framework is built by applying order statistics rules and an exact closed-form joint probability density function expression for squared layer gains is obtained. Our analysis relies on the fact that all orderings are equiprobable under independent and identical Rayleigh fading. Based on this idea, we determine the joint distribution of the ordered gains from the joint distribution of the unordered gains. Our results are applicable for any number of transmit and receive antennas. Although we present our analysis in a ZF V-BLAST setting, our analytical results can be directly applied for the dual cases of ZF V-BLAST. Under the assumption of a low rate feedback of decoding order to the transmitter, a benefit of having exact expressions is illustrated by the calculation of the cutoff value under optimal power allocation that maximizes the sum of the substream outage capacities under a given sum power constraint. We provide numerical results and verify our analysis by means of simulations.

Connected through hyperedge HE-1 (induced by source paper "distributed spatial multiplexing systems with hardware impairments and imperfect channel estimation under rank 1 rician fading channels"):
  with members:
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "exact sf zf analysis and computer algebra aided evaluation in rank 1 los rician fading"
    - "achievable rate of rician large scale mimo channels with transceiver hardware impairments"
    - "eigenvalue dynamics of a central wishart matrix with application to mimo systems"
    - "power scaling of uplink massive mimo systems with arbitrary rank channel means"
    - "directional cell discovery in millimeter wave cellular networks"
    - "channel estimation and hybrid precoding for millimeter wave cellular systems"
    - "massive mimo systems with non ideal hardware energy efficiency estimation and capacity limits"

Connected through hyperedge HE-2 (induced by source paper "secure communication in uplink transmissions user selection and multiuser secrecy gain"):
  with members:
    - "secure massive mimo transmission with an active eavesdropper"
    - "the ergodic capacity of the multiple access channel under distributed scheduling order optimality of linear receivers"
    - "multiuser diversity for secrecy communications using opportunistic jammer selection secure dof and jammer scaling law"
    - "energy and spectral efficiency of very large multiuser mimo systems"
    - "secure diversity multiplexing tradeoff of zero forcing transmit scheme at finite snr"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"
    - "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation"
    - "on the secure degrees of freedom of the multiple access channel"

Connected through hyperedge HE-3 (induced by source paper "on the joint impact of hardware impairments and imperfect csi on successive decoding"):
  with members:
    - "outage probability of dual hop multiple antenna af systems with linear processing in the presence of co channel interference"
    - "on the mimo capacity with residual transceiver hardware impairments"
    - "performance analysis of the ordered v blast approach over nakagami m fading channels"
    - "diversity of mmse mimo receivers"
    - "mimo transmission with residual transmit rf impairments"
    - "performance analysis of mimo mrc in double correlated rayleigh environments"

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)