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 "asymptotic capacity and optimal precoding in mimo multi hop relay networks"):
  Abstract: A multihop relaying system is analyzed where data sent by a multi-antenna source is relayed by successive multi-antenna relays until it reaches a multi-antenna destination. Assuming correlated fading at each hop, each relay receives a faded version of the signal from the previous level, performs linear precoding and retransmits it to the next level. Using free probability theory and assuming that the noise power at relays- but not at destination- is negligible, the closed-form expression of the asymptotic instantaneous end-to-end mutual information is derived as the number of antennas at all levels grows large. The so-obtained deterministic expression is independent from the channel realizations while depending only on channel statistics. This expression is also shown to be equal to the asymptotic average end-to-end mutual information. The singular vectors of the optimal precoding matrices, maximizing the average mutual information with finite number of antennas at all levels, are also obtained. It turns out that these vectors are aligned to the eigenvectors of the channel correlation matrices. Thus, they can be determined using only the channel statistics. As the structure of the singular vectors of the optimal precoders is independent from the system size, it is also optimal in the asymptotic regime.

Includes members:
  Member "asymptotic capacity of large fading relay networks with random node failures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymptotic capacity of large relay networks with conferencing links")
  Member "on the non coherent wideband multipath fading relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the geometry of wireless network multicast in 2 d")
  Member "asymptotic capacity and optimal precoding strategy of multi level precode forward in correlated channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "from spectrum pooling to space pooling opportunistic interference alignment in mimo cognitive networks")
  Member "diversity of mimo multihop relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "apply artificial noise to secure fading relay networks a ser based approach")
  Member "capacity scaling for mimo two way relaying":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal dof region for the asymmetric two pair mimo two way relay channel")
  Member "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)