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: "interference exploitation in full duplex communications trading interference power for both uplink and downlink power savings"
  Abstract: This paper considers a multiuser full-duplex (FD) wireless communication system, where a FD radio base station (BS) serves multiple single-antenna half-duplex (HD) uplink and downlink users simultaneously. Unlike conventional interference mitigation approaches, we propose to use the knowledge of the data symbols and the channel state information (CSI) at the FD radio BS to exploit the multi-user interference constructively rather than to suppress it. We propose a multi-objective optimisation problem (MOOP) via the weighted Tchebycheff method to study the trade-off between the two desirable system design objectives namely the total downlink transmit power minimisation and the total uplink transmit power minimisation problems at the same time ensuring the required quality-of-service (QoS) for all users. In the proposed MOOP, we adapt the QoS constraints for the downlink users to accommodate constructive interference (CI) for both generic phase shift keying (PSK) modulated signals as well as for quadrature amplitude modulated (QAM) signals. We also extended our work to a robust design to study the system with imperfect uplink, downlink and self-interference CSI. Simulation results and analysis show that, significant power savings can be obtained. More importantly, however, the MOOP approach here allows for the power saved to be traded off for both uplink and downlink power savings, leading to an overall energy efficiency improvement in the wireless link.

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"
    - "an efficient manifold algorithm for constructive interference based constant envelope precoding"

Connected through hyperedge HE-2 (induced by source paper "interference exploitation precoding for multi level modulations closed form solutions"):
  with members:
    - "symbol level multiuser miso precoding for multi level adaptive modulation"
    - "constructive multiuser interference in symbol level precoding for the miso downlink channel"
    - "exploiting known interference as green signal power for downlink beamforming optimization"
    - "rethinking the role of interference in wireless networks"
    - "computationally efficient robust beamforming for sinr balancing in multicell downlink with applications to large antenna array systems"
    - "quantized csi based tomlinson harashima precoding in multiuser mimo systems"

Connected through hyperedge HE-3 (induced by source paper "an efficient manifold algorithm for constructive interference based constant envelope precoding"):
  with members:
    - "exploiting known interference as green signal power for downlink beamforming optimization"
    - "massive mimo for next generation wireless systems"
    - "manopt a matlab toolbox for optimization on manifolds"
    - "per antenna constant envelope precoding for large multi user mimo systems"
    - "single user beamforming in large scale miso systems with per antenna constant envelope constraints the doughnut channel"

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)