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: "minimum symbol error rate based constant envelope precoding for multiuser massive miso downlink"
  Abstract: This paper considers the problem of constant envelope (CE) precoder designs for multiuser massive MISO downlink channels. The use of CE signals allows one to employ low-cost radio frequency chains and thereby facilitates the implementation of massive MIMO. However, the subsequent CE precoder designs are usually challenging owing to the non-convex CE constraints. The existing CE precoder designs consider minimization of some measures on the distortion levels of the received symbols, and they usually aim at improving the symbol-error rate (SER) performances. In this paper we formulate a minimum SER-based design for CE precoding. The design formulation is non-convex and we propose two low-complexity first-order algorithms using gradient projection. Curiously, our simulation results show that the proposed designs can achieve bit-error rate performance close to that of zero-forcing beamforming without CE signaling restrictions.

Connected through hyperedge HE-1 (induced by source paper "efficient resource allocation for relay assisted computation offloading in mobile edge computing"):
  with members:
    - "joint cooperative computation and interactive communication for relay assisted mobile edge computing"
    - "joint task offloading scheduling and transmit power allocation for mobile edge computing systems"
    - "inexact block coordinate descent methods for symmetric nonnegative matrix factorization"
    - "joint computation and communication cooperation for mobile edge computing"
    - "delay optimal computation task scheduling for mobile edge computing systems"
    - "energy efficient resource allocation for mobile edge computation offloading"
    - "achievable rates for the fading half duplex single relay selection network using buffer aided relaying"
    - "joint optimization of radio and computational resources for multicell mobile edge computing"

Connected through hyperedge HE-2 (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"
    - "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"
    - "one bit precoding and constellation range design for massive mimo with qam signaling"
    - "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"

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)