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 "friendship based cooperative jamming for secure communication in poisson networks"):
  Abstract: Wireless networks with the consideration of social relationships among network nodes are highly appealing for lots of important data communication services. Ensuring the security of such networks is of great importance to facilitate their applications in supporting future social-based services with strong security guarantee. This paper explores the physical layer security-based secure communication in a finite Poisson network with social friendships among nodes, for which a social friendship-based cooperative jamming scheme is proposed. The jamming scheme consists of a Local Friendship Circle (LFC) and a Long-range Friendship Annulus (LFA), where all legitimate nodes in the LFC serve as jammers, but the legitimate nodes in the LFA are selected as jammers through three location-based policies. To understand both the security and reliability performance of the proposed jamming scheme, we first model the sum interference at any location in the network by deriving its Laplace transform under two typical path loss scenarios. With the help of the interference Laplace transform results, we then derive the exact expression for the transmission outage probability (TOP) and determine both the upper and lower bounds on the secrecy outage probability (SOP), such that the overall outage performances of the proposed jamming scheme can be depicted. Finally, we present extensive numerical results to validate the theoretical analysis of TOP and SOP and also to illustrate the impacts of the friendship-based cooperative jamming on the network performances.

Includes members:
  Member "socially aware networking a survey":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "socially aware congestion control in ad hoc networks current status and the way forward")
  Member "physical layer security in downlink multi antenna cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure massive mimo communication with low resolution dacs")
  Member "principles of physical layer security in multiuser wireless networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "interference in poisson networks with isotropically distributed nodes":
    also connected through other hyperedges:
      (none)
  Member "rethinking the secrecy outage formulation a secure transmission design perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secrecy transmission in large scale uav enabled wireless networks")
  Member "on the throughput cost of physical layer security in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy transmission in large scale uav enabled wireless 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)