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: "previous messages provide the key to achieve shannon capacity in a wiretap channel"
  Abstract: We consider a wiretap channel and use previously transmitted messages to generate a secret key which increases the secrecy capacity. This can be bootstrapped to increase the secrecy capacity to the Shannon capacity without using any feedback or extra channel while retaining the strong secrecy of the wiretap channel.

Connected through hyperedge HE-1 (induced by source paper "mitigating rate loss in fading multiple access wiretap channel to achieve shannon capacity region"):
  with members:
    - "achieving shannon capacity in a fading wiretap channel"
    - "achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel"
    - "strong secrecy for multiple access channels"
    - "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper"
    - "strong secrecy from channel resolvability"
    - "the wiretap channel with feedback encryption over the channel"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-2 (induced by source paper "enhancing secrecy rates in a wiretap channel"):
  with members:
    - "opportunistic secrecy with a strict delay constraint"
    - "secrecy via sources and channels"
    - "strong secrecy from channel resolvability"
    - "the wiretap channel with feedback encryption over the channel"

Connected through hyperedge HE-3 (induced by source paper "enhancing secrecy rate region for recent messages for a slotted multiple access wiretap channel to shannon capacity region"):
  with members:
    - "achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel"
    - "achieving shannon capacity in a wiretap channel via previous messages"
    - "strong secrecy for multiple access channels"
    - "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper"

Connected through hyperedge HE-4 (induced by source paper "achieving shannon capacity in a fading wiretap channel"):
  with members:
    - "opportunistic secrecy with a strict delay constraint"

Connected through hyperedge HE-5 (induced by source paper "achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel"):
  with members:
    - "achieving shannon capacity in a wiretap channel via previous messages"
    - "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper"
    - "the wiretap channel with feedback encryption over the channel"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-6 (induced by source paper "achieving shannon capacity in a wiretap channel via previous messages"):
  with members:
    - "secret key generation using correlated sources and channels"
    - "secrecy via sources and 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)