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: "sensing throughput tradeoff in cognitive radio with random arrivals and departures of multiple primary users"
  Abstract: This letter analyzes the sensing-throughput tradeoff for a secondary user (SU) under random arrivals and departures of multiple primary users (PUs). We first study the case where PUs change their status only during SU's sensing period. We then generalize to a case where PUs change status anytime during SU frame, and compare the latter case with the former in terms of the optimal sensing time and SU throughput. We also investigate the effects of PU traffic parameters and the number of PUs on the sensing-throughput tradeoff for SU. Results show that, though the increase in the number of PUs reduces the optimal sensing time for SU, the opportunity to find a vacant PU channel reduces simultaneously, in turn, reducing SU throughput. Finally, we validate the analysis by Monte Carlo simulations.

Connected through hyperedge HE-1 (induced by source paper "spectral and energy efficiency in cognitive radio systems with unslotted primary users and sensing uncertainty"):
  with members:
    - "sensing throughput tradeoff for interweave cognitive radio system a deployment centric viewpoint"
    - "primary user traffic estimation for dynamic spectrum access"
    - "effective capacity analysis of cognitive radio channels for quality of service provisioning"

Connected through hyperedge HE-2 (induced by source paper "sensing throughput tradeoff for interweave cognitive radio system a deployment centric viewpoint"):
  with members:
    - "estimation throughput tradeoff for underlay cognitive radio systems"
    - "what will 5g be"

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)