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: "optimal transmit antenna selection for massive mimo wiretap channels"
  Abstract: In this paper, we study the impacts of transmit antenna selection on the secrecy performance of massive MIMO systems. We consider a wiretap setting in which a fixed number of transmit antennas are selected and then confidential messages are transmitted over them to a multi-antenna legitimate receiver while being overheard by a multi-antenna eavesdropper. For this setup, we derive an accurate approximation of the instantaneous secrecy rate. Using this approximation, it is shown that in some wiretap settings under antenna selection the growth in the number of active antennas enhances the secrecy performance of the system up to some optimal number and degrades it when this optimal number is surpassed. This observation demonstrates that antenna selection in some massive MIMO settings not only reduces the RF-complexity, but also enhances the secrecy performance. We then consider various scenarios and derive the optimal number of active antennas analytically using our large-system approximation. Numerical investigations show an accurate match between simulations and the analytic results.

Connected through hyperedge HE-1 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping"):
  with members:
    - "papr limited precoding in massive mimo systems with reflect and transmit array antennas"
    - "on robustness of massive mimo systems against passive eavesdropping under antenna selection"
    - "glse precoders for massive mimo systems analysis and applications"
    - "stepwise transmit antenna selection in downlink massive multiuser mimo"
    - "scalable and energy efficient millimeter massive mimo architectures reflect array and transmit array antennas"
    - "asymptotics of nonlinear lse precoders with applications to transmit antenna selection"
    - "asymptotics of transmit antenna selection impact of multiple receive antennas"
    - "hybrid analog digital precoding revisited under realistic rf modeling"

Connected through hyperedge HE-2 (induced by source paper "vulnerabilities of massive mimo systems to pilot contamination attacks"):
  with members:
    - "massive mimo has unlimited capacity"
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "frequency synchronization for uplink massive mimo systems"
    - "linear precoding of data and artificial noise in secure massive mimo systems"
    - "massive mimo ten myths and one critical question"
    - "individual secrecy for broadcast channels with receiver side information"
    - "5g cellular key enabling technologies and research challenges"
    - "physical layer security in massive mimo"

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)