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 "bounds on the capacity of ofdm underspread frequency selective fading channels"):
  Abstract: The analysis of the channel capacity in the absence of prior channel knowledge (noncoherent channel) has gained increasing interest in recent years, but it is still unknown for the general case. In this paper we derive bounds on the capacity of the noncoherent, underspread complex Gaussian, orthogonal frequency division multiplexing (OFDM), wide sense stationary channel with uncorrelated scattering (WSSUS), under a peak power constraint or a constraint on the second and fourth moments of the transmitted signal. These bounds are characterized only by the system signal-to-noise ratio (SNR) and by a newly defined quantity termed effective coherence time. Analysis of the effective coherence time reveals that it can be interpreted as the length of a block in the block fading model in which a system with the same SNR will achieve the same capacity as in the analyzed channel. Unlike commonly used coherence time definitions, it is shown that the effective coherence time depends on the SNR, and is a nonincreasing function of it. We show that for low SNR the capacity is proportional to the effective coherence time, while for higher SNR the coherent channel capacity can be achieved provided that the effective coherence time is large enough.

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 the sensitivity of noncoherent capacity to the channel model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noncoherent capacity of underspread 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 "channel uncertainty in ultra wideband communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spectral efficiency of random time hopping cdma")
  Member "capacity per unit energy of fading channels with a peak constraint":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)