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 "closed form performance analysis of linear mimo receivers in general fading scenarios"):
  Abstract: Linear precoding and post-processing schemes are ubiquitous in wireless multi-input-multi-output (MIMO) settings, due to their reduced complexity with respect to optimal strategies. Despite their popularity, the performance analysis of linear MIMO receivers is mostly not available in closed form, apart for the canonical (uncorrelated Rayleigh fading) case, while for more general fading conditions only bounds are provided. This lack of results is motivated by the complex dependence of the output signal-to-interference and noise ratio (SINR) at each branch of the receiving filter on both the squared singular values as well as the (typically right) singular vectors of the channel matrix. While the explicit knowledge of the statistics of the SINR can be circumvented for some fading types in the analysis of the linear Minimum Mean-Squared Error (MMSE) receiver, this does not apply to the less complex and widely adopted Zero-Forcing (ZF) scheme. This work provides the first-to-date closed-form expression of the probability density function (pdf) of the output ZF and MMSE SINR, for a wide range of fading laws, encompassing, in particular, correlations and multiple scattering effects typical of practically relevant channel models.

Includes members:
  Member "performance of massive mimo uplink with zero forcing receivers under delayed channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "toward a realistic assessment of multiple antenna hcns residual additive transceiver hardware impairments and channel aging")
  Member "on the outage capacity of orthogonal space time block codes over multi cluster scattering mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "from random matrix theory to coding theory volume of a metric ball in unitary group")
  Member "schur complement based analysis of mimo zero forcing for rician fading":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed spatial multiplexing systems with hardware impairments and imperfect channel estimation under rank 1 rician fading channels")
  Member "exact mimo zero forcing detection analysis for transmit correlated rician fading":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed spatial multiplexing systems with hardware impairments and imperfect channel estimation under rank 1 rician fading channels")
  Member "asymptotic performance of linear receivers in mimo fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "comments on physical layer cryptography through massive mimo")

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)