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 "rate energy region in wireless information and power transfer new receiver architecture and practical modulation"):
  Abstract: When simultaneous wireless information and power transfer is carried out, a fundamental tradeoff between achievable rate and harvested energy exists because the received power is used for two different purposes. The tradeoff is well characterized by the rate-energy region, and several techniques have been proposed to improve the achievable rate-energy region. However, the existing techniques still have a considerable loss in either energy or rate and thus the known achievable rate-energy regions are far from the ideal one. Deriving tight upper and lower bounds on the rate-energy region of our proposed scheme, we prove that the rate-energy region can be expanded almost to the ideal upper bound. Contrary to the existing techniques, in the proposed scheme, the information decoding circuit not only extracts amplitude and phase information but also combines the extracted information with the amplitude information obtained from the rectified signal. Consequently, the required energy for decoding can be minimized, and thus the proposed scheme achieves a near-optimal rate-energy region, which implies that the fundamental tradeoff in the achievable rate-energy region is nearly eliminated. To practically account for the theoretically achievable rate-energy region, we also present practical examples with an $M$-ary multi-level circular QAM with Gaussian maximum likelihood detection.

Includes members:
  Member "wireless powered communication opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "cognitive wireless powered network spectrum sharing models and throughput maximization":
    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 "throughput optimization for massive mimo systems powered by wireless energy transfer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "harvest then cooperate wireless powered cooperative communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "user cooperation in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning and fairness in energy harvesting a maximin multi armed bandits approach")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "full duplex wireless powered communication network with energy causality":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "throughput maximization in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")

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)