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 "universally attainable error and information exponents and equivocation rate for the broadcast channels with confidential messages"):
  Abstract: We show universally attainable exponents for the decoding error and the mutual information and universally attainable equivocation rates for the conditional entropy for the broadcast channels with confidential messages. The error exponents are the same as ones given by Korner and Sgarro for the broadcast channels with degraded message sets.

Includes members:
  Member "exponential decreasing rate of leaked information in universal random privacy amplification":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communication for generating correlation a unifying survey")
  Member "secure multiplex coding with a common message":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universal secure multiplex network coding with dependent and non uniform messages")
  Member "secure multiplex network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes")
  Member "strong security and separated code constructions for the broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "plausible deniability over broadcast channels")
  Member "on the compound mimo broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the secrecy capacity of compound gaussian mimo wiretap channels")
  Member "general non asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire tap channel":
    also connected through other hyperedges:
      (none)

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)