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 extracting common random bits from correlated sources"
  Abstract: Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of random bits with high probability but without communicating. How many such bits can they extract? The trivial strategy of outputting the first $k$ bits yields an agreement probability of $(1 - \eps)^k < 2^{-1.44k\eps}$, where $\eps$ is the amount of noise. We show that no strategy can achieve agreement probability better than $2^{-k\eps/(1 - \eps)}$. #R##N#On the other hand, we show that when $k \geq 10 + 2 (1 - \eps) / \eps$, there exists a strategy which achieves an agreement probability of $0.1 (k\eps)^{-1/2} \cdot 2^{-k\eps/(1 - \eps)}$.

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 "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-4 (induced by source paper "round complexity of common randomness generation the amortized setting"):
  with members:
    - "communication rounds tradeoffs for common randomness and secret key generation"
    - "resource efficient common randomness and secret key schemes"
    - "the power of shared randomness in uncertain communication"
    - "secret key generation with limited interaction"
    - "on the role of shared randomness in simultaneous communication"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "communication complexity of permutation invariant functions"
    - "communication with imperfectly shared randomness"

Connected through hyperedge HE-5 (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"
    - "exact common information"
    - "analysis of boolean functions"
    - "simulation of a channel with another channel"

Connected through hyperedge HE-6 (induced by source paper "a note on the probability of rectangles for correlated binary strings"):
  with members:
    - "sharper upper bounds for unbalanced uniquely decodable code pairs"
    - "analysis of boolean functions"

Connected through hyperedge HE-7 (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"
    - "on non interactive simulation of joint distributions"
    - "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"

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"
    - "on non interactive simulation of joint distributions"
    - "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"
    - "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)