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 capacity of a class of broadcast channels with an eavesdropper"):
  Abstract: We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the degraded multi-receiver wiretap channel where the legitimate receivers exhibit a degradedness order while the eavesdropper is more noisy with respect to all legitimate receivers. We establish the secrecy capacity region of this channel model. Secondly, we consider the parallel multi-receiver wiretap channel with a less noisiness order in each sub-channel, where this order is not necessarily the same for all sub-channels. We establish the common message secrecy capacity and sum secrecy capacity of this channel. Thirdly, we study a special class of degraded parallel multi-receiver wiretap channels and provide a stronger result. In particular, we study the case with two sub-channels two users and one eavesdropper, where there is a degradedness order in each sub-channel such that in the first (resp. second) sub-channel the second (resp. first) receiver is degraded with respect to the first (resp. second) receiver, while the eavesdropper is degraded with respect to both legitimate receivers in both sub-channels. We determine the secrecy capacity region of this channel. Finally, we focus on a variant of this previous channel model where the transmitter can use only one of the sub-channels at any time. We characterize the secrecy capacity region of this channel as well.

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 "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "secrecy in cooperative relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "broadcast channels with privacy leakage constraints")
  Member "the secrecy rate region of the broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement")
  Member "multiple access channels with generalized feedback and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "multiple access channel with common message and secrecy constraint")
  Member "the gaussian multiple access wire tap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an achievable region for the multiple access wiretap channels with confidential and open messages")
  Member "relay channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the security analysis of a cooperative incremental relaying protocol in the presence of an active eavesdropper")

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)