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 "ergodic capacity analysis of wireless powered af relaying systems over alpha µ fading channels"):
  Abstract: In this paper, we consider a two-hop amplify-and- forward (AF) relaying system, where the relay node is energy-constrained and harvests energy from the source node. In the literature, there are three main energy-harvesting (EH) protocols, namely, time-switching relaying (TSR), power-splitting (PS) relaying (PSR) and ideal relaying receiver (IRR). Unlike the existing studies, in this paper, we consider α-μ fading channels. In this respect, we derive accurate unified analytical expressions for the ergodic capacity for the aforementioned protocols over independent but not identically distributed (i.n.i.d) α-μ fading channels. Three special cases of the α-μ model, namely, Rayleigh, Nakagami-m and Weibull fading channels were investigated. Our analysis is verified through numerical and simulation results. It is shown that finding the optimal value of the PS factor for the PSR protocol and the EH time fraction for the TSR protocol is a crucial step in achieving the best network performance.

Includes members:
  Member "error performance of wireless powered cognitive relay networks with interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "on the capacity of wireless powered cognitive relay network with interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the feasibility of interference alignment in compounded mimo broadcast channels with antenna correlation and mixed user classes")
  Member "simultaneous information and power transfer for broadband wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "wireless information and power transfer architecture design and rate energy tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")

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)