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: "matched filter detection with dynamic threshold for cognitive radio networks"
  Abstract: In cognitive radio networks, spectrum sensing aims to detect the unused spectrum channels in order to use the radio spectrum more efficiently. Various methods have been proposed in the past, such as energy, feature detection, and matched filter. These methods are characterized by a sensing threshold, which plays an important role in the sensing performance. Most of the existing techniques used a static threshold. However, the noise is random, and, thus the threshold should be dynamic. In this paper, we suggest an approach with an estimated and dynamic sensing threshold to increase the efficiency of the sensing detection. The matched filter method with dynamic threshold is simulated and its results are compared to those of other existing techniques.

Connected through hyperedge HE-1 (induced by source paper "compressive spectrum sensing for cognitive radio networks"):
  with members:
    - "techniques for dealing with uncertainty in cognitive radio networks"
    - "double detector for sparse signal detection from one bit compressed sensing measurements"
    - "one bit compressive sensing of dictionary sparse signals"
    - "a survey of sparse representation algorithms and applications"
    - "spectrum occupancy measurement an autocorrelation based scanning technique using usrp"
    - "a bayesian network model of the bit error rate for cognitive radio networks"
    - "dynamic spectrum access in cognitive radio networks with rf energy harvesting"
    - "compressive signal processing with circulant sensing matrices"

Connected through hyperedge HE-2 (induced by source paper "techniques for dealing with uncertainty in cognitive radio networks"):
  with members:
    - "spectrum occupancy measurement an autocorrelation based scanning technique using usrp"
    - "a bayesian network model of the bit error rate for cognitive radio networks"
    - "wideband spectrum sensing for cognitive radio networks a survey"

Connected through hyperedge HE-3 (induced by source paper "spectrum sensing techniques for cognitive radio networks"):
  with members:
    - "spectrum occupancy measurement an autocorrelation based scanning technique using usrp"
    - "dynamic spectrum access in cognitive radio networks with rf energy harvesting"

Connected through hyperedge HE-4 (induced by source paper "interference modeling in cognitive radio networks a survey"):
  with members:
    - "aggregate interference modeling in cognitive radio networks with power and contention control"
    - "communication in a poisson field of interferers part i interference distribution and error probability"

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)