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 "on the 3 receiver broadcast channel with degraded message sets and confidential messages"):
  Abstract: In this paper, bounds to the rate-equivocation region for the general 3-receiver broadcast channel (BC) with degraded message sets, are presented for confidential messages to be kept secret from one of the receivers. This model is more general than the 2-receiver BCs with confidential messages with an external wiretapper, and the recently studied 3-receiver degraded BCs with confidential messages, since in the model studied in this paper, the conditions on the receivers are general and the wiretapper receives the common message. Wyner's code partitioning combined with double-binning is used to show the achievable rate tuples. Error probability analysis and equivocation calculation are also provided. The secure coding scheme is sufficient to provide security for the 3-receiver BC with 2 or 3 degraded message sets, for the scenarios: (i) 3 degraded message sets, where the first confidential message is sent to receivers 1 and 2 and the second confidential message is sent to receiver 1, (ii) 2 degraded message sets, where one confidential message is sent to receiver 1, and (iii) 2 degraded message sets, where one confidential message is sent to receivers 1 and 2. The proof for the outer bound is shown for the cases where receiver 1 is more capable than the wiretap receiver 3, for the first two scenarios. Under the condition that both receivers 1 and 2 are less noisy than the wiretap receiver 3, the inner and outer bounds coincide, giving the rate-equivocation region for (iii). In addition, a new outer bound for the general 3-receiver BC with 3 degraded messages is obtained.

Includes members:
  Member "secured communication over frequency selective fading channels a practical vandermonde precoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "securing ofdm based wireless links using temporal artificial noise injection")
  Member "secrecy capacity of a class of broadcast channels with an eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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)