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 "analog spatial decoupling for tackling the near far problem in wirelessly powered communications"):
  Abstract: A practical architecture for wirelessly powered communications (WPC) with dedicated power beacons (PBs) deployed in existing cellular networks, called PB-assisted WPC, is considered in this paper. Assuming those PBs can access to backhaul network and perform simultaneous wireless information and power transfer (SWIPT) to the energy constrained users, the near-far problem in the PB-assisted WPC system is first identified. Specifically, the significant difference of the received power of SWIPT signal (from a PB) and information transfer (IT) signal (from a base station) due to different transmission ranges leads to extremely small signal-to-quantization-noise ratio (SQNR) for the IT signal after quantization of the mixed signals. To retrieve the information carried by the SWIPT and IT signals respectively, it is essential to decouple the strong SWIPT and the weak IT signals in analog domain. To this end, a novel technique called analog spatial decoupling using only simple components such as phase shifters and adders is proposed in this paper. In particular, for the single-PB case, the optimal Fourier based and Hadamard based schemes are proposed for implementing the analog spatial decoupling. For the multiple-PB case, the corresponding design problem is more challenging, making it hard to extend the solution for the single-PB counterpart. To tackle this problem, a systematic solution approach is proposed for analog decoupling with multiple PBs.

Includes members:
  Member "throughput optimization for massive mimo systems powered by wireless energy transfer":
    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 "spatial throughput maximization of wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "wireless information and power transfer in relay systems with multiple antennas and interference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "cutting last wires for mobile communication by microwave power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wirelessly powered data aggregation for iot via over the air functional computation beamforming and power control")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "wireless information and power transfer with full duplex relaying":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on maximizing information reliability in wireless powered cooperative 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)