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 "on design of opportunistic spectrum access in the presence of reactive primary users"):
  Abstract: Opportunistic spectrum access (OSA) is a key technique enabling the secondary users (SUs) in a cognitive radio (CR) network to transmit over the "spectrum holes" unoccupied by the primary users (PUs). In this paper, we focus on the OSA design in the presence of reactive PUs, where PU's access probability in a given channel is related to SU's past access decisions. We model the channel occupancy of the reactive PU as a 4-state discrete-time Markov chain. We formulate the optimal OSA design for SU throughput maximization as a constrained finite-horizon partially observable Markov decision process (POMDP) problem. We solve this problem by first considering the conventional short-term conditional collision probability (SCCP) constraint. We then adopt a long-term PU throughput (LPUT) constraint to effectively protect the reactive PU transmission. We derive the structure of the optimal OSA policy under the LPUT constraint and propose a suboptimal policy with lower complexity. Numerical results are provided to validate the proposed studies, which reveal some interesting new tradeoffs between SU throughput maximization and PU transmission protection in a practical interaction scenario.

Includes members:
  Member "cognitive interference management in retransmission based wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal spectrum sharing with arq based legacy users via chain decoding")
  Member "on active learning and supervised transmission of spectrum sharing based cognitive radios by exploiting hidden primary radio feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal spectrum sharing with arq based legacy users via chain decoding")
  Member "on myopic sensing for multi channel opportunistic access structure optimality and performance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep learning based wireless resource allocation with application to vehicular networks")
  Member "algorithms for dynamic spectrum access with learning for cognitive radio":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spectrum access in cognitive radio using a two stage reinforcement learning approach")
  Member "joint design and separation principle for opportunistic spectrum access in the presence of sensing errors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cost aware learning and optimization for opportunistic spectrum access")

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)