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 "joint time allocation and power control in multi cell networks with load coupling energy saving and rate improvement"):
  Abstract: In this paper, we consider the problems of minimizing sum power and maximizing sum rate for multi-cell networks with load coupling, where coupling relation occurs among cells due to inter-cell interference. This coupling relation is characterized by the signal-to-interference-and-noise-ratio (SINR) coupling model with cell load vector and cell power vector as the variables. Due to the nonlinear SINR coupling model, the optimization problems for multi-cell networks with load coupling is nonconvex. To solve these nonconvex problems, we first consider the optimization problems for single-cell networks. Through variable transformations, the optimization problems can be equivalently transformed into convex problems. By solving the Karush-Kuhn-Tucker (KKT), the optimal solutions to power minimization and rate maximization problems can be obtained in closed form. Based on the theoretical findings of optimization problems for single-cell networks, we develop a distributed time allocation and power control algorithm with low complexity for sum power minimization in multi-cell networks. This algorithm is proved to be convergent and globally optimal by using the properties of standard interference function. For sum rate optimization in multi-cell networks, we also provide a distributed algorithm which yields suboptimal solution. Besides, the convergence for this distributed algorithm is proved. Numerical results illustrate the theoretical findings, showing the superiority of our solutions compared to the conventional solution of allocating uniform power for users in the same cell.

Includes members:
  Member "wireless networks with energy harvesting and power transfer joint power and time allocation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sequencing and scheduling for multi user machine type communication")
  Member "load optimization with user association in cooperative and load coupled lte networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  Member "power and load coupling in cellular networks for energy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "throughput maximization in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "analysis of cell load coupling for lte network planning and optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  Member "distributed robust multicell coordinated beamforming with imperfect csi an admm approach":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "robust urllc packet scheduling of ofdm systems")

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)