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 secrecy exponent of the wire tap channel"):
  Abstract: We derive an exponentially decaying upper-bound on the unnormalized amount of information leaked to the wire-tapper in Wyner's wire-tap channel setting. We characterize the exponent of the bound as a function of the randomness used by the encoder. This exponent matches that of the recent work of Hayashi [12] which is, to the best of our knowledge, the best exponent that exists in the literature. Our proof (like those of [17], [18]) is exclusively based on an i.i.d. random coding construction while that of [12], in addition, requires the use of random universal hash functions.

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 "informational divergence approximations to product distributions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication for generating correlation a unifying survey")
  Member "effective secrecy reliability confusion and stealth":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  Member "reliability and secrecy functions of the wiretap channel under cost constraint":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "covert communication over a k user multiple access channel")
  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 "universally attainable error and information exponents and equivocation rate for the broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar codes simplicity random codes durability")

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)