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 "noncoherent capacity of underspread fading channels"):
  Abstract: We derive bounds on the noncoherent capacity of wide-sense stationary uncorrelated scattering (WSSUS) channels that are selective both in time and frequency, and are underspread, i.e., the product of the channel's delay spread and Doppler spread is small. The underspread assumption is satisfied by virtually all wireless communication channels. For input signals that are peak constrained in time and frequency, we obtain upper and lower bounds on capacity that are explicit in the channel's scattering function, are accurate for a large range of bandwidth, and allow to coarsely identify the capacity-optimal bandwidth as a function of the peak power and the channel's scattering function. We also obtain a closed-form expression for the first-order Taylor series expansion of capacity in the infinite-bandwidth limit, and show that our bounds are tight in the wideband regime. For input signals that are peak constrained in time only (and, hence, allowed to be peaky in frequency), we provide upper and lower bounds on the infinite-bandwidth capacity. Our lower bound is closely related to a result by Viterbi (1967). We find cases where the bounds coincide and, hence, the infinite-bandwidth capacity is characterized exactly. The analysis in this paper is based on a discrete-time discrete-frequency approximation of WSSUS time- and frequency-selective channels. This discretization takes the underspread property of the channel explicitly into account.

Includes members:
  Member "low snr capacity of noncoherent fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity scaling in a non coherent wideband massive simo block fading channel")
  Member "on the sensitivity of noncoherent capacity to the channel model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounds on the capacity of ofdm underspread frequency selective fading channels")
  Member "multipath channels of bounded capacity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "low snr capacity of noncoherent fading channels")
  Member "capacity results for block stationary gaussian fading channels with a peak power constraint":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance analysis of cognitive radio systems with imperfect channel sensing and estimation")
  Member "capacity of sparse multipath channels in the ultra wideband regime":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity scaling in a non coherent wideband massive simo block fading channel")
  Member "low snr capacity of fading channels with peak and average power constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on capacity and capacity per unit cost of gaussian multiple access channel with peak power constraints")
  Member "channel uncertainty in ultra wideband communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spectral efficiency of random time hopping cdma")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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)