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 "mse optimal 1 bit precoding for multiuser mimo via branch and bound"):
  Abstract: In this paper, we solve the sum mean-squared error (MSE)-optimal 1-bit quantized precoding problem exactly for small-to-moderate sized multiuser multiple-input multiple-output (MU-MIMO) systems via branch and bound. To this end, we reformulate the original NP-hard precoding problem as a tree search and deploy a number of strategies that improve the pruning efficiency without sacrificing optimality. We evaluate the error-rate performance and the complexity of the resulting 1-bit branch-and-bound (BB-1) precoder, and compare its efficacy to that of existing, suboptimal algorithms for 1-bit precoding in MU-MIMO systems.

Includes members:
  Member "1 bit massive mu mimo precoding in vlsi":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "branch and bound precoding for multiuser mimo systems with 1 bit quantization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "study of coarse quantization aware block diagonalization algorithms for mimo systems with low resolution")
  Member "nonlinear precoding for phase quantized constant envelope massive mu mimo ofdm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "massive mu mimo ofdm uplink with direct rf sampling and 1 bit adcs")
  Member "massive mu mimo ofdm downlink with one bit dacs and linear precoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "training for channel estimation in nonlinear multi antenna transceivers")
  Member "downlink achievable rate analysis in massive mimo systems with one bit dacs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "minimum ber precoding in 1 bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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 "an overview of signal processing techniques for millimeter wave mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")
  Member "five disruptive technology directions for 5g":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep learning enabled optimization of downlink beamforming under per antenna power constraints algorithms and experimental demonstration")

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)