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: "psk precoding in multi user miso systems"
  Abstract: We consider the downlink scenario of multiuser multiple-input-single-output (MU-MISO) communication systems with constant envelope (CE) signals emitted from each antenna. This results in energy efficient power amplifiers (PAs). We propose a holistic CE precoding scheme based on the symbol-wise minimum squared error (SMSE) criterion. Additionally, we analyze the distortions introduced by low-resolution quantization to PSK for higher energy efficiency reasons. We present three solution algorithms and examine their performance to decide for the best pick for different quantization resolutions. Our results show that good performance can be achieved with minimal loss compared to an ideal unquantized case. Finally, we analyze and discuss the results and consider the overall complexity of the precoder as well as implementation issues.

Connected through hyperedge HE-1 (induced by source paper "quantized constant envelope precoding with psk and qam signaling"):
  with members:
    - "1 bit massive mu mimo precoding in vlsi"
    - "branch and bound precoding for multiuser mimo systems with 1 bit quantization"
    - "quantized precoding for multi antenna downlink channels with magiq"
    - "nonlinear precoding for phase quantized constant envelope massive mu mimo ofdm"
    - "linear precoding with low resolution dacs for massive mu mimo ofdm downlink"
    - "massive mimo downlink 1 bit precoding with linear programming for psk signaling"
    - "an efficient manifold algorithm for constructive interference based constant envelope precoding"
    - "interference exploitation in full duplex communications trading interference power for both uplink and downlink power savings"

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)