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: "exact common information"
  Abstract: This paper introduces the notion of exact common information, which is the minimum description length of the common randomness needed for the exact distributed generation of two correlated random variables $(X,Y)$. We introduce the quantity $G(X;Y)=\min_{X\to W \to Y} H(W)$ as a natural bound on the exact common information and study its properties and computation. We then introduce the exact common information rate, which is the minimum description rate of the common randomness for the exact generation of a 2-DMS $(X,Y)$. We give a multiletter characterization for it as the limit $\bar{G}(X;Y)=\lim_{n\to \infty}(1/n)G(X^n;Y^n)$. While in general $\bar{G}(X;Y)$ is greater than or equal to the Wyner common information, we show that they are equal for the Symmetric Binary Erasure Source. We do not know, however, if the exact common information rate has a single letter characterization in general.

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 "coordination through shared randomness"):
  with members:
    - "communication for generating correlation a survey"
    - "on the optimality of secret key agreement via omniscience"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "secure cascade channel synthesis"
    - "on non interactive simulation of joint distributions"
    - "empirical coordination with two sided state information and correlated source and state"
    - "empirical coordination with channel feedback and strictly causal or causal encoding"

Connected through hyperedge HE-3 (induced by source paper "distributed source simulation with no communication"):
  with members:
    - "decidability of non interactive simulation of joint distributions"
    - "secure cascade channel synthesis"
    - "on non interactive simulation of joint distributions"
    - "a stronger soft covering lemma and applications"
    - "zero error coordination"
    - "analysis of boolean functions"
    - "simulation of a channel with another channel"
    - "distributed channel synthesis"

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"
    - "distributed simulation of continuous random variables"
    - "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"
    - "distributed simulation of continuous random variables"
    - "generalized common information common information extraction and private sources synthesis"
    - "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"
    - "distributed simulation of continuous random variables"
    - "generalized common information common information extraction and private sources synthesis"
    - "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 "wyner s common information under r enyi divergence measures"):
  with members:
    - "second order region for gray wyner network"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "analysis of remaining uncertainties and exponents under various conditional r e nyi entropies"
    - "exponent function for source coding with side information at the decoder at rates below the rate distortion function"
    - "on the renyi divergence joint range of relative entropies and a channel coding theorem"
    - "renyi divergence and kullback leibler divergence"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-8 (induced by source paper "strong functional representation lemma and applications to coding theorems"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "distributed simulation of continuous random variables"
    - "one shot mutual covering lemma and marton s inner bound with a common message"
    - "resolvability in e γ with applications to lossy compression and wiretap channels"
    - "variable length compression allowing errors"
    - "a technique for deriving one shot achievability results in network information theory"
    - "distributed channel synthesis"
    - "information equals amortized communication"

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)