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: "on stable throughput of cognitive radio networks with cooperating secondary users"
  Abstract: In this paper, we study cooperative cognitive radio networks consisting of a primary user (PU) and multiple secondary users (SUs). SUs transmit only when PU is sensed as silent and may interfere with primary transmission due to imperfect sensing. When primary activity is sensed correctly, SUs cooperate with PU by assisting retransmission of failed packets of PU. We analyze packet throughput of PU and SU for three variations of the proposed cooperation method. A signal flow graph-based approach is employed to obtain the closed-form expressions of packet throughput. The analysis is done for two cases: individual sensing and cooperative sensing. Furthermore, we characterize the optimal transmission probability of SUs that maximizes individual secondary packet throughput keeping all queues in the system stable. Results present a comparison of throughput performance of the proposed cooperation methods under different scenarios and show their benefits for both PU and SU throughput.

Connected through hyperedge HE-1 (induced by source paper "optimal spectrum sharing with arq based legacy users via chain decoding"):
  with members:
    - "deep neural network architectures for modulation classification"
    - "cross layer estimation and control for cognitive radio exploiting sparse network dynamics"
    - "cognitive access policies under a primary arq process via forward backward interference cancellation"
    - "blind known interference cancellation"
    - "cognitive interference management in retransmission based wireless networks"
    - "on active learning and supervised transmission of spectrum sharing based cognitive radios by exploiting hidden primary radio feedback"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-2 (induced by source paper "stable throughput of cooperative cognitive networks with energy harvesting finite relay buffer and finite battery capacity"):
  with members:
    - "optimization of energy constrained wireless powered communication networks with heterogeneous nodes"
    - "non orthogonal multiple access schemes in wireless powered communication networks"
    - "on optimal policies in full duplex wireless powered communication networks"
    - "energy harvesting wireless communications a review of recent advances"
    - "effect of energy harvesting on stable throughput in cooperative relay systems"
    - "energy efficient resource allocation for wireless powered communication networks"
    - "cooperative access in cognitive radio networks stable throughput and delay tradeoffs"
    - "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"

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)