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: "on non interactive simulation of joint distributions"
  Abstract: We consider the following non-interactive simulation problem: Alice and Bob observe sequences $X^n$ and $Y^n$ respectively where $\{(X_i, Y_i)\}_{i=1}^n$ are drawn i.i.d. from $P(x,y),$ and they output $U$ and $V$ respectively which is required to have a joint law that is close in total variation to a specified $Q(u,v).$ It is known that the maximal correlation of $U$ and $V$ must necessarily be no bigger than that of $X$ and $Y$ if this is to be possible. Our main contribution is to bring hypercontractivity to bear as a tool on this problem. In particular, we show that if $P(x,y)$ is the doubly symmetric binary source, then hypercontractivity provides stronger impossibility results than maximal correlation. Finally, we extend these tools to provide impossibility results for the $k$-agent version of this problem.

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"
    - "empirical coordination with two sided state information and correlated source and state"
    - "empirical coordination with channel feedback and strictly causal or causal encoding"
    - "exact common information"

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"
    - "a stronger soft covering lemma and applications"
    - "zero error coordination"
    - "exact common information"
    - "analysis of boolean functions"
    - "simulation of a channel with another channel"
    - "distributed channel synthesis"

Connected through hyperedge HE-4 (induced by source paper "sharp bounds for mutual covering"):
  with members:
    - "exact soft covering exponent"
    - "a unified framework for one shot achievability via the poisson matching lemma"
    - "strong functional representation lemma and applications to coding theorems"
    - "secret key generation with limited interaction"
    - "the likelihood encoder for lossy compression"
    - "the generalized stochastic likelihood decoder random coding and expurgated bounds"
    - "one shot mutual covering lemma and marton s inner bound with a common message"
    - "one shot marton inner bound for classical quantum broadcast channel"

Connected through hyperedge HE-5 (induced by source paper "bounds on the average distance and distance enumerator with applications to non interactive simulation"):
  with members:
    - "second order converses via reverse hypercontractivity"
    - "dictator functions maximize mutual information"
    - "analysis of boolean functions"
    - "strong data processing inequalities and phi sobolev inequalities for discrete channels"
    - "lower bounds on the minimum average distance of binary codes"

Connected through hyperedge HE-6 (induced by source paper "communication rounds tradeoffs for common randomness and secret key generation"):
  with members:
    - "dimension reduction for polynomials over gaussian space and applications"
    - "resource efficient common randomness and secret key schemes"
    - "decidability of non interactive simulation of joint distributions"
    - "on the role of shared randomness in simultaneous communication"
    - "communication complexity of permutation invariant functions"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"
    - "common information and secret key capacity"
    - "on extracting common random bits from correlated sources on large alphabets"

Connected through hyperedge HE-7 (induced by source paper "information theoretic perspectives on brascamp lieb inequality and its reverse"):
  with members:
    - "arimoto r enyi conditional entropy and bayesian m ary hypothesis testing"
    - "strengthening the entropy power inequality"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "brascamp lieb inequality and its reverse an information theoretic view"
    - "converses for distributed estimation via strong data processing inequalities"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "a note on the strong data processing inequalities in bayesian networks"
    - "communication lower bounds for statistical estimation problems via a distributed data processing inequality"

Connected through hyperedge HE-8 (induced by source paper "on the sub optimality of single letter coding over networks"):
  with members:
    - "dictator functions maximize mutual information"
    - "analysis of boolean functions"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "a new data processing inequality and its applications in distributed source and channel coding"
    - "on extracting common random bits from correlated sources"
    - "robust distributed source coding"

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)