human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "noncoherent capacity of underspread fading channels"):
  with members:
    - "low snr capacity of noncoherent fading channels"
    - "on the sensitivity of noncoherent capacity to the channel model"
    - "capacity results for block stationary gaussian fading channels with a peak power constraint"
    - "capacity of sparse multipath channels in the ultra wideband regime"
    - "low snr capacity of fading channels with peak and average power constraints"
    - "channel uncertainty in ultra wideband communication systems"
    - "mutual information and minimum mean square error in gaussian channels"
    - "capacity per unit energy of fading channels with a peak constraint"

Connected through hyperedge HE-2 (induced by source paper "low snr capacity of noncoherent fading channels"):
  with members:
    - "low snr capacity of fading channels mimo and delay spread"
    - "a channel that heats up"
    - "optimal constellations for the low snr noncoherent mimo block rayleigh fading channel"
    - "on the low snr capacity of peak limited non coherent fading channels with memory"
    - "low snr capacity of fading channels with peak and average power constraints"
    - "how good is phase shift keying for peak limited rayleigh fading channels in the low snr regime"
    - "capacity per unit energy of fading channels with a peak constraint"

Connected through hyperedge HE-3 (induced by source paper "on multipath fading channels at high snr"):
  with members:
    - "channels that heat up"
    - "a coding theorem for a class of stationary channels with feedback"

Question: Please tell me which class the center node 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)