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: "one bit precoding and constellation range design for massive mimo with qam signaling"
  Abstract: The use of low-resolution digital-to-analog converters (DACs) for transmit precoding provides crucial energy efficiency advantage for massive multiple-input multiple-output (MIMO) implementation. This paper formulates a quadrature amplitude modulation (QAM) constellation range and one-bit symbol-level precoding design problem for minimizing the average symbol error rate (SER) in downlink massive MIMO transmission. A tight upper-bound for SER with low-resolution DAC precoding is first derived. The derived expression suggests that the performance degradation of 1-bit precoding can be interpreted as a decrease in the effective minimum distance of the QAM constellation. Using the obtained SER expression, we propose a QAM constellation range design for the single-user case. It is shown that in the massive MIMO limit, a reasonable choice for constellation range with 1-bit symbol-level precoding is that of the infinite-resolution precoding with per-symbol power constraint, but reduced by a factor of $\sqrt{2/\pi}$ or about 0.8. The corresponding minimum distance reduction translates to about 2dB gap between the performance of 1-bit precoding and infinite-resolution precoding. This paper further proposes a low-complexity two-step heuristic algorithm for one-bit precoder design. Finally, the proposed QAM constellation range and precoder design are generalized to the multi-user downlink. We propose to scale the constellation range for infinite-resolution zero-forcing (ZF) precoding with per-symbol power constraint by the same factor of $\sqrt{2/\pi}$ for one-bit ZF precoding. The proposed 1-bit precoding scheme is shown to be within 2dB of infinite-resolution ZF precoding. In term of number of antennas, 1-bit precoding requires about 50% more antennas to achieve the same performance as infinite-resolution precoding.

Connected through hyperedge HE-1 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo"):
  with members:
    - "one bit sigma delta mimo precoding"
    - "a framework for one bit and constant envelope precoding over multiuser massive miso channels"
    - "quantized constant envelope precoding with psk and qam signaling"
    - "one bit sphere decoding for uplink massive mimo systems with one bit adcs"
    - "1 bit massive mu mimo precoding in vlsi"
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "channel estimation and performance analysis of one bit massive mimo systems"
    - "branch and bound precoding for multiuser mimo systems with 1 bit quantization"

Connected through hyperedge HE-2 (induced by source paper "one bit sigma delta mimo precoding"):
  with members:
    - "symbol level precoding is symbol perturbed zf when energy efficiency is sought"
    - "a framework for one bit and constant envelope precoding over multiuser massive miso channels"
    - "quantized constant envelope precoding with psk and qam signaling"
    - "multiuser one bit massive mimo precoding under mpsk signaling"
    - "one bit sphere decoding for uplink massive mimo systems with one bit adcs"
    - "1 bit massive mu mimo precoding in vlsi"
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "channel estimation and performance analysis of one bit massive mimo systems"

Connected through hyperedge HE-3 (induced by source paper "timing and frequency synchronization for 1 bit massive mu mimo ofdm downlink"):
  with members:
    - "directional frame timing synchronization in wideband millimeter wave systems with low resolution adcs"
    - "1 bit massive mu mimo precoding in vlsi"
    - "performance analysis for time of arrival estimation with oversampled low complexity 1 bit a d conversion"
    - "quantized precoding for multi antenna downlink channels with magiq"
    - "nonlinear precoding for phase quantized constant envelope massive mu mimo ofdm"
    - "joint cfo and channel estimation in millimeter wave systems with one bit adcs"
    - "linear precoding with low resolution dacs for massive mu mimo ofdm downlink"
    - "downlink achievable rate analysis in massive mimo systems with one bit dacs"

Connected through hyperedge HE-4 (induced by source paper "a framework for one bit and constant envelope precoding over multiuser massive miso channels"):
  with members:
    - "one bit massive mimo precoding via a minimum symbol error probability design"
    - "minimum symbol error rate based constant envelope precoding for multiuser massive miso downlink"
    - "quantized constant envelope precoding with psk and qam signaling"
    - "multiuser one bit massive mimo precoding under mpsk signaling"
    - "mse optimal 1 bit precoding for multiuser mimo via branch and bound"
    - "accelerated gradient descent escapes saddle points faster than gradient descent"
    - "nonlinear precoding for phase quantized constant envelope massive mu mimo ofdm"
    - "massive mimo downlink 1 bit precoding with linear programming for psk signaling"

Connected through hyperedge HE-5 (induced by source paper "linear precoding with low resolution dacs for massive mu mimo ofdm downlink"):
  with members:
    - "one bit massive mimo precoding via a minimum symbol error probability design"
    - "a framework for one bit and constant envelope precoding over multiuser massive miso channels"
    - "mse optimal 1 bit precoding for multiuser mimo via branch and bound"
    - "can hardware distortion correlation be neglected when analyzing uplink se in massive mimo"
    - "out of band radiation from antenna arrays clarified"
    - "1 bit massive mu mimo precoding in vlsi"
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "channel estimation and performance analysis of one 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)