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: "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.

Connected through hyperedge HE-1 (induced by source paper "semantic security and the second largest eigenvalue of biregular graphs"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "ramanujan graphs in polynomial time"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"
    - "universal hashing for information theoretic security"
    - "renyi divergence and kullback leibler divergence"

Connected through hyperedge HE-2 (induced by source paper "resolvability on continuous alphabets"):
  with members:
    - "channel resolvability theorems for general sources and channels"
    - "r enyi resolvability and its applications to the wiretap channel"
    - "mac resolvability first and second order results"
    - "soft covering with high probability"
    - "strong converse and second order asymptotics of channel resolvability"
    - "renyi divergence and kullback leibler divergence"
    - "informational divergence approximations to product distributions"
    - "strong secrecy from channel resolvability"

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)