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: "wireless information theoretic security part i theoretical aspects"
  Abstract: In this two-part paper, we consider the transmission of confi dential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel. We define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading informationtheoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver — fading thus turns out to be a friend and not a foe. The issue of imperfect channel state information is also addressed. Practical schemes for wireless information-theoretic security are presented in Part II, which in some cases comes close to the secrecy capacity limits given in this paper.

Connected through hyperedge HE-1 (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"
    - "achievable rates for two way wire tap channels"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "wireless information theoretic security part ii practical implementation"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "the secrecy capacity of the mimo wiretap channel"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "secure communication over fading channels"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "the mimome channel"
    - "multiple antenna secure broadcast over wireless networks"
    - "secrecy capacity region of a multi antenna gaussian broadcast channel with confidential messages"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-3 (induced by source paper "the general gaussian multiple access and two way wire tap channels achievable rates and cooperative jamming"):
  with members:
    - "secure communication over fading channels"
    - "the gaussian multiple access wire tap channel with collective secrecy constraints"
    - "wireless information theoretic security part ii practical implementation"
    - "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy"
    - "applications of ldpc codes to the wiretap channel"

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)