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 "multipath channels of bounded capacity"):
  Abstract: The capacity of discrete-time, non-coherent, multi-path fading channels is considered. It is shown that if the delay spread is large in the sense that the variances of the path gains do not decay faster than geometrically, then capacity is bounded in the signal-to-noise ratio.

Includes members:
  Member "gaussian fading is the worst fading":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity results for block stationary gaussian fading channels with a peak power constraint")
  Member "on multipath fading channels at high snr":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of a class of signal dependent noise channels")
  Member "low snr capacity of fading channels mimo and delay spread":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "low snr capacity of noncoherent fading channels")
  Member "a hot channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the price of certainty waterslide curves and the gap to capacity")
  Member "a coding theorem for a class of stationary channels with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "importance of small probability events in big data information measures applications and challenges")

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)