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 "capacity and power scaling laws for finite antenna mimo amplify and forward relay networks"):
  Abstract: In this paper, we present a novel framework that can be used to study the capacity and power scaling properties of linear multiple-input multiple-output (MIMO) $d\times d$ antenna amplify-and-forward (AF) relay networks. In particular, we model these networks as random dynamical systems (RDS) and calculate their $d$ Lyapunov exponents. Our analysis can be applied to systems with any per-hop channel fading distribution, although in this contribution we focus on Rayleigh fading. Our main results are twofold: 1) the total transmit power at the $n$th node will follow a deterministic trajectory through the network governed by the network's maximum Lyapunov exponent, 2) the capacity of the $i$th eigenchannel at the $n$th node will follow a deterministic trajectory through the network governed by the network's $i$th Lyapunov exponent. Before concluding, we concentrate on some applications of our results. In particular, we show how the Lyapunov exponents are intimately related to the rate at which the eigenchannel capacities diverge from each other, and how this relates to the amplification strategy and number of antennas at each relay. We also use them to determine the extra cost in power associated with each extra multiplexed data stream.

Includes members:
  Member "asymptotic performance analysis of a k hop amplify and forward relay mimo channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "capacity approximations for gaussian relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the arbitrarily varying relay channel")
  Member "asymptotic capacity and optimal precoding in mimo multi hop relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "average sep optimal precoding for correlated massive mimo with zf detection an asymptotic analysis")
  Member "ergodic capacity analysis of amplify and forward mimo dual hop systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dft based hybrid beamforming multiuser systems rate analysis and beam selection")
  Member "on information rates of the fading wyner cellular model via the thouless formula for the strip":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mutual information of wireless channels and block jacobi ergodic operators")
  Member "diversity of mimo multihop relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cooperation and underlay mode selection in cognitive radio network")
  Member "crystallization in large wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "apply artificial noise to secure fading relay networks a ser based approach")
  Member "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wireless mesh networking with devices equipped with multi connectivity")

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)