human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "generalized degrees freedom of noncoherent mimo with asymmetric links"):
  with members:
    - "enhancing multiuser mimo through opportunistic d2d cooperation"
    - "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"
    - "capacity pre log of noncoherent simo channels via hironaka s theorem"
    - "on the capacity of large mimo block fading channels"
    - "on noncoherent fading relay channels at high signal to noise ratio"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "entropy and source coding for integer dimensional singular random variables"):
  with members:
    - "degrees of freedom in vector interference channels"

Connected through hyperedge HE-3 (induced by source paper "oversampling increases the pre log of noncoherent rayleigh fading channels"):
  with members:
    - "on wiener phase noise channels at high signal to noise ratio"
    - "capacity pre log of noncoherent simo channels via hironaka s theorem"
    - "on the capacity of large mimo block fading channels"
    - "high snr capacity of wireless communication channels in the noncoherent setting a primer"
    - "on the sensitivity of continuous time noncoherent fading channel capacity"
    - "increased capacity per unit cost by oversampling"

Question: Please tell me which class the center node 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)