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 noncoherent fading relay channels at high signal to noise ratio"
  Abstract: The capacity of noncoherent fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the receiver can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high signal-to-noise ratio (SNR) the relay does not increase capacity. It is further shown that if the fading coefficient of the channel between the transmitter and the relay can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high SNR one can achieve communication rates that are within one bit of the capacity of the multiple-input single-output fading channel that results when the transmitter and the relay can cooperate.

Connected through hyperedge HE-1 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks"):
  with members:
    - "generalized degrees freedom of noncoherent mimo with asymmetric links"
    - "capacity approximations for gaussian relay networks"
    - "cooperative relaying at finite snr role of quantize map and forward"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "wireless network simplification the gaussian n relay diamond network"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-2 (induced by source paper "on the generalized degrees of freedom of noncoherent interference channel"):
  with members:
    - "approximate capacity of fast fading interference channels with no instantaneous csit"
    - "interference channels with rate limited feedback"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "on capacity of non coherent diamond networks"):
  with members:
    - "capacity approximations for gaussian relay networks"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "wireless network simplification the gaussian n relay diamond network"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-4 (induced by source paper "generalized degrees freedom of noncoherent mimo with asymmetric links"):
  with members:
    - "enhancing multiuser mimo through opportunistic d2d cooperation"
    - "degrees of freedom of generic block fading mimo channels without a priori channel state information"
    - "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"
    - "capacity pre log of noncoherent simo channels via hironaka s theorem"
    - "on the capacity of large mimo block fading channels"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

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)