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: "secure communications over fading channels"
  Abstract: The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information is assumed to be known at both the transmitter and the receiver. The parallel wire-tap channel with independent subchannels is first studied, which serves as an information-theoretic model for the fading wire-tap channel. The secrecy capacity of the parallel wire-tap channel is established. This result is then specialized to give the secrecy capacity of the fading wire-tap channel, which is achieved with the source node dynamically changing the power allocation according to the channel state realization. An optimal source power allocation is obtained to achieve the secrecy capacity.

Connected through hyperedge HE-1 (induced by source paper "semantic security on wiretap channels using universal hashing with fading applications"):
  with members:
    - "a capacity achieving coding scheme for the awgn channel with polynomial encoding and decoding complexity"
    - "finite blocklength bounds for wiretap channels"
    - "almost universal codes for fading wiretap channels"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"
    - "universal hashing for information theoretic security"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "a cryptographic treatment of the wiretap channel"
    - "polynomial time semantically secure encryption achieving the secrecy capacity"

Connected through hyperedge HE-2 (induced by source paper "optimal grassmann manifold eavesdropping a huge security disaster for m 1 2 wiretap channels"):
  with members:
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation"

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)