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 "multipair two way relay network with harvest then transmit users resolving pairwise uplink downlink coupling"):
  Abstract: While two-way relaying is a promising way to enhance the spectral efficiency of wireless networks, the imbalance of relay-user distances may lead to excessive wireless power at the nearby users. To exploit the excessive power, the recently proposed harvest-then-transmit technique can be applied. However, it is well known that harvest-then-transmit introduces uplink-downlink coupling for a user. Together with the codependent relationship between paired users and interference among multiple user pairs, wirelessly powered two-way relay network suffers from the unique pairwise uplink-downlink coupling, and the joint uplink-downlink network design is nontrivial. To this end, for the one pair users case, we show that a global optimal solution can be obtained. For the general case of multipair users, based on the rank-constrained difference of convex program, a convergence guaranteed iterative algorithm with an efficient initialization is proposed. Furthermore, a lower bound to the performance of the optimal solution is derived by introducing virtual receivers at relay. Numerical results on total transmit power show that the proposed algorithm achieves a transmit power value close to the lower bound.

Includes members:
  Member "rank two beamforming and power allocation in multicasting relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reel bf design achieving the sdp bound for downlink beamforming with arbitrary shaping constraints")
  Member "on the efficiency of far field wireless power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "joint beamforming optimization and power control for full duplex mimo two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "full duplex transmission optimization for bi directional mimo links with qos guarantees")
  Member "spatial domain simultaneous information and power transfer for mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transmit precoding and receive power splitting for harvested power maximization in mimo swipt systems")
  Member "joint transceiver and power splitter design over two way relaying channel with lattice codes and energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beamforming for simultaneous wireless information and power transfer in two way relay channels")
  Member "secure and green swipt in distributed antenna networks with limited backhaul capacity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "wireless networks with rf energy harvesting a contemporary survey":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "beamforming for miso interference channels with qos and rf energy transfer":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "specific absorption rate aware beamforming in miso downlink swipt 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)