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 "wiretap channels nonasymptotic fundamental limits"):
  Abstract: This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievability bounds are two new privacy amplification results, which not only refine the existing results, but also achieve stronger notions of secrecy.

Includes members:
  Member "exact random coding secrecy exponents for the wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communication for generating correlation a unifying survey")
  Member "secure multiplex coding with dependent and non uniform multiple messages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exact exponent for soft covering")
  Member "soft covering with high probability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exact exponent for soft covering")
  Member "asymptotic estimates in information theory with non vanishing error probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite sample analysis of image registration")
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "a stronger soft covering lemma and applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wiretap channels with causal state information revisited")
  Member "the third order term in the normal approximation for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "converses for secret key agreement and secure computing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")

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)