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 "the mac resolvability region semantic security and its operational implications"):
  Abstract: Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel (MAC) from the perspective of resolvability. We then refine the approach in order to obtain some novel results on the second-order achievable rates. Establishing a conceptually simple converse proof for resolvability over the memoryless MAC, which relies on uniform continuity of Shannon's entropy with respect to the variational distance, we characterize the resolvability region. In a discussion of the operational meaning of the information theoretic concept of semantic security from the point of view of Ahlswede's General Theory of Information Transfer, we show some interesting implications on the resilience against a wide-ranging class of attacks even if no assumption can be made about the distributions of the transmitted messages. We then give details on how the resolvability results can be used to construct a wiretap code that achieves semantic security.

Includes members:
  Member "mac resolvability first and second order results":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "covert communication over a k user multiple access channel")
  Member "soft covering with high probability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exact exponent for soft covering")
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "wiretap channels with causal state information revisited")
  Member "strong converse and second order asymptotics of channel resolvability":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication for generating correlation a unifying survey")
  Member "renyi divergence and kullback leibler divergence":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "secrecy results for compound wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secure polar coding with delayed wiretapping information")

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)