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 under randomness constraint"
  Abstract: The cognitive interference channel with confidential messages (CICC) proposed by Liang et. al. is investigated. When the security is considered in coding systems, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be leaked to an eavesdropper. For the CICC, the trade-off between the rate of the random number to realize the stochastic encoding and the communication rates is investigated, and the optimal trade-off is completely characterized.

Connected through hyperedge HE-1 (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-2 (induced by source paper "wiretap channel with causal state information and secure rate limited feedback"):
  with members:
    - "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"
    - "physical layer security in downlink multi antenna cellular networks"
    - "on secure communication with constrained randomization"
    - "broadcast channels with confidential messages by randomness constrained stochastic encoder"
    - "secret key agreement with channel state information at the transmitter"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "wiretap channel with causal state information"

Connected through hyperedge HE-3 (induced by source paper "capacity theorems for the cognitive radio channel with confidential messages"):
  with members:
    - "fundamental limits of communications in interference networks part ii information flow in degraded networks"
    - "interference networks with general message sets a random coding scheme"
    - "interference channels with one cognitive transmitter"
    - "capacity bounds for broadcast channels with confidential messages"
    - "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"

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)