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 "wireless information and power transfer in full duplex systems with massive antenna arrays"):
  Abstract: We consider a multiuser wireless system with a full-duplex hybrid access point (HAP) that transmits to a set of users in the downlink channel, while receiving data from a set of energy-constrained sensors in the uplink channel. We assume that the HAP is equipped with a massive antenna array, while all users and sensor nodes have a single antenna. We adopt a time-switching protocol where in the first phase, sensors are powered through wireless energy transfer from HAP and HAP estimates the downlink channel of the users. In the second phase, sensors use the harvested energy to transmit to the HAP. The downlink-uplink sum-rate region is obtained by solving downlink sum-rate maximization problem under a constraint on uplink sum-rate. Moreover, assuming perfect and imperfect channel state information, we derive expressions for the achievable uplink and downlink rates in the large-antenna limit and approximate results that hold for any finite number of antennas. Based on these analytical results, we obtain the power-scaling law and analyze the effect of the number of antennas on the cancellation of intra-user interference and the self-interference.

Includes members:
  Member "on the feasibility of wireless energy transfer using massive antenna arrays":
    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 "throughput optimization for massive mimo systems powered by wireless energy transfer":
    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 "multipair full duplex relaying with massive arrays and linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "relaying protocols for wireless energy harvesting and information processing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")
  Member "energy and spectral efficiency of very large multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")

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)