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 achievable rate analysis in massive mimo systems with one bit dacs"):
  Abstract: In this letter, we investigate the downlink performance of massive multiple-input multiple-output (MIMO) systems where the base station is equipped with one-bit analogto-digital/digital-to-analog converters (ADC/DACs). Considering training-based transmission, we assume the base station (BS) employs the linear minimum mean-squared-error (LMMSE) channel estimator and treats the channel estimate as the true channel to precode the data symbols. We derive an expression for the downlink achievable rate for matched-filter (MF) precoding. A detailed analysis of the resulting power efficiency is pursued using our expression of the achievable rate. Numerical results are presented to verify our analysis. In particular it is shown that, compared with conventional massive MIMO systems, the performance loss in one-bit massive MIMO systems can be compensated for by deploying approximately 2.5 times more antennas at the BS.

Includes members:
  Member "how much training is needed in one bit massive mimo systems at low snr":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "training for channel estimation in nonlinear multi antenna transceivers")
  Member "nonlinear 1 bit precoding for massive mu mimo with higher order modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "one bit sigma delta mimo precoding")
  Member "minimum ber precoding in 1 bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new equivalent model of quantizer with noisy input and its application for adc resolution determination in an uplink mimo receiver")
  Member "mmse precoder for massive mimo using 1 bit quantization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure massive mimo communication with low resolution dacs")
  Member "uplink achievable rate for massive mimo systems with low resolution adc":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  Member "massive mimo with non ideal arbitrary arrays hardware scaling laws and circuit aware design":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "multipair full duplex relaying with massive arrays and linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "energy and spectral efficiency of very large multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)