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 "securing visible light communication systems by beamforming in the presence of randomly distributed eavesdroppers"):
  Abstract: This paper considers secrecy enhancement mechanisms in visible light communication (VLC) systems with spatially distributed passive eavesdroppers (EDs) under the assumption that there are multiple LED transmitters and one legitimate receiver (UE). Based on certain amplitude constraints, we propose an optimal beamforming scheme to optimize secrecy performance. Contrary to the case where null-steering is made possible by using knowledge of the ED locations, we show that the optimal solution when only statistical information about ED locations is available directs the transmission along a particular eigenmode related to the intensity of the ED process and the intended channel. Then, a sub-optimal LED selection scheme is provided to reduce the secrecy outage probability (SOP). An approximate closed-form for the SOP is derived by using secrecy capacity bounds. All analysis is numerically verified by Monte Carlo simulations. The analysis shows that the optimal beamformer yields superior performance to LED selection. However, LED selection is still a highly efficient suboptimal scheme due to the complexity associated with the use of multiple transmitters in the full beamforming approach. These performance trends and exact relations between system parameters can be used to develop a secure VLC system in the presence of randomly distributed EDs.

Includes members:
  Member "secrecy outage analysis for downlink transmissions in the presence of randomly located eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive full duplex jamming receiver for secure d2d links in random networks")
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "on the throughput cost of physical layer security in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secrecy transmission in large scale uav enabled wireless networks")
  Member "on the capacity of free space optical intensity channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "throughput maximization of mixed fso rf uav aided mobile relaying with a buffer")
  Member "the secrecy graph and some of its properties":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure communication in dynamic wireless ad hoc networks")

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)