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 "diversity of mimo multihop relay channels part i amplify and forward"):
  Abstract: In this two-part paper, we consider the multiantenna multihop relay channels in which the source signal arrives at the destination through N independent relaying hops in series. The main concern of this work is to design relaying strategies that utilize efficient ly the relays in such a way that the diversity is maximized. In part I, we focus on the amplify-and-forward (AF) strategy with which the relays simply scale the received signal and retransmit it. More specifical ly, we characterize the diversity-multiplexing tradeoff (DMT) of the AF scheme in a general multihop channel with arbitrary number of antennas and arbitrary number of hops. The DMT is in closed-form expression as a function of the number of antennas at each node. First, we provide some basic results on the DMT of the general Rayleigh product channels. It turns out that these results have very s imple and intuitive interpretation. Then, the results are applied to the AF multihop channels which is shown to be equivalent to the Rayleigh product channel, in the DMT sense. Finally, the project-and-forward (PF) scheme, a variant of the AF scheme, is proposed. We show that the PF scheme has the same DMT as the AF scheme, while the PF can have significant power gain over the AF scheme in some cases. In par t II, we will derive the upper bound on the diversity of the multihop channels and show that it can be achieved by partitioning the multihop channel into AF subchannels.

Includes members:
  Member "diversity multiplexing tradeoff of double scattering mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymptotic analysis of rzf over double scattering channels with mmse estimation")
  Member "capacity and character expansions moment generating function and other exact results for mimo correlated channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of fractal d2d social networks with hierarchical communications")
  Member "optimal space time codes for the mimo amplify and forward cooperative channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "unmanned aerial vehicle assisted cellular communication")
  Member "approximately universal optimality over several dynamic and non dynamic cooperative diversity schemes for wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wireless coded caching a topological perspective")
  Member "approximately universal codes over slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "space time signal design for multilevel polar coding in slow fading broadcast channels")
  Member "perfect space time codes with minimum and non minimum delay for any number of antennas":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bit interleaved coded multiple beamforming with perfect coding")

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)