human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "cooperative spectrum sensing based on the limiting eigenvalue ratio distribution in wishart matrices"):
  Abstract: Recent advances in random matrix theory have spurred the adoption of eigenvalue-based detection techniques for cooperative spectrum sensing in cognitive radio. These techniques use the ratio between the largest and the smallest eigenvalues of the received signal covariance matrix to infer the presence or absence of the primary signal. The results derived so far are based on asymptotical assumptions, due to the difficulties in characterizing the exact eigenvalues ratio distribution. By exploiting a recent result on the limiting distribution of the smallest eigenvalue in complex Wishart matrices, in this paper we derive an expression for the limiting eigenvalue ratio distribution, which turns out to be much more accurate than the previous approximations also in the non-asymptotical region. This result is then applied to calculate the decision sensing threshold as a function of a target probability of false alarm. Numerical simulations show that the proposed detection rule provides a substantial improvement compared to the other eigenvalue-based algorithms.

Includes members:
  Member "cooperative spectrum sensing using random matrix theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "intelligent wireless communications enabled by cognitive radio and machine learning")
  Member "eigenvalue based spectrum sensing algorithms for cognitive radio":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compressive spectrum sensing for cognitive radio networks")

Question: Please tell me which class the source paper 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)