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 "networked mimo with fractional joint transmission in energy harvesting systems"):
  Abstract: This paper considers two base stations (BSs) powered by renewable energy serving two users cooperatively. With different BS energy arrival rates, a fractional joint transmission (JT) strategy is proposed, which divides each transmission frame into two subframes. In the first subframe, one BS keeps silent to store energy, while the other transmits data, and then, they perform zero-forcing JT (ZF-JT) in the second subframe. We consider the average sum-rate maximization problem by optimizing the energy allocation and the time fraction of ZF-JT separately. First, the sum-rate maximization for given energy budgets in each frame is analyzed. We prove that the optimal transmit power can be derived in closed form, and the optimal time fraction can be found via bi-section search. Second, an approximate dynamic programming algorithm is introduced to determine the energy allocation among frames. We adopt a linear approximation with the features associated with system states and determine the weights of features by simulation. We also operate the approximation several times with random initial policy, named policy exploration, to broaden the policy search range. Numerical results show that the proposed fractional JT greatly improves the performance. In addition, appropriate policy exploration is shown to perform close to the optimal.

Includes members:
  Member "comp meets smart grid a new communication and energy cooperation paradigm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cross layer scheduling and beamforming in smart grid powered cellular networks with heterogeneous energy coordination")
  Member "energy cooperation in energy harvesting communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "energy cooperation in cellular networks with renewable powered base stations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy sustainable paradigms and methods for future mobile networks a survey")
  Member "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "flexible functional split and power control for energy harvesting cloud radio access networks")
  Member "broadcasting with an energy harvesting rechargeable transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "age of information minimization for an energy harvesting source with updating erasures with and without feedback")
  Member "sum rate optimal power policies for energy harvesting transmitters in an interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "age minimal online policies for energy harvesting sensors with random battery recharges")
  Member "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")
  Member "optimal multiuser zero forcing with per antenna power constraints for network mimo coordination":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "linear precoding and equalization for network mimo with partial cooperation")

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)