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 "energy efficiency with proportional rate fairness in multi relay ofdm networks"):
  Abstract: This paper investigates the energy efficiency (EE) in multiple relay aided OFDM system, where decode-and-forward (DF) relay beamforming is employed to help the information transmission. In order to explore the EE performance with user fairness for such a system, we formulate an optimization problem to maximize the EE by jointly considering several factors, the transmission mode selection (DF relay beamforming or direct-link transmission), the helping relay set selection, the subcarrier assignment and the power allocation at the source and relays on subcarriers, under nonlinear proportional rate fairness constraints, where both transmit power consumption and linearly rate-dependent circuit power consumption are taken into account. To solve the non-convex optimization problem, we propose a low-complexity scheme to approximate it. Simulation results demonstrate its effectiveness. We also investigate the effects of the circuit power consumption on system performances and observe that with both the constant and the linearly rate-dependent circuit power consumption, system EE grows with the increment of system average channel-to noise ratio (CNR), but the growth rates show different behaviors. For the constant circuit power consumption, system EE increasing rate is an increasing function of the system average CNR, while for the linearly rate-dependent one, system EE increasing rate is a decreasing function of the system average CNR. This observation is very important which indicates that by deducing the circuit dynamic power consumption per unit data rate, system EE can be greatly enhanced. Besides, we also discuss the effects of the number of users and subcarriers on the system EE performance.

Includes members:
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "wireless networks with rf energy harvesting a contemporary survey":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "network beamforming using relays with perfect channel information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capitalizing backscatter aided hybrid relay communications with wireless energy harvesting")

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)