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 "secure transmission in amplify and forward diamond networks with a single eavesdropper"):
  Abstract: Unicast communication over a network of $M$-parallel relays in the presence of an eavesdropper is considered. The relay nodes, operating under individual power constraints, amplify and forward the signals received at their inputs. The problem of the maximum secrecy rate achievable with AF relaying is addressed. Previous work on this problem provides iterative algorithms based on semidefinite relaxation. However, those algorithms result in suboptimal performance without any performance and convergence guarantees. We address this problem for three specific network models, with real-valued channel gains. We propose a novel transformation that leads to convex optimization problems. Our analysis leads to (i)a polynomial-time algorithm to compute the optimal secure AF rate for two of the models and (ii) a closed-form expression for the optimal secure rate for the other.

Includes members:
  Member "optimal amplify and forward schemes for relay channels with correlated relay noise":
    also connected through other hyperedges:
      (none)
  Member "the approximate capacity of the gaussian n relay diamond network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks")
  Member "amplify and forward in wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed decode forward for relay networks")
  Member "relay beamforming strategies for physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint relay and jammer selection improves the physical layer security in the face of csi feedback delays")
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "network beamforming using relays with perfect channel information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capitalizing backscatter aided hybrid relay communications with wireless energy harvesting")

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)