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 random coding secrecy exponents for the wiretap channel"):
  Abstract: We analyze the exact exponential decay rate of the expected amount of information leaked to the wiretapper in Wyner’s wiretap channel setting using wiretap channel codes constructed from both i.i.d. and constant-composition random codes. Our analysis for those sampled from i.i.d. random coding ensemble shows that the previously known achievable secrecy exponent using this ensemble is indeed the exact exponent for an average code in the ensemble. Furthermore, our analysis on wiretap channel codes constructed from the ensemble of constant-composition random codes leads to an exponent which, in addition to being the exact exponent for an average code, is larger than the achievable secrecy exponent that has been established so far in the literature for this ensemble (which in turn was known to be smaller than that achievable by wiretap channel codes sampled from i.i.d. random coding ensemble). We show examples where the exact secrecy exponent for the wiretap channel codes constructed from random constant-composition codes is larger than that of those constructed from i.i.d. random codes and examples where the exact secrecy exponent for the wiretap channel codes constructed from i.i.d. random codes is larger than that of those constructed from constant-composition random codes. We, hence, conclude that, unlike the error correction problem, there is no general ordering between the two random coding ensembles in terms of their secrecy exponent.

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 "soft covering with high probability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "equivocations exponents and second order coding rates under various r enyi information measures")
  Member "on the secrecy exponent of the wire tap channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite blocklength bounds for wiretap channels")
  Member "exact random coding error exponents of optimal bin index decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sharp bounds for mutual covering")
  Member "informational divergence approximations to product distributions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  Member "tight exponential analysis of universally composable privacy amplification and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "communication for generating correlation a unifying survey")

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)