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: "strong converse and second order asymptotics of channel resolvability"
  Abstract: We study the problem of channel resolvability for fixed i.i.d. input distributions and discrete memoryless channels (DMCs), and derive the strong converse theorem for any DMCs that are not necessarily full rank. We also derive the optimal second-order rate under a condition. Furthermore, under the condition that a DMC has the unique capacity achieving input distribution, we derive the optimal second-order rate of channel resolvability for the worst input distribution.

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 "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"
    - "the mac resolvability region semantic security and its operational implications"
    - "soft covering with high probability"
    - "renyi divergence and kullback leibler divergence"
    - "informational divergence approximations to product distributions"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-4 (induced by source paper "second order region for gray wyner network"):
  with members:
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "interactive communication for data exchange"
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "information complexity density and simulation of protocols"
    - "channels with cost constraints strong converse and dispersion"
    - "secret key agreement general capacity and second order asymptotics"

Connected through hyperedge HE-5 (induced by source paper "wiretap channels nonasymptotic fundamental limits"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "semantic security capacity for wiretap channels of type ii"
    - "a stronger soft covering lemma and applications"
    - "the third order term in the normal approximation for the awgn channel"
    - "converses for secret key agreement and secure computing"

Connected through hyperedge HE-6 (induced by source paper "the mac resolvability region semantic security and its operational implications"):
  with members:
    - "mac resolvability first and second order results"
    - "soft covering with high probability"
    - "semantic security capacity for wiretap channels of type ii"
    - "a stronger soft covering lemma and applications"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "channel resolvability theorems for general sources and channels"):
  with members:
    - "first and second order coding theorems for mixed memoryless channels with general mixture"
    - "second order resolvability intrinsic randomness and fixed length source coding for mixed sources information spectrum approach"
    - "strong secrecy from channel resolvability"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-8 (induced by source paper "variable length resolvability for general sources and channels"):
  with members:
    - "variable length coding with cost allowing non vanishing error probability"
    - "an information spectrum approach to weak variable length source coding with side information"
    - "variable length compression allowing errors"
    - "second order resolvability intrinsic randomness and fixed length source coding for mixed sources information spectrum approach"

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)