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 "control of wireless networks with secrecy"):
  Abstract: We consider the problem of cross-layer resource allocation in time-varying cellular wireless networks, and incorporate information theoretic secrecy as a Quality of Service constraint. Specifically, each node in the network injects two types of traffic, private and open, at rates chosen in order to maximize a global utility function, subject to network stability and secrecy constraints. The secrecy constraint enforces an arbitrarily low mutual information leakage from the source to every node in the network, except for the sink node. We first obtain the achievable rate region for the problem for single and multi-user systems assuming that the nodes have full CSI of their neighbors. Then, we provide a joint flow control, scheduling and private encoding scheme, which does not rely on the knowledge of the prior distribution of the gain of any channel. We prove that our scheme achieves a utility, arbitrarily close to the maximum achievable utility. Numerical experiments are performed to verify the analytical results, and to show the efficacy of the dynamic control algorithm.

Includes members:
  Member "a secure communication game with a relay helping the eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the security analysis of a cooperative incremental relaying protocol in the presence of an active eavesdropper")
  Member "interference assisted secret communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "jammer assisted resource allocation in secure ofdma with untrusted users")
  Member "on cooperative relaying schemes for wireless physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "joint relay and jammer selection for secure two way relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure transmission and self energy recycling with partial eavesdropper csi")
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the power of randomization for scheduling real time traffic in wireless networks")
  Member "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "robust rate adaptive wireless communication using ack nak feedback":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reinforcement based data transmission in temporally correlated fading channels partial csit scenario")

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)