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: "a lower bound on the noncoherent capacity pre log for the mimo channel with temporally correlated fading"
  Abstract: We derive a lower bound on the capacity pre-log of a temporally correlated Rayleigh block-fading multiple-input multiple-output (MIMO) channel with T transmit antennas and R receive antennas in the noncoherent setting (no a priori channel knowledge at the transmitter and the receiver). In this model, the fading process changes independently across blocks of length L and is temporally correlated within each block for each transmit-receive antenna pair, with a given rank Q of the corresponding correlation matrix. Our result implies that for almost all choices of the coloring matrix that models the temporal correlation, the pre-log can be lower-bounded by T(1-1/L) for T <= (L-1)/Q provided that R is sufficiently large. The widely used constant block-fading model is equivalent to the temporally correlated block-fading model with Q = 1 for the special case when the temporal correlation for each transmit-receive antenna pair is the same, which is unlikely to be observed in practice. For the constant block-fading model, the capacity pre-log is given by T(1-T/L), which is smaller than our lower bound for the case Q = 1. Thus, our result suggests that the assumptions underlying the constant block- fading model lead to a pessimistic result for the capacity pre-log.

Connected through hyperedge HE-1 (induced by source paper "degrees of freedom of generic block fading mimo channels without a priori channel state information"):
  with members:
    - "generic correlation increases noncoherent mimo capacity"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "capacity pre log of noncoherent simo channels via hironaka s theorem"
    - "on the capacity of large mimo block fading channels"
    - "noncoherent simo pre log via resolution of singularities"
    - "high snr capacity of wireless communication channels in the noncoherent setting a primer"
    - "on the sensitivity of continuous time noncoherent fading channel capacity"
    - "the simo pre log can be larger than the siso pre log"

Connected through hyperedge HE-2 (induced by source paper "generic correlation increases noncoherent mimo capacity"):
  with members:
    - "capacity pre log of noncoherent simo channels via hironaka s theorem"
    - "joint spatial division and multiplexing"
    - "on the capacity of large mimo block fading channels"

Connected through hyperedge HE-3 (induced by source paper "capacity pre log of noncoherent simo channels via hironaka s theorem"):
  with members:
    - "on the capacity of large mimo block fading channels"
    - "noncoherent simo pre log via resolution of singularities"
    - "capacity pre log of simo correlated block fading channels"
    - "the simo pre log can be larger than the siso pre log"

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)