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 "degraded broadcast channel secrecy outside of a bounded range"):
  Abstract: A three-receiver degraded broadcast channel with secrecy outside of a bounded range is studied, in which the channel quality gradually degrades from receiver 3 to receiver 1. The transmitter has three messages intended for the receivers with receiver 3 decoding all messages, receiver 2 decoding the first two messages, and receiver 1 decoding only the first message. Furthermore, the third message should be kept secure from receiver 1. The discrete memoryless channel is studied and the secrecy capacity region is characterized. The achievable scheme is based on superposition coding and random binning, in which one superposition layer and random binning together provide secrecy. The converse proof is derived based on the insight obtained from the achievable scheme so that manipulations of terms yield tight rate bounds.

Includes members:
  Member "an information theoretic approach to secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "performance analysis and design of two edge type ldpc codes for the bec wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")
  Member "informational divergence approximations to product distributions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication for generating correlation a unifying survey")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "strong secrecy from channel resolvability":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "securing distributed function approximation via coding for continuous compound channels")
  Member "degraded compound multi receiver wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an improved feedback coding scheme for the wire tap channel")
  Member "secrecy capacity of a class of broadcast channels with an eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement")
  Member "the secrecy rate region of the broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement")

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)