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 harvesting noncoherent cooperative communications"):
  Abstract: This paper investigates simultaneous wireless information and power transfer (SWIPT) in energy harvesting (EH) relay systems. Unlike existing SWIPT schemes requiring the channel state information (CSI) for coherent information delivery, we propose a noncoherent SWIPT framework for decode-and-forward (DF) relay systems bypassing the need for CSI and consequently saving energy in the network. The proposed SWIPT framework embraces power-splitting noncoherent DF (PS-NcDF) and time-switching noncoherent DF (TS-NcDF) in a unified form, and supports arbitrary M-ary noncoherent frequency-shift keying (FSK) and differential phase-shift keying (DPSK). Exact (noncoherent) maximum-likelihood detectors (MLDs) for PS-NcDF and TS-NcDF are developed in a unified form, which involves integral evaluations yet serves as the optimum performance benchmark for noncoherent SWIPT. To reduce the computational cost of the exact MLDs, we also propose closed-form approximate MLDs achieving near-optimum performance, thus serving as a practical solution for noncoherent SWIPT. Numerical results demonstrate a performance tradeoff between the first and second hops through the adjustment of time switching or power splitting parameters, whose optimal values minimizing the symbol-error rate (SER) are strictly between 0 and 1. We demonstrate that M-FSK results in a significant energy saving over M-DPSK for M >= 8; thus M-FSK may be more suitable for EH relay systems.

Includes members:
  Member "wireless networks with rf energy harvesting a contemporary survey":
    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 "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "simultaneous information and energy transfer in large scale networks with without relaying":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "a general robust linear transceiver design for multi hop amplify and forward mimo relaying systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hybrid transceiver optimization for multi hop communications")
  Member "cooperative energy harvesting networks with spatially random users":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a unified framework for non orthogonal multiple access")
  Member "matrix monotonic optimization for mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hybrid transceiver optimization for multi hop communications")
  Member "simultaneous information and power transfer for broadband wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "transmission delay minimization in wireless powered communication 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)