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 "massive mimo with non ideal arbitrary arrays hardware scaling laws and circuit aware design"):
  Abstract: Massive multiple-input multiple-output (MIMO) systems are cellular networks where the base stations (BSs) are equipped with unconventionally many antennas, deployed on co-located or distributed arrays. Huge spatial degrees-of-freedom are achieved by coherent processing over these massive arrays, which provide strong signal gains, resilience to imperfect channel knowledge, and low interference. This comes at the price of more infrastructure; the hardware cost and circuit power consumption scale linearly/affinely with the number of BS antennas    $N$  . Hence, the key to cost-efficient deployment of large arrays is low-cost antenna branches with low circuit power, in contrast to today's conventional expensive and power-hungry BS antenna branches. Such low-cost transceivers are prone to hardware imperfections, but it has been conjectured that the huge degrees-of-freedom would bring robustness to such imperfections. We prove this claim for a generalized uplink system with multiplicative phase-drifts, additive distortion noise, and noise amplification. Specifically, we derive closed-form expressions for the user rates and a scaling law that shows how fast the hardware imperfections can increase with    $N$   while maintaining high rates. The connection between this scaling law and the power consumption of different transceiver circuits is rigorously exemplified. This reveals that one can make the circuit power increase as    $\sqrt{N} $  , instead of linearly, by careful circuit-aware system design.

Includes members:
  Member "capacity of simo and miso phase noise channels with common separate oscillators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "massive mu mimo ofdm uplink with hardware impairments modeling and analysis")
  Member "uplink performance of time reversal mrc in massive mimo systems subject to phase noise":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "achieving phase coherency and gain stability in active antenna arrays for sub 6 ghz fdd and tdd fd mimo challenges and solutions")
  Member "massive mimo performance evaluation based on measured propagation data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "massive mimo asymptotics for ray based propagation channels")
  Member "optimal multiuser transmit beamforming a difficult problem with a simple solution structure":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "massive mimo has unlimited capacity")
  Member "on the impact of oscillator phase noise on the uplink performance in a massive mimo ofdm system":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal reference signal design for phase noise compensation in multi carrier massive mimo systems")
  Member "filter bank multicarrier for massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "filter bank multicarrier in massive mimo analysis and channel equalization")
  Member "massive mimo systems with non ideal hardware energy efficiency estimation and capacity limits":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")

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)