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 "approximate random matrix models for generalized fading mimo channels"):
  Abstract: Approximate random matrix models for $\kappa-\mu$ and $\eta-\mu$ faded multiple input multiple output (MIMO) communication channels are derived in terms of a complex Wishart matrix by keeping the degree of freedom constrained to the number of transmitting antennas and by matching matrix variate moments. The utility of the result is demonstrated in a) computing the average capacity/rate of $\kappa-\mu$/$\eta-\mu$ MIMO systems b) computing Symbol Error Rate (SER) for optimum combining with Rayleigh faded users and an arbitrary number of $\kappa-\mu$ and $\eta-\mu$ faded interferers. These approximate expressions are compared with Monte-Carlo simulations and a close match is observed.

Includes members:
  Member "throughput analysis of massive mimo uplink with low resolution adcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "performance analysis of mixed adc massive mimo systems over rician fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "on the spectral efficiency of massive mimo systems with low resolution adcs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multiple antenna technologies for beyond 5g")
  Member "spectral efficiency of mixed adc receivers for massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "massive mimo ten myths and one critical question":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep learning for massive mimo channel state acquisition and feedback")
  Member "low power analog to digital conversion in millimeter wave systems impact of resolution and bandwidth on performance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "uplink achievable rate for massive mimo systems with low resolution adc":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  Member "secrecy capacity analysis over kappa mu fading channels theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "performance analysis of physical layer security over fluctuating beckmann fading channels")

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)