human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "artificial noise revisited"):
  Abstract: The artificial noise (AN) scheme, proposed by Goel and Negi, is being considered as one of the key enabling technology for secure communications over multiple-output multiple-input wiretap channels. However, the decrease in secrecy rate due to the increase in the number of Eve’s antennas is not well understood. In this paper, we develop an analytical framework to characterize the secrecy rate of the AN scheme as a function of Eve’s SNR, Bob’s SNR, the number of antennas in each terminal, and the power allocation scheme. We first derive a closed-form expression for the average secrecy rate. We then derive a closed-form expression for the asymptotic instantaneous secrecy rate with large number of antennas at all terminals. Finally, we derive simple lower and upper bounds on the average/instantaneous secrecy rate that provide a tool for the system design.

Includes members:
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "enhancing secrecy with multi antenna transmission in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "practical secrecy using artificial noise":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "unshared secret key cryptography")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ldpc based code hopping for gaussian wiretap channel with limited feedback")
  Member "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure massive mimo communication with low resolution dacs")
  Member "mimo networks the effects of interference":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "how much bandpass filtering is required in massive mimo base stations")
  Member "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multi antenna jamming in covert communication")

Question: Please tell me which class the source paper 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)