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: "mac resolvability first and second order results"
  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.

Connected through hyperedge HE-1 (induced by source paper "covert communication over a k user multiple access channel"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "embedding covert information in broadcast communications"
    - "cooperative resolvability and secrecy in the cribbing multiple access channel"
    - "multilevel coded pulse position modulation for covert communications over binary input discrete memoryless channels"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "time division transmission is optimal for covert communication over broadcast channels"
    - "covert wireless communication with artificial noise generation"
    - "time division is optimal for covert communication over some broadcast channels"

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"
    - "the mac resolvability region semantic security and its operational implications"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "the mac resolvability region semantic security and its operational implications"):
  with members:
    - "soft covering with high probability"
    - "semantic security capacity for wiretap channels of type ii"
    - "a stronger soft covering lemma and applications"
    - "strong converse and second order asymptotics of channel resolvability"
    - "renyi divergence and kullback leibler divergence"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "secrecy results for compound wiretap channels"
    - "effective secrecy reliability confusion and stealth"

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)