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 "downlink performance of pilot reused hetnet with large scale antenna arrays"):
  Abstract: Considering a heterogeneous network (HetNet) where both macro base station (BS) and small cell (SC) nodes are equipped with massive antennas, this paper studies the performance for multiple-input multiple-output (MIMO) downlinks when the macro and small cells share the same spectrum and hence interfere with each other. Suppose that the large-scale antenna arrays at both macro BS and SC nodes employ maximum-ratio transmission (MRT) or zero-forcing transmission (ZFT) precoding, and transmit data streams to the served users simultaneously. A new pilot reuse pattern among SCs is proposed for channel estimation. Taking into account imperfect channel state information (CSI), capacity lower bounds for MRT and ZFT are derived, respectively, in closed-form expressions involving only statistical CSI. Then asymptotic analyses for massive arrays are presented under specific power scaling laws. Subsequently, two user scheduling algorithms, greedy scheduling algorithm and asymptotical scheduling algorithm (ASA), are proposed based on derived capacity lower bounds and asymptotic analyses, respectively. ASA is demonstrated to be a near optimal in the asymptotic regime and has low complexity. Finally, the derived closed-form expressions are verified to be accurate predictors of the system performance by Monte-Carlo simulations. Numerical results demonstrate the effectiveness of asymptotic analysis and proposed user scheduling schemes.

Includes members:
  Member "on the required number of antennas in a point to point large but finite mimo system outage limited scenario":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a genetic algorithm based beamforming approach for delay constrained networks")
  Member "optimizing user association and spectrum allocation in hetnets a utility perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resource allocation in green dense cellular networks complexity and algorithms")
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "massive mimo meets hetnet interference coordination through spatial blanking":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "non coherent detection and bit error rate for an ambient backscatter link in time selective fading")
  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)