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 "exact correct decoding exponent of the wiretap channel decoder"):
  Abstract: The performance of the achievability scheme for Wyner's wiretap channel model is examined from the perspective of the probability of correct decoding, Pc, at the wiretap channel decoder. In particular, for finite-alphabet memoryless channels, the exact random coding exponent of Pc is derived as a function of the total coding rate R1 and the rate of each subcode R2. Two different representations are given for this function and its basic properties are provided. We also characterize the region of pairs of rates (R1, R2) of full security in the sense of the random coding exponent of Pc, in other words, the region where the exponent of this achievability scheme is the same as that of blind guessing at the eavesdropper side. Finally, an analogous derivation of the correct-decoding exponent is outlined for the case of the Gaussian channel.

Includes members:
  Member "secure multiplex coding with dependent and non uniform multiple messages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exact exponent for soft covering")
  Member "the sender excited secret key agreement model capacity reliability and secrecy exponents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exact random coding secrecy exponents for the wiretap channel")
  Member "exact random coding error exponents of optimal bin index decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sharp bounds for mutual covering")
  Member "tight exponential analysis of universally composable privacy amplification and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication for generating correlation a unifying survey")
  Member "codeword or noise exact random coding exponents for slotted asynchronism":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "list decoding random coding exponents and expurgated exponents")
  Member "a cryptographic treatment of the wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "key and message semantic security over state dependent channels")
  Member "exponential decreasing rate of leaked information in universal random privacy amplification":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "explicit codes for the wiretap channel a unified design framework")

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)