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: "how good is phase shift keying for peak limited rayleigh fading channels in the low snr regime"
  Abstract: This paper investigates the achievable information rate of phase-shift keying (PSK) over frequency non-selective Rayleigh fading channels without channel state information (CSI). The fading process exhibits general temporal correlation characterized by its spectral density function. We consider both discrete-time and continuous-time channels, and find their asymptotics at low signal-to-noise ratio (SNR). Compared to known capacity upper bounds under peak constraints, these asymptotics usually lead to negligible rate loss in the low-SNR regime for slowly time-varying fading channels. We further specialize to case studies of Gauss-Markov and Clarke's fading models.

Connected through hyperedge HE-1 (induced by source paper "low snr capacity of noncoherent fading channels"):
  with members:
    - "multipath channels of bounded capacity"
    - "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"
    - "capacity per unit energy of fading channels with a peak constraint"

Connected through hyperedge HE-2 (induced by source paper "the impact of hard decision detection on the energy efficiency of phase and frequency modulation"):
  with members:
    - "error rate analysis for peaky signaling over fading channels"
    - "noncoherent rician fading channel part ii spectral efficiency in the low power regime"

Connected through hyperedge HE-3 (induced by source paper "what is the value of joint processing of pilots and data in block fading channels"):
  with members:
    - "optimum pilot overhead in wireless communication a unified treatment of continuous and block fading channels"

Connected through hyperedge HE-4 (induced by source paper "capacity of underspread noncoherent wssus fading channels under peak signal constraints"):
  with members:
    - "low snr capacity of fading channels with peak and average power constraints"
    - "on off frequency shift keying for wideband fading channels"
    - "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-5 (induced by source paper "low snr capacity of fading channels mimo and delay spread"):
  with members:
    - "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"

Connected through hyperedge HE-6 (induced by source paper "on the low snr capacity of phase shift keying with hard decision detection"):
  with members:
    - "noncoherent rician fading channel part ii spectral efficiency in the low power regime"

Connected through hyperedge HE-7 (induced by source paper "low snr capacity of fading channels with peak and average power constraints"):
  with members:
    - "mutual information and minimum mean square error in gaussian channels"
    - "capacity per unit energy of fading channels with a peak constraint"

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)