human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "exact random coding secrecy exponents for the wiretap channel"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "exact random coding error exponents of optimal bin index decoding"
    - "informational divergence approximations to product distributions"
    - "effective secrecy reliability confusion and stealth"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "distributed channel synthesis"

Connected through hyperedge HE-2 (induced by source paper "finite blocklength bounds for wiretap channels"):
  with members:
    - "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"
    - "e_ gamma resolvability"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "converses for secret key agreement and secure computing"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "bayesian m ary hypothesis testing the meta converse and verd u han bounds are tight"

Connected through hyperedge HE-3 (induced by source paper "equivocations exponents and second order coding rates under various r enyi information measures"):
  with members:
    - "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "second order coding rates for channels with state"
    - "on the dispersions of three network information theory problems"

Question: Please tell me which class the center node 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)