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 "mixed monotonic programming for fast global optimization"):
  Abstract: While globally optimal solutions to convex programs can be computed efficiently in polynomial time, this is, in general, not possible for nonconvex optimization problems. Therefore, locally optimal approaches or other efficient suboptimal heuristics are usually applied for practical implementations. However, there is also a strong interest in computing globally optimal solutions of nonconvex problems in offline simulations in order to benchmark the faster suboptimal algorithms. Global solutions often rely on monotonicity properties. A common approach is to reformulate problems into a canonical form of a monotonic optimization problem, where the monotonicity becomes evident, but this often comes at the cost of nested optimizations, increased numbers of variables, and/or slow convergence. The framework of mixed monotonic programming (MMP) proposed in this paper is a more direct approach that exploits hidden monotonicity properties without performance-deteriorating reformulations. By means of a wide range of application examples from the area of signal processing for communications (including energy efficiency for green communications, resource allocation in interference networks, scheduling for fairness and quality of service, as well as beamformer design in multiantenna systems), we demonstrate that the novel MMP approach leads to tremendous complexity reductions compared to state-of-the-art methods for global optimization.

Includes members:
  Member "optimization of weighted individual energy efficiencies in interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient global optimal resource allocation in non orthogonal interference networks")
  Member "efficient global optimal resource allocation in non orthogonal interference networks":
    also connected through other hyperedges:
      (none)
  Member "energy efficient power control a look at 5g wireless technologies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficiency optimization for downlink massive mimo with statistical csit")
  Member "resource allocation for energy efficient 3 way relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")
  Member "robust monotonic optimization framework for multicell miso systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust resource allocation for pd noma based miso heterogeneous networks with comp technology")
  Member "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "framework for link level energy efficiency optimization with informed transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "mapel achieving global optimality for a non convex wireless power control problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sum throughput maximization in multi tag backscattering to multiantenna reader")

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)