human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "optimal design of energy and spectral efficiency tradeoff in one bit massive mimo systems"
  Abstract: Author(s): Li, Yongzhi; Tao, Cheng; Mezghani, Amine; Swindlehurst, A Lee; Seco-Granados, Gonzalo; Liu, Liu | Abstract: This paper considers a single-cell massive multiple-input multiple-output (MIMO) system equipped with a base station (BS) that uses one-bit quantization and investigates the energy efficiency (EE) and spectral efficiency (SE) trade-off. We first propose a new precoding scheme and downlink power allocation strategy that results in uplink-downlink SINR duality for one-bit MIMO systems. Taking into account the effect of the imperfect channel state information, we obtain approximate closed-form expressions for the uplink and downlink achievable rates under duality with maximum ratio combining/matched-filter and zero-forcing processing. We then focus on joint optimization of the competing SE and EE objectives over the number of users, pilot training duration and operating power, using the weighted product method to obtain the EE/SE Pareto boundary. Numerical results are presented to verify our analytical resultsand demonstrate the fundamental tradeoff between EE and SE for different parameter settings.

Connected through hyperedge HE-1 (induced by source paper "multipair massive mimo relaying systems with one bit adc s and dac s"):
  with members:
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "channel estimation and performance analysis of one bit massive mimo systems"
    - "achievable uplink rates for massive mimo with coarse quantization"
    - "bayes optimal joint channel and data estimation for massive mimo with low precision adcs"
    - "downlink achievable rate analysis in massive mimo systems with one bit dacs"
    - "adc bit allocation under a power constraint for mmwave massive mimo communication receivers"
    - "mixed adc massive mimo uplink in frequency selective channels"
    - "spectral efficiency of mixed adc receivers for massive mimo systems"

Connected through hyperedge HE-2 (induced by source paper "full duplex massive mimo relaying systems with low resolution adcs"):
  with members:
    - "channel estimation and performance analysis of one bit massive mimo systems"
    - "spatio temporal waveform design for multiuser massive mimo downlink with 1 bit receivers"
    - "joint source relay design for full duplex mimo af relay systems"
    - "how much training is needed in one bit massive mimo systems at low snr"
    - "bayes optimal joint channel and data estimation for massive mimo with low precision adcs"
    - "mixed adc massive mimo"
    - "mixed adc massive mimo uplink in frequency selective channels"
    - "minimum ber precoding in 1 bit massive mimo systems"

Question: Please tell me which class the center node 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)