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: "on multipath fading channels at high snr"
  Abstract: This paper studies the capacity of discrete-time multipath fading channels. It is assumed that the number of paths is finite, i.e., that the channel output is influenced by the present and by the L previous channel inputs. A noncoherent channel model is considered where neither transmitter nor receiver are cognizant of the fading's realization, but both are aware of its statistic. The focus is on capacity at high signal-to-noise ratios (SNR). In particular, the capacity pre-loglog - defined as the limiting ratio of the capacity to loglog SNR as SNR tends to infinity - is studied. It is shown that, irrespective of the number paths L, the capacity pre-loglog is 1.

Connected through hyperedge HE-1 (induced by source paper "on the capacity of a class of signal dependent noise channels"):
  with members:
    - "information theory of molecular communication directions and challenges"
    - "capacity limits of diffusion based molecular timing channels"
    - "diffusion based nanonetworking a new modulation technique and performance analysis"
    - "molecular communication in fluid media the additive inverse gaussian noise channel"
    - "channels that heat up"
    - "on the capacity of free space optical intensity channels"

Connected through hyperedge HE-2 (induced by source paper "coding theorem and converse for abstract channels with time structure and memory"):
  with members:
    - "the szeg o asymptotics for doubly dispersive gaussian channels"
    - "directed information causal estimation and communication in continuous time"
    - "on the sensitivity of continuous time noncoherent fading channel capacity"
    - "noncoherent capacity of underspread fading channels"

Connected through hyperedge HE-3 (induced by source paper "wireless networks of bounded capacity"):
  with members:
    - "fundamental limits of cooperation"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-4 (induced by source paper "on the achievable rate of stationary rayleigh flat fading channels with gaussian inputs"):
  with members:
    - "on the gain of joint processing of pilot and data symbols in stationary rayleigh fading channels"
    - "mutual information of iid complex gaussian signals on block rayleigh faded channels"
    - "low snr capacity of noncoherent fading channels"
    - "capacity results for block stationary gaussian fading channels with a peak power constraint"
    - "capacity per unit energy of fading channels with a peak constraint"

Connected through hyperedge HE-5 (induced by source paper "on the sensitivity of continuous time noncoherent fading channel capacity"):
  with members:
    - "noncoherent capacity of underspread fading channels"

Connected through hyperedge HE-6 (induced by source paper "achievable rates over doubly selective rician fading channels under peak power constraint"):
  with members:
    - "noncoherent capacity of underspread fading channels"
    - "low snr capacity of noncoherent fading channels"
    - "the noncoherent rician fading channel part i structure of the capacity achieving input"
    - "capacity per unit energy of fading channels with a peak constraint"

Connected through hyperedge HE-7 (induced by source paper "channels that heat up"):
  with members:
    - "capacity results for block stationary gaussian fading channels with a peak power constraint"
    - "capacity per unit energy of fading channels with a peak constraint"

Connected through hyperedge HE-8 (induced by source paper "multipath channels of bounded capacity"):
  with members:
    - "gaussian fading is the worst fading"
    - "low snr capacity of fading channels mimo and delay spread"
    - "a hot channel"
    - "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)