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: "achievable rates for two way wire tap channels"
  Abstract: We consider two-way wire-tap channels, where two users are communicating with each other in the presence of an eavesdropper, who has access to the communications through a multiple-access channel. We find achievable rates for two different scenarios, the Gaussian two-way wire-tap channel, (GTW-WT), and the binary additive two-way wire-tap channel, (BATW-WT). It is shown that the two-way channels inherently provide a unique advantage for wire-tapped scenarios, as the users know their own transmitted signals and in effect help encrypt the other user's messages, similar to a one-time pad. We compare the achievable rates to that of the Gaussian multiple-access wire-tap channel (GMAC-WT) to illustrate this advantage.

Connected through hyperedge HE-1 (induced by source paper "joint relay and jammer selection for secure two way relay networks"):
  with members:
    - "differential modulation for bi directional relaying with analog network coding"
    - "cooperative secret communication with artificial noise in symmetric interference channel"
    - "the role of feedback in two way secure communications"
    - "secrecy in cooperative relay broadcast channels"
    - "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy"
    - "the relay eavesdropper channel cooperation for secrecy"

Connected through hyperedge HE-2 (induced by source paper "the two way wiretap channel achievable regions and experimental results"):
  with members:
    - "strongly secure communications over the two way wiretap channel"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "lecture notes on network information theory"
    - "cooperative binning and channel prefixing for secrecy in interference channels"
    - "the wiretap channel with feedback encryption over the channel"

Connected through hyperedge HE-3 (induced by source paper "providing secrecy with lattice codes"):
  with members:
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the wiretap channel with feedback encryption over the channel"
    - "capacity of symmetric k user gaussian very strong interference channels"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "the case for structured random codes in network capacity theorems"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-4 (induced by source paper "the role of feedback in two way secure communications"):
  with members:
    - "secret key generation using correlated sources and channels"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "two hop secure communication using an untrusted relay"
    - "secrecy in cooperative relay broadcast channels"
    - "random linear network coding a free cipher"
    - "relay channels with confidential messages"

Connected through hyperedge HE-5 (induced by source paper "the wiretap channel with feedback encryption over the channel"):
  with members:
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "wireless information theoretic security part ii practical implementation"
    - "wireless information theoretic security part i theoretical aspects"
    - "the gaussian multiple access wire tap channel"
    - "relay channels with confidential messages"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

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)