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 "capacity pre log of noncoherent simo channels via hironaka s theorem"):
  Abstract: We find the capacity pre-log of a temporally correlated Rayleigh block-fading SIMO channel in the noncoherent setting. It is well known that for block-length L and rank of the channel covariance matrix equal to Q, the capacity pre-log in the SISO case is given by 1-Q/L. Here, Q/L can be interpreted as the pre-log penalty incurred by channel uncertainty. Our main result reveals that, by adding only one receive antenna, this penalty can be reduced to 1/L and can, hence, be made to vanish in the large-L limit, even if Q/L remains constant as L goes to infinity. Intuitively, even though the SISO channels between the transmit antenna and the two receive antennas are statistically independent, the transmit signal induces enough statistical dependence between the corresponding receive signals for the second receive antenna to be able to resolve the uncertainty associated with the first receive antenna's channel and thereby make the overall system appear coherent. The proof of our main theorem is based on a deep result from algebraic geometry known as Hironaka's Theorem on the Resolution of Singularities.

Includes members:
  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-1 (induced by source paper "degrees of freedom of generic block fading mimo channels without a priori channel state information")
  Member "on the capacity of large mimo block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "degrees of freedom of generic block fading mimo channels without a priori channel state information")
  Member "capacity pre log of simo correlated block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a lower bound on the noncoherent capacity pre log for the mimo channel with temporally correlated fading")
  Member "the simo pre log can be larger than the siso pre log":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "degrees of freedom of generic block fading mimo channels without a priori channel state information")

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)