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 "secrecy in cooperative relay broadcast channels"):
  Abstract: We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.

Includes members:
  Member "cooperation with an untrusted relay a secrecy perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi antenna jamming in covert communication")
  Member "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interplay between noma and other emerging technologies a survey")
  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 "the secrecy capacity of the mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "multiple access channels with generalized feedback and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multiple access wiretap channel with noiseless feedback")
  Member "the discrete memoryless multiple access channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multiple access channel with common message and secrecy constraint")
  Member "rate regions for relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "sharp bounds for mutual covering")

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)