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 "impact of transceiver power consumption on the energy efficiency of zero forcing detector in massive mimo systems"):
  Abstract: We consider the impact of transceiver power consumption on the energy efficiency (EE) of the zero-forcing (ZF) detector in the uplink of massive MIMO systems, where a base station (BS) with M antennas communicates coherently with K single antenna user terminals (UTs). We consider the problem of maximizing the EE with respect to (M, K) for a fixed sum spectral efficiency. Through analysis, we study the impact of system parameters on the optimal EE. System parameters consists of the average channel gain to the users and the power consumption parameters (PCPs) (e.g., power consumed by each RF antenna/ receiver at BS). When the average user channel gain is high or else the BS/UT design is power inefficient, our analysis reveals that it is optimal to have a few BS antennas and a single user, i.e., nonmassive MIMO regime. Similarly, when the channel gain is small or else the BS/UT design is power efficient, it is optimal to have a larger (M, K), i.e., massive MIMO regime. Tight analytical bounds on the optimal EE are proposed for both these regimes. The impact of the system parameters on the optimal EE is studied, and several interesting insights are drawn.

Includes members:
  Member "massive mimo systems with non ideal hardware energy efficiency estimation and capacity limits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo networks")
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  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 "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  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)