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 "performance analysis of multi antenna relay networks over nakagami m fading channel"):
  Abstract: In this chapter, the authors present the performance of multi-antenna selective combining decode-and-#R##N#forward (SC-DF) relay networks over independent and identically distributed (i.i.d) Nakagami-m fading#R##N#channels. The outage probability, moment generation function, symbol error probability and average#R##N#channel capacity are derived in closed-form using the Signal-to-Noise-Ratio (SNR) statistical character-#R##N#istics. After that, the authors formulate the outage probability problem, optimize it with an approximated#R##N#problem, and then solve it analytically. Finally, for comparison with analytical formulas, the authors#R##N#perform some Monte-Carlo simulations.

Includes members:
  Member "performance analysis of opportunistic relaying over imperfect non identical log normal fading channels":
    also connected through other hyperedges:
      (none)
  Member "on the second order statistics of the multihop rayleigh fading channel":
    also connected through other hyperedges:
      (none)
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")

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)