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: "cognitive radio an information theoretic perspective"
  Abstract: Cognitive radios have been proposed as a means to implement efficient reuse of the licensed spectrum. The key feature of a cognitive radio is its ability to recognize the primary (licensed) user and adapt its communication strategy to minimize the interference that it generates. We consider a communication scenario in which the primary and the cognitive user wish to communicate to different receivers, subject to mutual interference. Modeling the cognitive radio as a transmitter with side-information about the primary transmission, we characterize the largest rate at which the cognitive radio can reliably communicate under the constraint that (i) no interference is created for the primary user, and (ii) the primary encoder-decoder pair is oblivious to the presence of the cognitive radio.

Connected through hyperedge HE-1 (induced by source paper "cognitive radio networks an information theoretic perspective"):
  with members:
    - "noma an information theoretic perspective"
    - "non orthogonal multiple access common myths and critical questions"
    - "multi user cognitive interference channels a survey and new capacity results"
    - "massive mimo for next generation wireless systems"
    - "the capacity of less noisy cognitive interference channels"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "the capacity of more capable cognitive interference channels"
    - "superposition coding based bounds and capacity for the cognitive z interference channels"

Connected through hyperedge HE-2 (induced by source paper "optimal spectrum sharing with arq based legacy users via chain decoding"):
  with members:
    - "deep neural network architectures for modulation classification"
    - "on stable throughput of cognitive radio networks with cooperating secondary users"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "optimal relaying beamforming in multiple access broadcast channel mabc bidirectional cognitive radio networks in presence of interferers"):
  with members:
    - "a reputation based stackelberg game model to enhance secrecy rate in spectrum leasing to selfish iot devices"
    - "resource allocation and outage analysis for an adaptive cognitive two way relay network"
    - "spectrum sharing in cooperative cognitive radio networks a matching game framework"
    - "energy efficient power allocation in cognitive radio systems with imperfect spectrum sensing"
    - "cooperative algorithms for mimo amplify and forward relay networks"
    - "relay selection and resource allocation for two way df af cognitive radio networks"

Connected through hyperedge HE-4 (induced by source paper "the capacity of degraded cognitive interference channel with unidirectional destination cooperation"):
  with members:
    - "the capacity of more capable cognitive interference channels"
    - "on the capacity region of the cognitive interference channel with unidirectional destination cooperation"

Connected through hyperedge HE-5 (induced by source paper "polar coding for the cognitive interference channel with confidential messages"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "secure polar coding for the two way wiretap channel"
    - "polar codes for broadcast channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for secret key generation"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "universal polar codes"

Connected through hyperedge HE-6 (induced by source paper "performance of df incremental relaying with energy harvesting relays in underlay crns"):
  with members:
    - "wireless energy harvesting in a cognitive relay network"
    - "relaying protocols for wireless energy harvesting and information processing"

Connected through hyperedge HE-7 (induced by source paper "performance optimization of co existing underlay secondary networks"):
  with members:
    - "price based resource allocation for spectrum sharing femtocell networks a stackelberg game approach"

Connected through hyperedge HE-8 (induced by source paper "resource allocation and fairness in wireless powered cooperative cognitive radio networks"):
  with members:
    - "wireless powered communication opportunities and challenges"
    - "placement optimization of energy and information access points in wireless powered communication networks"
    - "cognitive wireless powered network spectrum sharing models and throughput maximization"
    - "on information and energy cooperation in energy harvesting cognitive radio"
    - "optimum wirelessly powered relaying"
    - "harvest then cooperate wireless powered cooperative communications"
    - "user cooperation in wireless powered communication networks"
    - "information and energy cooperation in cognitive radio networks"

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)