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 mimo zero forcing detection analysis for transmit correlated rician fading"
  Abstract: We analyze the performance of multiple input/multiple output (MIMO) communications systems employing spatial multiplexing and zero-forcing detection (ZF). The distribution of the ZF signal-to-noise ratio (SNR) is characterized when either the intended stream or interfering streams experience Rician fading, and when the fading may be correlated on the transmit side. Previously, exact ZF analysis based on a well-known SNR expression has been hindered by the noncentrality of the Wishart distribution involved. In addition, approximation with a central-Wishart distribution has not proved consistently accurate. In contrast, the following exact ZF study proceeds from a lesser-known SNR expression that separates the intended and interfering channel-gain vectors. By first conditioning on, and then averaging over the interference, the ZF SNR distribution for Rician-Rayleigh fading is shown to be an infinite linear combination of gamma distributions. On the other hand, for Rayleigh-Rician fading, the ZF SNR is shown to be gamma-distributed. Based on the SNR distribution, we derive new series expressions for the ZF average error probability, outage probability, and ergodic capacity. Numerical results confirm the accuracy of our new expressions, and reveal effects of interference and channel statistics on performance.

Connected through hyperedge HE-1 (induced by source paper "closed form performance analysis of linear mimo receivers in general fading scenarios"):
  with members:
    - "performance of massive mimo uplink with zero forcing receivers under delayed channels"
    - "on the outage capacity of orthogonal space time block codes over multi cluster scattering mimo channels"
    - "schur complement based analysis of mimo zero forcing for rician fading"
    - "asymptotic performance of linear receivers in mimo fading channels"

Connected through hyperedge HE-2 (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-3 (induced by source paper "exact sf zf analysis and computer algebra aided evaluation in rank 1 los rician fading"):
  with members:
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "massive mimo ten myths and one critical question"
    - "mimo zero forcing performance evaluation using the holonomic gradient method"
    - "power scaling of uplink massive mimo systems with arbitrary rank channel means"
    - "schur complement based analysis of mimo zero forcing for rician fading"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "interactive interference alignment"

Connected through hyperedge HE-4 (induced by source paper "mimo zero forcing performance evaluation using the holonomic gradient method"):
  with members:
    - "schur complement based analysis of mimo zero forcing for rician fading"
    - "performance analysis of macrodiversity mimo systems with mmse and zf receivers in flat rayleigh fading"
    - "diversity of mmse mimo receivers"

Connected through hyperedge HE-5 (induced by source paper "los based conjugate beamforming and power scaling law in massive mimo systems"):
  with members:
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "on capacity of large scale mimo multiple access channels with distributed sets of correlated antennas"
    - "massive mimo how many antennas do we need"
    - "energy and spectral efficiency of very large multiuser mimo systems"

Connected through hyperedge HE-6 (induced by source paper "schur complement based analysis of mimo zero forcing for rician fading"):
  with members:
    - "mimo networks the effects of interference"

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)