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: "error exponents and cutoff rate for noncoherent rician fading channels"
  Abstract: In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side information. First, it is assumed that the input is subject only to an average power constraint. In this case, a lower bound to the random coding error exponent is considered and the optimal input achieving this lower bound is shown to have a discrete amplitude and uniform phase. If the input is subject to both average and peak power constraints, it is proven that the optimal input achieving the random coding error exponent has again a discrete nature. Finally, the cutoff rate is analyzed, and the optimality of the single-mass input amplitude distribution in the low-power regime is discussed.

Connected through hyperedge HE-1 (induced by source paper "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"):
  with members:
    - "short codes with mismatched channel state information a case study"
    - "finite blocklength bounds on the maximum coding rate of rician fading channels with applications to pilot assisted transmission"
    - "code design for short blocks a survey"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "the third order term in the normal approximation for the awgn channel"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "on the capacity of large mimo block fading channels"
    - "on the gain of joint processing of pilot and data symbols in stationary rayleigh fading channels"

Connected through hyperedge HE-2 (induced by source paper "error rate analysis for peaky signaling over fading channels"):
  with members:
    - "performance analysis for multichannel reception of oofsk signaling"
    - "the noncoherent rician fading channel part i structure of the capacity achieving input"
    - "noncoherent rician fading channel part ii spectral efficiency in the low power regime"

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)