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: "analytic performance evaluation of underlay relay cognitive networks with channel estimation errors"
  Abstract: This paper evaluates the bit error rate (BER) performance of underlay relay cognitive networks with decode-and-forward (DF) relays in arbitrary number of hops over Rayleigh fading with channel estimation errors. In order to facilitate the performance evaluation analytically we derive a novel exact closed-form representation for the corresponding BER which is validated through extensive comparisons with results from Monte-Carlo simulations. The proposed expression involved well known elementary and special functions which render its computational realization rather simple and straightforward. As a result, the need for laborious, energy exhaustive and time-consuming computer simulations can be ultimately omitted. Numerous results illustrate that the performance of underlay relay cognitive networks is, as expected, significantly degraded by channel estimation errors and that is highly dependent upon of both the network topology and the number of hops.

Connected through hyperedge HE-1 (induced by source paper "solutions to integrals involving the marcum q function and applications"):
  with members:
    - "analytic solutions to a marcum q function based integral and application in energy detection of unknown signals over multipath fading channels"
    - "the area under a receiver operating characteristic curve over enriched multipath fading conditions"
    - "novel expressions for the rice ie function and the incomplete lipschitz hankel integrals"
    - "analytic expressions and bounds for special functions and applications in communication theory"
    - "the effects of limited channel knowledge on cognitive radio system capacity"

Connected through hyperedge HE-2 (induced by source paper "the area under a receiver operating characteristic curve over nakagami q fading channels"):
  with members:
    - "analytic solutions to a marcum q function based integral and application in energy detection of unknown signals over multipath fading channels"
    - "performance analysis and design of maximum ratio combining in channel aware mimo decision fusion"

Connected through hyperedge HE-3 (induced by source paper "analytic solutions to a marcum q function based integral and application in energy detection of unknown signals over multipath fading channels"):
  with members:
    - "analytic expressions and bounds for special functions and applications in communication theory"
    - "on the monotonicity of the generalized marcum and nuttall q functions"

Connected through hyperedge HE-4 (induced by source paper "the area under a receiver operating characteristic curve over enriched multipath fading conditions"):
  with members:
    - "analytic solutions to a marcum q function based integral and application in energy detection of unknown signals over multipath fading channels"
    - "performance analysis and design of maximum ratio combining in channel aware mimo decision fusion"

Connected through hyperedge HE-5 (induced by source paper "bit error rate analysis of underlay relay cognitive networks with channel estimation errors"):
  with members:
    - "analytic solutions to a marcum q function based integral and application in energy detection of unknown signals over multipath fading channels"
    - "analytic expressions and bounds for special functions and applications in communication theory"

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)