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 "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas"):
  Abstract: Characterizing the global maximum of weighted sum-rate (WSR) for the K-user Gaussian interference channel (GIC), with the interference treated as Gaussian noise, is a key problem in wireless communication. However, due to the users' mutual interference, this problem is in general non-convex and thus cannot be solved directly by conventional convex optimization techniques. In this paper, by jointly utilizing the monotonic optimization and rate profile techniques, we develop a new framework to obtain the globally optimal power control and/or beamforming solutions to WSR maximization problems for the GICs with single-antenna transmitters and single-antenna receivers (SISO), single-antenna transmitters and multi-antenna receivers (SIMO), or multi-antenna transmitters and single-antenna receivers (MISO). Different from prior work, this paper proposes to maximize the WSR in the achievable rate region of the GIC directly by exploiting the facts that the achievable rate region is a "normal" set and the users' WSR is a strictly increasing function over the rate region. Consequently, the WSR maximization is shown to be in the form of monotonic optimization over a normal set and thus can be solved globally optimally by the existing outer polyblock approximation algorithm. However, an essential step in the algorithm hinges on how to efficiently characterize the intersection point on the Pareto boundary of the achievable rate region with any prescribed "rate profile" vector. This paper shows that such a problem can be transformed into a sequence of signal-to-interference-plus-noise ratio (SINR) feasibility problems, which can be solved efficiently by applying existing techniques. Numerical results validate that the proposed algorithms can achieve the global WSR maximum for the SISO, SIMO or MISO GIC, which serves as a performance benchmark for other heuristic algorithms.

Includes members:
  Member "robust monotonic optimization framework for multicell miso systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust resource allocation for pd noma based miso heterogeneous networks with comp technology")
  Member "cooperative interference management with miso beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "intelligent reflecting surface aided multiple access capacity region and deployment strategy")
  Member "on the optimality of beamforming for multi user miso interference channels with single user detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed asynchronous optimization framework for the miso interference channel")
  Member "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "optimal beamforming for two way multi antenna relay channel with analogue network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimization of a power splitting protocol for two way multiple energy harvesting relay system")
  Member "mapel achieving global optimality for a non convex wireless power control problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sum throughput maximization in multi tag backscattering to multiantenna reader")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)