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 "beamforming on the miso interference channel with multi user decoding capability"):
  Abstract: This paper considers the multiple-input-single-output interference channel (MISO-IC) with interference decoding capability (IDC), so that the interference signal can be decoded and subtracted from the received signal. On the MISO-IC with single user decoding, transmit beamforming vectors are classically designed to reach a compromise between mitigating the generated interference (zero forcing of the interference) or maximizing the energy at the desired user. The particularly intriguing problem arising in the multi-antenna IC with IDC is that transmitters may now have the incentive to amplify the interference generated at the non-intended receivers, in the hope that Rxs have a better chance of decoding the interference and removing it. This notion completely changes the previous paradigm of balancing between maximizing the desired energy and reducing the generated interference, thus opening up a new dimension for the beamforming design strategy. #R##N#Our contributions proceed by proving that the optimal rank of the transmit precoders, optimal in the sense of Pareto optimality and therefore sum rate optimality, is rank one. Then, we investigate suitable transmit beamforming strategies for different decoding structures and characterize the Pareto boundary. As an application of this characterization, we obtain a candidate set of the maximum sum rate point} which at least contains the set of sum rate optimal beamforming vectors. We derive the Maximum-Ratio-Transmission (MRT) optimality conditions. Inspired by the MRT optimality conditions, we propose a simple algorithm that achieves maximum sum rate in certain scenarios and suboptimal, in other scenarios comparing to the maximum sum rate.

Includes members:
  Member "rate region frontiers for n user interference channel with interference as noise":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "full duplex radio for uplink downlink wireless access with spatially random nodes")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "generalized degrees of freedom of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)