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: "noncoherent simo pre log via resolution of singularities"
  Abstract: We establish a lower bound on the noncoherent capacity pre-log of a temporally correlated Rayleigh block-fading single-input multiple-output (SIMO) channel. Our result holds for arbitrary rank Q of the channel correlation matrix, arbitrary block-length L > Q, and arbitrary number of receive antennas R, and includes the result in Morgenshtern et al. (2010) as a special case. It is well known that the capacity pre-log for this channel in the single-input single-output (SISO) case is given by 1−Q/L, where Q/L is the penalty incurred by channel uncertainty. Our result reveals that this penalty can be reduced to 1/L by adding only one receive antenna, provided that L ≥ 2Q − 1 and the channel correlation matrix satisfies mild technical conditions. The main technical tool used to prove our result is Hironaka's celebrated theorem on resolution of singularities in algebraic geometry.

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"
    - "a lower bound on the noncoherent capacity pre log for the mimo channel with temporally correlated fading"
    - "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"
    - "the simo pre log can be larger than the siso pre log"

Connected through hyperedge HE-2 (induced by source paper "achievability of nonlinear degrees of freedom in correlatively changing fading channels"):
  with members:
    - "capacity pre log of noncoherent simo channels via hironaka s theorem"

Connected through hyperedge HE-3 (induced by source paper "a lower bound on the noncoherent capacity pre log for the mimo channel with temporally correlated fading"):
  with members:
    - "capacity pre log of simo correlated block fading channels"
    - "the simo pre log can be larger than the siso pre log"

Connected through hyperedge HE-4 (induced by source paper "capacity pre log of noncoherent simo channels via hironaka s theorem"):
  with members:
    - "a lower bound on the noncoherent capacity pre log for the mimo channel with temporally correlated fading"
    - "on the capacity of large mimo block fading channels"
    - "capacity pre log of simo correlated block fading channels"
    - "the simo pre log can be larger than the siso pre log"

Connected through hyperedge HE-5 (induced by source paper "capacity pre log of simo correlated block fading channels"):
  with members:
    - "high snr capacity of wireless communication channels in the noncoherent setting a primer"
    - "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)