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 "los based conjugate beamforming and power scaling law in massive mimo systems"):
  Abstract: This paper is concerned with massive-MIMO systems over Rician flat fading channels. In order to reduce the overhead to obtain full channel state information and to avoid the pilot contamination problem, by treating the scattered component as interference, we investigate a transmit and receive conjugate beamforming (BF) transmission scheme only based on the line-of-sight (LOS) component. Under Rank-1 model, we first consider a single-user system with N transmit and M receive antennas, and focus on the problem of power-scaling law when the transmit power is scaled down proportionally to 1/MN. It can be shown that as MN grows large, the scattered interference vanishes, and the ergodic achievable rate is higher than that of the corresponding BF scheme based fast fading and minimum mean-square error (MMSE) channel estimation. Then we further consider uplink and downlink single-cell scenarios where the base station (BS) has M antennas and each of K users has N antennas. When the transmit power for each user is scaled down proportionally to 1/MN, it can be shown for finite users that as M grows without bound, each user obtains finally the same rate performance as in the single-user case. Even when N grows without bound, however, there still remains inter-user LOS interference that can not be cancelled. Regarding infinite users, there exists such a power scaling law that when K and the b-th power of M go to infinity with a fixed and finite ratio for a given b in (0, 1), not only inter-user LOS interference but also fast fading effect can be cancelled, while fast fading effect can not be cancelled if b=1. Extension to multi-cells and frequency-selective channels are also discussed shortly. Moreover, numerical results indicate that spacial antenna correlation does not have serious influence on the rate performance, and the BS antennas may be allowed to be placed compactly when M is very large.

Includes members:
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "on capacity of large scale mimo multiple access channels with distributed sets of correlated antennas":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "non bayesian activity detection large scale fading coefficient estimation and unsourced random access with a massive mimo receiver")
  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 "massive mimo how many antennas do we need":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decentralized equalization with feedforward architectures for massive mu mimo")
  Member "energy and spectral efficiency of very large multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")

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)