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: "distributed simulation of continuous random variables"
  Abstract: We establish the first known upper bound on the exact and Wyner's common information of $n$ continuous random variables in terms of the dual total correlation between them (which is a generalization of mutual information). In particular, we show that when the pdf of the random variables is log-concave, there is a constant gap of $n^{2}\log e+9n\log n$ between this upper bound and the dual total correlation lower bound that does not depend on the distribution. The upper bound is obtained using a computationally efficient dyadic decomposition scheme for constructing a discrete common randomness variable $W$ from which the $n$ random variables can be simulated in a distributed manner. We then bound the entropy of $W$ using a new measure, which we refer to as the erosion entropy.

Connected through hyperedge HE-1 (induced by source paper "constrained functional value under general convexity conditions with applications to distributed simulation"):
  with members:
    - "the entropy per coordinate of a random vector is highly constrained under convexity conditions"

Connected through hyperedge HE-2 (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-3 (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-4 (induced by source paper "structured mappings and conferencing common information for multiple access channels"):
  with members:
    - "a new achievable rate region for multiple access channel with states"
    - "quasi linear codes application to point to point and multi terminal source coding"
    - "exact common information"
    - "on interference networks over finite fields"
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"

Connected through hyperedge HE-5 (induced by source paper "on exact and infty r enyi common informations"):
  with members:
    - "corrections to wyner s common information under r enyi divergence measures"
    - "exact channel synthesis"
    - "strong functional representation lemma and applications to coding theorems"
    - "generalized common information common information extraction and private sources synthesis"
    - "exact common information"
    - "a generalized typicality for abstract alphabets"
    - "renyi divergence and kullback leibler divergence"
    - "wyner s common information generalizations and a new lossy source coding interpretation"

Connected through hyperedge HE-6 (induced by source paper "exact channel synthesis"):
  with members:
    - "on exact and infty r enyi common informations"
    - "strong functional representation lemma and applications to coding theorems"
    - "generalized common information common information extraction and private sources synthesis"
    - "exact common information"
    - "wyner s common information generalizations and a new lossy source coding interpretation"
    - "simulation of a channel with another channel"
    - "distributed channel synthesis"
    - "channel simulation via interactive communications"

Connected through hyperedge HE-7 (induced by source paper "r enyi resolvability and its applications to the wiretap channel"):
  with members:
    - "corrections to wyner s common information under r enyi divergence measures"
    - "exact channel synthesis"
    - "asymptotic coupling and its applications in information theory"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "analysis of remaining uncertainties and exponents under various conditional r e nyi entropies"
    - "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "coding schemes for achieving strong secrecy at negligible cost"

Connected through hyperedge HE-8 (induced by source paper "asymptotic coupling and its applications in information theory"):
  with members:
    - "divergence scaling of fixed length binary output one to one distribution matching"
    - "measuring secrecy by the probability of a successful guess"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "generalized common information common information extraction and private sources synthesis"
    - "source channel secrecy for shannon cipher system"
    - "on the entropy of couplings"
    - "quantum secure covert communication on bosonic channels"

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)