human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "common randomness and key generation with limited interaction"):
  Abstract: The basic two-terminal common randomness (CR) and key generation models are considered, where the communication between the terminals may be limited, and in particular may not be enough to achieve the maximum CR/key rate. We introduce general notions of $XY$-absolutely continuity and $XY$-concave function, and characterize the first order CR/key-communication tradeoff in terms of the evaluation of the $XY$-concave envelope of a functional defined on a set of distributions, which is simpler than the multi-letter characterization. Two extreme cases are given special attention. First, in the regime of very small communication rates, the CR bits per interaction bit (CRBIB) and key bits per interaction bit (KBIB) are expressed with a new "symmetrical strong data processing constant", defined as the minimum of a parameter such that a certain information-theoretic functional touches its $XY$-concave envelope at a given source distribution. We also provide a computationally friendly strong converse bound for CRBIB and a similar (but not necessarily strong) one for KBIB in terms of the supremum of the maximal correlation coefficient over a set of distributions. The proof uses hypercontractivity and properties of the R\'enyi divergence. A criterion the tightness of the bound is given with applications to binary symmetric sources. Second, a new characterization of the minimum interaction rate needed for achieving the maximum key rate (MIMK) is given, and we resolve a conjecture by Tyagi and Narayan \cite{tyagi2013common} regarding the MIMK for binary sources. We also propose a new conjecture for binary symmetric sources.

Includes members:
  Member "the likelihood encoder for lossy compression":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "keyless covert communication via channel state information")
  Member "asymptotic estimates in information theory with non vanishing error probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite sample analysis of image registration")
  Member "secret key generation with one communicator and a one shot converse via hypercontractivity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication for generating correlation a unifying survey")
  Member "a note on the strong data processing inequalities in bayesian networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "comparison of channels criteria for domination by a symmetric channel")
  Member "converses for secret key agreement and secure computing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "secret key agreement general capacity and second order asymptotics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a capacity achieving one message key agreement with finite blocklength analysis")
  Member "key capacity for product sources with application to stationary gaussian processes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication for generating correlation a unifying survey")
  Member "outer bounds for multiterminal source coding via a strong data processing inequality":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "information theoretic perspectives on brascamp lieb inequality and its reverse")

Question: Please tell me which class the source paper 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)