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 "mimo zero forcing performance evaluation using the holonomic gradient method"):
  Abstract: For multiple-input–multiple-output (MIMO) spatial-multiplexing transmission, zero-forcing (ZF) detection is appealing because of its low complexity. Our recent MIMO ZF performance analysis for Rician–Rayleigh fading, which is relevant in heterogeneous networks, has yielded for the ZF outage probability and ergodic capacity infinite-series expressions. Because they arose from expanding the confluent hypergeometric function    $_{1}\!F_{1} (\cdot,\cdot,\sigma) $   around 0, they do not converge numerically at realistically high Rician    $K$  -factor values. Therefore, herein, we seek to take advantage of the fact that    $_{1}\!F_{1} (\cdot,\cdot,\sigma)$   satisfies a differential equation, i.e., it is a   holonomic   function. Holonomic functions can be computed by the   holonomic gradient method   (HGM) , i.e., by numerically solving the satisfied differential equation. Thus, we first reveal that the moment generating function (m.g.f.) and probability density function (p.d.f.) of the ZF signal-to-noise ratio (SNR) are holonomic. Then, from the differential equation for    $_{1}\!F_{1} (\cdot,\cdot,\sigma) $  , we deduce those satisfied by the SNR m.g.f. and p.d.f. and demonstrate that the HGM helps compute the p.d.f. accurately at practically relevant values of    $K$  . Finally, numerical integration of the SNR p.d.f. produced by HGM yields accurate ZF outage probability and ergodic capacity results.

Includes members:
  Member "schur complement based analysis of mimo zero forcing for rician fading":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "closed form performance analysis of linear mimo receivers in general fading scenarios")
  Member "performance analysis of macrodiversity mimo systems with mmse and zf receivers in flat rayleigh fading":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "uplink analysis of large mu mimo systems with space constrained arrays in ricean fading")
  Member "exact mimo zero forcing detection analysis for transmit correlated rician fading":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "closed form performance analysis of linear mimo receivers in general fading scenarios")
  Member "diversity of mmse mimo receivers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "orthogonal precoding for ultra reliable wireless communication links")

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)