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: "capacity theorems for the cognitive radio channel with confidential messages"
  Abstract: As a brain inspired wireless communication scheme, cognitive radio is a novel approach to promote the efficient use of the scarce radio spectrum by allowing some users called cognitive users to access the under-utilized spectrum licensed out to the primary users. Besides highly reliable communication and efficient utilization of the radio spectrum, the security of information transmission against eavesdropping is critical in the cognitive radios for many potential applications. In this paper, this problem is investigated from an information theoretic viewpoint. Capacity limits are explored for the Cognitive Radio Channel (CRC) with confidential messages. As an idealized information theoretic model for the cognitive radio, this channel includes two transmitters which send independent messages to their corresponding receivers such that one transmitter, i.e., the cognitive transmitter, has access non-causally to the message of the other transmitter, i.e., the primary transmitter. The message designated to each receiver is required to be kept confidential with respect to the other receiver. The secrecy level for each message is evaluated using the equivocation rate. Novel inner and outer bounds for the capacity-equivocation region are established. It is shown that these bounds coincide for some special cases. Specifically, the capacity-equivocation region is derived for a class of less-noisy CRCs and also a class of semi-deterministic CRCs. For the case where only the message of the cognitive transmitter is required to be kept confidential, the capacity-equivocation region is also established for the Gaussian CRC with weak interference.

Connected through hyperedge HE-1 (induced by source paper "enhancing phy security of cooperative cognitive radio multicast communications"):
  with members:
    - "robust beamforming for secrecy rate in cooperative cognitive radio multicast communications"
    - "robust beamforming for secure communication in systems with wireless information and power transfer"
    - "secrecy wireless information and power transfer with miso beamforming"
    - "improving physical layer secrecy using full duplex jamming receivers"
    - "spatially selective artificial noise aided transmit optimization for miso multi eves secrecy rate maximization"
    - "on the design of artificial noise aided secure multi antenna transmission in slow fading channels"
    - "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"

Connected through hyperedge HE-2 (induced by source paper "multi phase smart relaying and cooperative jamming in secure cognitive radio networks"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "interference assisted secret communication"
    - "strong secrecy from channel resolvability"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "on the secrecy of the cognitive interference channel with partial channel states"):
  with members:
    - "the effects of limited channel knowledge on cognitive radio system capacity"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "secret key agreement with channel state information at the transmitter"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-4 (induced by source paper "how much rate splitting is required for a random coding scheme a new achievable rate region for the broadcast channel with cognitive relays"):
  with members:
    - "fundamental limits of communications in interference networks part iii information flow in strong interference regime"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "fundamental limits of communications in interference networks part i basic structures"
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "fundamental limits of communications in interference networks part iv networks with a sequence of less noisy receivers"
    - "interference networks with general message sets a random coding scheme"
    - "capacity bounds and exact results for the cognitive z interference channel"
    - "on the capacity of a class of cognitive z interference channels"

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)