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 "achievable rates over doubly selective rician fading channels under peak power constraint"):
  Abstract: The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are finite and the peak-power limitation is applied in the time domain. Expression for this rate is based on a lower bound on mutual information that assume independent and identically distributed input data symbols. The lower bound is expressed as a difference of two terms. The first term is the information rate of the coherent channel with a weighted signal-to-noise ratio that results from the peak-power limitation. The second term is a penalty term, explicit in the Doppler spectrum of the channel, that captures the effect of the channel uncertainty induced by the noncoherent setting. Impact of channel parameters, such as delay and Doppler spread, on the information rate are discussed and numerical applications on an experimental Rician channel surveyed in an acoustic underwater environment are also provided.

Includes members:
  Member "noncoherent capacity of underspread fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interference cancellation and iterative detection for orthogonal time frequency space modulation")
  Member "low snr capacity of noncoherent fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity scaling in a non coherent wideband massive simo block fading channel")
  Member "on multipath fading channels at high snr":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of a class of signal dependent noise channels")
  Member "the noncoherent rician fading channel part i structure of the capacity achieving input":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a simple capacity lower bound for communication with superimposed pilots")
  Member "capacity per unit energy of fading channels with a peak constraint":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "unified capacity limit of non coherent wideband fading channels")

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)