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 rate analysis of amplitude coherent detection over rician fading channels with receiver diversity"
  Abstract: Amplitude-coherent (AC) detection is an efficient detection technique that can simplify the receiver design while providing reliable symbol error rate (SER). Therefore, this work considers AC detector design and SER analysis using M-ary amplitude shift keying (MASK) modulation over Rician fading channels. More specifically, we derive the optimum, near-optimum and a suboptimum AC detectors and compare their SER to the coherent, noncoherent and the heuristic AC detectors. Moreover, the analytical SER of the heuristic detector is derived using two different approaches for single and multiple receiving antennas. One of the derived expressions is expressed in terms of a single integral that can be evaluated numerically, while the second approach gives a closed-form analytical expression for the SER, which is also used to derive a simple formula for the asymptotic SER at high signal-to-noise ratios (SNRs). The obtained analytical and simulation results show that the SER of the AC and coherent MASK detectors are comparable, particularly for high values of the Rician K-factor, and small number of receiving antennas. Moreover, the obtained results show that the SER of the optimal AC detector is equivalent to that of the coherent detector. However, the optimal AC detector complexity is prohibitively high, particularly at high SNRs. In most of the scenarios, the heuristic AC detector significantly outperforms the optimum noncoherent detector, except for the binary ASK case at low SNRs. Moreover, the obtained results show that the heuristic AC detector is immune to phase noise, and thus, it outperforms the coherent detector in scenarios where system is subject to considerable phase noise.

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)