human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "interference exploitation precoding for multi level modulations closed form solutions"):
  Abstract: Author(s): Li, Ang; Masouros, Christos; Li, Yonghui; Vucetic, Branka; Swindlehurst, A Lee | Abstract: In this paper, we study closed-form interference-exploitation precoding for multi-level modulations in the downlink of multi-user multiple-input single-output (MU-MISO) systems. We consider two distinct cases: first, for the case where the number of served users is not larger than the number of transmit antennas at the base station (BS), we mathematically derive the optimal precoding structure based on the Karush-Kuhn-Tucker (KKT) conditions. By formulating the dual problem, the precoding problem for multi-level modulations is transformed into a pre-scaling operation using quadratic programming (QP) optimization. We further consider the case where the number of served users is larger than the number of transmit antennas at the BS. By employing the pseudo inverse, we show that the optimal solution of the pre-scaling vector is equivalent to a linear combination of the right singular vectors corresponding to zero singular values, and derive the equivalent QP formulation. We also present the condition under which multiplexing more streams than the number of transmit antennas is achievable. For both considered scenarios, we propose a modified iterative algorithm to obtain the optimal precoding matrix, as well as a sub-optimal closed-form precoder. Numerical results validate our derivations on the optimal precoding structures for multi-level modulations, and demonstrate the superiority of interference-exploitation precoding for both scenarios.

Includes members:
  Member "interference exploitation in full duplex communications trading interference power for both uplink and downlink power savings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantized constant envelope precoding with psk and qam signaling")
  Member "symbol level multiuser miso precoding for multi level adaptive modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantized constant envelope precoding with psk and qam signaling")
  Member "constructive multiuser interference in symbol level precoding for the miso downlink channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "one bit precoding and constellation range design for massive mimo with qam signaling")
  Member "exploiting known interference as green signal power for downlink beamforming optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rethinking secure precoding via interference exploitation a smart eavesdropper perspective")
  Member "rethinking the role of interference in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interference prediction in wireless networks stochastic geometry meets recursive filtering")
  Member "computationally efficient robust beamforming for sinr balancing in multicell downlink with applications to large antenna array systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interference exploitation precoding made practical closed form solutions with optimal performance")
  Member "quantized csi based tomlinson harashima precoding in multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "interference exploitation precoding made practical closed form solutions with optimal performance")

Question: Please tell me which class the source paper 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)