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: "physical layer cryptography through massive mimo"
  Abstract: We propose the new technique of physical-layer cryptography based on using a massive MIMO channel as a key between the sender and desired receiver, which need not be secret. The goal is for low-complexity encoding and decoding by the desired transmitter–receiver pair, whereas decoding by an eavesdropper is hard in terms of prohibitive complexity. The decoding complexity is analyzed by mapping the massive MIMO system to a lattice. We show that the eavesdropper’s decoder for the MIMO system with M-PAM modulation is equivalent to solving standard lattice problems that are conjectured to be of exponential complexity for both classical and quantum computers. Hence, under the widely-held conjecture that standard lattice problems are hard to solve, the proposed encryption scheme has a more robust notion of security than that of the most common encryption methods used today such as RSA and Diffie–Hellman. In addition, we show that this scheme could be used to securely communicate without a pre-shared secret and little computational overhead. Thus, by exploiting the physical layer properties of the radio channel, the massive MIMO system provides for low-complexity encryption commensurate with the most sophisticated forms of application-layer encryption that are currently known.

Connected through hyperedge HE-1 (induced by source paper "comments on physical layer cryptography through massive mimo"):
  with members:
    - "linear precoding of data and artificial noise in secure massive mimo systems"
    - "jamming aided secure communication in massive mimo rician channels"
    - "physical layer security for massive mimo an overview on passive eavesdropping and active attacks"
    - "on massive mimo physical layer cryptosystem"
    - "renyi divergence and kullback leibler divergence"
    - "asymptotic performance of linear receivers in mimo fading channels"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "an overview of physical layer security with finite alphabet signaling"):
  with members:
    - "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"
    - "linear precoding of data and artificial noise in secure massive mimo systems"
    - "sum secrecy rate maximization for full duplex two way relay networks using alamouti based rank two beamforming"
    - "performance of lattice coset codes on universal software radio peripherals"
    - "secure m psk communication via directional modulation"
    - "finite blocklength bounds for wiretap channels"
    - "physical layer security in millimeter wave cellular networks"
    - "physical layer security in heterogeneous cellular networks"

Connected through hyperedge HE-3 (induced by source paper "linear precoding of data and artificial noise in secure massive mimo systems"):
  with members:
    - "large scale mimo relaying techniques for physical layer security af or df"
    - "physical layer security for massive mimo an overview on passive eavesdropping and active attacks"
    - "secure massive mimo transmission in the presence of an active eavesdropper"
    - "securing massive mimo at the physical layer"
    - "linear precoding based on polynomial expansion large scale multi cell mimo systems"
    - "physical layer security in downlink multi antenna cellular networks"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "secure transmission in multi cell massive mimo systems"

Connected through hyperedge HE-4 (induced by source paper "wireless security with beamforming technique"):
  with members:
    - "location based beamforming for enhancing secrecy in rician wiretap channels"
    - "jamming aided secure communication in massive mimo rician channels"
    - "on the secrecy outage capacity of physical layer security in large scale mimo relaying systems with imperfect csi"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "energy and spectral efficiency of very large multiuser mimo systems"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"
    - "cooperative jamming for secure communications in mimo relay networks"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"

Connected through hyperedge HE-5 (induced by source paper "on massive mimo physical layer cryptosystem"):
  with members:
    - "asymptotic performance of linear receivers in mimo fading channels"
    - "the secrecy capacity of the mimo 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)