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 "network simplification for secure af relaying"):
  Abstract: We consider a class of Gaussian layered networks where a source communicates with a destination through L intermediate relay layers with N nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions of the nodes in the last layer. For such networks we address the question: what fraction of maximum secure achievable rate can be maintained if only a fraction of available relay nodes are used in each layer? In particular, we provide upper bounds on additive and multiplicative gaps between the optimal secure AF when all N relays in each layer are used and when only k, 1 <= k < N, relays are used in each layer. We show that asymptotically (in source power), the additive gap increases at most logarithmically with ratio N/k and L, and the corresponding multiplicative gap increases at most quadratically with ratio N/k and L. To the best of our knowledge, this work offers the first characterization of the performance of network simplification in layered amplify-and-forward relay networks in the presence of an eavesdropper.

Includes members:
  Member "secure transmission in amplify and forward diamond networks with a single eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure analog network coding in layered networks")
  Member "analog network coding in general snr regime":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure analog network coding in layered networks")
  Member "wireless network simplification the gaussian n relay diamond network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "relay beamforming strategies for physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint relay and jammer selection improves the physical layer security in the face of csi feedback delays")
  Member "collaborative relay beamforming for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective optimization criteria and relay selection algorithms for physical layer security in multiple antenna relay networks")
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")

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)