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: "exponential decreasing rate of leaked information in universal random privacy amplification"
  Abstract: We derive a new upper bound for Eve's information in secret key generation from a common random number without communication. This bound improves on Bennett 's bound based on the Renyi entropy of order 2 because the bound obtained here uses the Renyi entropy of order 1+s for s ∈ [0,1]. This bound is applied to a wire-tap channel. Then, we derive an exponential upper bound for Eve's information. Our exponent is compared with Hayashi 's exponent. For the additive case, the bound obtained here is better. The result is applied to secret key agreement by public discussion.

Connected through hyperedge HE-1 (induced by source paper "communication for generating correlation a unifying survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact exponent for soft covering"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"
    - "strong functional representation lemma and applications to coding theorems"

Connected through hyperedge HE-2 (induced by source paper "communication for generating correlation a survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact soft covering exponent"
    - "on exact and infty r enyi common informations"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"

Connected through hyperedge HE-3 (induced by source paper "exact exponent for soft covering"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "second order asymptotics in covert communication"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "a stronger soft covering lemma and applications"
    - "renyi divergence and kullback leibler divergence"
    - "exact random coding error exponents of optimal bin index decoding"

Connected through hyperedge HE-4 (induced by source paper "physical layer security protocol for poisson channels for passive man in the middle attack"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "physical layer security for rf satellite channels in the finite length regime"
    - "signal detection under short interval sampling of continuous waveforms for optical wireless scattering communication"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "numerical study on secrecy capacity and code length dependence of the performances in optical wiretap channels"
    - "5g wireless backhaul networks challenges and research advances"
    - "strongly secure communications over the two way wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "almost exact analysis of soft covering lemma via large deviation"):
  with members:
    - "exact soft covering exponent"
    - "a correlation measure based on vector valued l_p norms"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "refinement of the random coding bound"
    - "distributed channel synthesis"

Connected through hyperedge HE-6 (induced by source paper "playing games with bounded entropy convergence rate and approximate equilibria"):
  with members:
    - "a correlation measure based on vector valued l_p norms"
    - "playing games with bounded entropy"
    - "achievability proof via output statistics of random binning"
    - "repeated matching pennies with limited randomness"

Connected through hyperedge HE-7 (induced by source paper "secure list decoding"):
  with members:
    - "commitment capacity of discrete memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "physical layer security for rf satellite channels in the finite length regime"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "free space optical channel estimation for physical layer security"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "information theoretic physical layer security for satellite channels"
    - "empirical and strong coordination via soft covering with polar codes"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "joint power control in wiretap interference channels"

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)