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 interference channels with confidential messages"
  Abstract: The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two receivers. It is assumed that there is a common message source (message 1) known to both transmitters, and an additional independent message source (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to decode both messages, while the non-cognitive receiver (receiver 1) should decode only the common message. Furthermore, message 2 is assumed to be a confidential message which needs to be kept as secret as possible from receiver 1, which is viewed as an eavesdropper with regard to message 2. The level of secrecy is measured by the equivocation rate. A single-letter expression for the capacity-equivocation region of the discrete memoryless cognitive interference channel is established and is further explicitly derived for the Gaussian case. Moreover, particularizing the capacity-equivocation region to the case without a secrecy constraint, establishes a new capacity theorem for a class of interference channels, by providing a converse theorem.

Connected through hyperedge HE-1 (induced by source paper "the capacity of the semi deterministic cognitive interference channel with a common cognitive message and approximate capacity for the gaussian case"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "an achievable region for a general multi terminal network and the corresponding chain graph representation"
    - "new results on the capacity of the gaussian cognitive interference channel"

Connected through hyperedge HE-2 (induced by source paper "interference assisted secret communication"):
  with members:
    - "interference alignment for secrecy"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "sum capacity of the gaussian interference channel in the low interference regime"
    - "gaussian interference channel capacity to within one bit"
    - "multiple access channels with generalized feedback and confidential messages"

Connected through hyperedge HE-3 (induced by source paper "an achievable region for a general multi terminal network and its chain graph representation"):
  with members:
    - "an achievable region for a general multi terminal network and the corresponding chain graph representation"
    - "interference networks with general message sets a random coding scheme"
    - "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel"
    - "lecture notes on network information theory"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "fundamental constraints on multicast capacity regions"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-4 (induced by source paper "the gaussian many to one interference channel with confidential messages"):
  with members:
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "providing secrecy with lattice codes"
    - "cooperative binning and channel prefixing for secrecy in interference channels"
    - "k user interference channels achievable secrecy rate and degrees of freedom"

Connected through hyperedge HE-5 (induced by source paper "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "interference channels with one cognitive transmitter"
    - "state of the cognitive interference channel a new unified inner bound"
    - "on the capacity of interference channels with one cooperating transmitter"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-6 (induced by source paper "on the relationship between the multi antenna secrecy communications and cognitive radio communications"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "multi antenna gaussian broadcast channels with confidential messages"
    - "weighted sum rate optimization for cognitive radio mimo broadcast channels"
    - "secrecy capacity region of fading broadcast channels"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"):
  with members:
    - "secure communication over fading channels"
    - "secure nested codes for type ii wiretap channels"
    - "multiple antenna secure broadcast over wireless networks"
    - "the gaussian multiple access wire tap channel with collective secrecy constraints"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy"
    - "on the secrecy capacity of fading channels"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-8 (induced by source paper "on the secure degrees of freedom in the k user gaussian interference channel"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the wiretap channel with feedback encryption over the channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secure communication over fading channels"
    - "the mimome channel"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the relay eavesdropper channel cooperation for secrecy"
    - "on the secrecy capacity of fading 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)