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: "an efficient manifold algorithm for constructive interference based constant envelope precoding"
  Abstract: In this letter, we propose a novel manifold-based algorithm to solve the constant envelope (CE) precoding problem with interference exploitation. For a given power budget, we design the precoded symbols subject to the CE constraints, such that the constructive effect of the multiuser interference is maximized. While the objective function for the original problem is not complex differentiable, we consider the smooth approximation of its real representation, and map it onto a Riemannian manifold. By using the Riemmanian conjugate gradient algorithm, a local minimizer can be efficiently found. The complexity of the algorithm is analytically derived in terms of floating-points operations (flops) per iteration. Simulations show that the proposed algorithm outperforms the conventional methods on both symbol error rate and computational complexity.

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"
    - "psk precoding in multi user miso systems"
    - "massive mimo downlink 1 bit precoding with linear programming for psk signaling"
    - "interference exploitation in full duplex communications trading interference power for both uplink and downlink power savings"

Connected through hyperedge HE-2 (induced by source paper "one bit precoding and constellation range design for massive mimo with qam signaling"):
  with members:
    - "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"
    - "massive mimo downlink 1 bit precoding with linear programming for psk signaling"
    - "uplink performance of wideband massive mimo with one bit adcs"
    - "analysis of one bit quantized precoding for the multiuser massive mimo downlink"
    - "energy efficient symbol level precoding in multiuser miso based on relaxed detection region"
    - "symbol level multiuser miso precoding for multi level adaptive modulation"

Connected through hyperedge HE-3 (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"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "toward dual functional radar communication systems optimal waveform design"):
  with members:
    - "adaptive interference removal for uncoordinated radar communication coexistence"
    - "joint design of overlaid communication systems and pulsed radars"
    - "mu mimo communications with mimo radar from co existence to joint transmission"
    - "robust mimo beamforming for cellular and radar coexistence"
    - "interference exploitation for radar and cellular coexistence the power efficient approach"
    - "an efficient global algorithm for single group multicast beamforming"
    - "optimum co design for spectrum sharing between matrix completion based mimo radars and a mimo communication system"
    - "riemannian dictionary learning and sparse coding for positive definite matrices"

Connected through hyperedge HE-5 (induced by source paper "minimum symbol error rate based constant envelope precoding for multiuser massive miso downlink"):
  with members:
    - "one bit massive mimo precoding via a minimum symbol error probability design"
    - "constant envelope precoding for mimo systems"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "per antenna constant envelope precoding for large multi user mimo systems"

Connected through hyperedge HE-6 (induced by source paper "mu mimo communications with mimo radar from co existence to joint transmission"):
  with members:
    - "robust mimo beamforming for cellular and radar coexistence"
    - "interference exploitation for radar and cellular coexistence the power efficient approach"
    - "coordinated multicell multicast beamforming based on manifold optimization"
    - "coexistence analysis between radar and cellular system in los channel"
    - "optimum co design for spectrum sharing between matrix completion based mimo radars and a mimo communication system"
    - "target detection performance of spectrum sharing mimo radars"
    - "manopt a matlab toolbox for optimization on manifolds"

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)