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 "degrees of freedom of generic block fading mimo channels without a priori channel state information"):
  Abstract: We study the high-signal-to-noise-ratio capacity of generic multiple-input multiple-output (MIMO) Rayleigh block-fading channels in the noncoherent setting where neither transmitter nor receiver has a priori channel state information but both are aware of the channel statistics. In contrast to the well-established constant block-fading model, we allow the fading to vary within each block with a temporal correlation that is generic (in the sense used in the interference-alignment literature). We show that the number of degrees of freedom of a generic MIMO Rayleigh block-fading channel with T transmit antennas and block length N is given by T(1 - 1/N) provided that T < N and the number of receive antennas is at least T(N - 1)/(N - T). A comparison with the constant block-fading channel (where the fading is constant within each block) shows that, for large block lengths, generic correlation increases the number of degrees of freedom by a factor of up to four.

Includes members:
  Member "generic correlation increases noncoherent mimo capacity":
    also connected through other hyperedges:
      (none)
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "a lower bound on the noncoherent capacity pre log for the mimo channel with temporally correlated fading":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generic correlation increases noncoherent mimo capacity")
  Member "capacity pre log of noncoherent simo channels via hironaka s theorem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generalized degrees freedom of noncoherent mimo with asymmetric links")
  Member "on the capacity of large mimo block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi user detection based on expectation propagation for the non coherent simo multiple access channel")
  Member "noncoherent simo pre log via resolution of singularities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "achievability of nonlinear degrees of freedom in correlatively changing fading channels")
  Member "high snr capacity of wireless communication channels in the noncoherent setting a primer":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "short packet communications over multiple antenna rayleigh fading channels")
  Member "on the sensitivity of continuous time noncoherent fading channel capacity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "off the grid recovery of time and frequency shifts with multiple measurement vectors")

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)