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 "on energy efficient uplink multi user mimo with shared lna control"):
  Abstract: Implementation cost and power consumption are two important considerations in modern wireless communications, particularly in large-scale multi-antenna systems where the number of individual radio-frequency (RF) chains may be significantly larger than before. In this work, we propose to deploy a single low-noise amplifier (LNA) on the uplink multiple-input-multiple-output (MIMO) receiver to cover all antennas. This architecture, although favorable from the perspective of cost and power consumption, introduces challenges in the LNA gain control and user transmit power control. We formulate an energy efficiency maximization problem under practical system constraints, and prove that it is a constrained quasi-concave optimization problem. We then propose an efficient algorithm, Bisection -- Gradient Assisted Interior Point (B-GAIP), that solves this optimization problem. The optimality, convergence and complexity of B-GAIP are analyzed, and further corroborated via numerical simulations. In particular, the performance loss due to using a shared LNA as opposed to separate LNAs in each RF chain, when using B-GAIP to determine the LNA gain and user transmit power, is very small in both centralized and distributed MIMO systems.

Includes members:
  Member "uplink performance of wideband massive mimo with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "downlink achievable rate analysis in massive mimo systems with one bit dacs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "energy efficiency of distributed signal processing in wireless networks a cross layer analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "downlink non orthogonal multiple access noma in poisson networks")
  Member "mixed adc massive mimo detectors performance analysis and design optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "cell free massive mimo uniformly great service for everyone":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analysis of uav communications in cell free massive mimo systems")
  Member "capacity analysis of one bit quantized mimo systems with transmitter channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "large scale mimo versus network mimo for multicell interference mitigation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi cell sparse activity detection for massive random access massive mimo versus cooperative mimo")
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")

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)