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: "practical secrecy using artificial noise"
  Abstract: In this paper, we consider the use of artificial noise for secure communications. We propose the notion of practical secrecy as a new design criterion based on the behavior of the eavesdropper's error probability $P_E$, as the signal-to-noise ratio goes to infinity. We then show that the practical secrecy can be guaranteed by the randomly distributed artificial noise with specified power. We show that it is possible to achieve practical secrecy even when the eavesdropper can afford more antennas than the transmitter.

Connected through hyperedge HE-1 (induced by source paper "artificial noise revisited"):
  with members:
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "enhancing secrecy with multi antenna transmission in wireless ad hoc networks"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "lattice codes for the gaussian wiretap channel"
    - "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation"
    - "mimo networks the effects of interference"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "unshared secret key cryptography"):
  with members:
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "enhancing secrecy with multi antenna transmission in wireless ad hoc networks"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "solutions for the mimo gaussian wiretap channel with a cooperative jammer"
    - "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation"

Connected through hyperedge HE-3 (induced by source paper "unshared secret key cryptography finite constellation inputs and ideal secrecy outage"):
  with members:
    - "unshared secret key cryptography"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

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)