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 "distributed channel synthesis"):
  Abstract: Two familiar notions of correlation are rediscovered as the extreme operating points for distributed synthesis of a discrete memoryless channel, in which a stochastic channel output is generated based on a compressed description of the channel input. Wyner's common information is the minimum description rate needed. However, when common randomness independent of the input is available, the necessary description rate reduces to Shannon's mutual information. This paper characterizes the optimal tradeoff between the amount of common randomness used and the required rate of description. We also include a number of related derivations, including the effect of limited local randomness, rate requirements for secrecy, applications to game theory, and new insights into common information duality. Our proof makes use of a soft covering lemma, known in the literature for its role in quantifying the resolvability of a channel. The direct proof (achievability) constructs a feasible joint distribution over all parts of the system using a soft covering, from which the behavior of the encoder and decoder is inferred, with no explicit reference to joint typicality or binning. Of auxiliary interest, this paper also generalizes and strengthens this soft covering tool.

Includes members:
  Member "secure cascade channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coordination through shared randomness")
  Member "a connection between good rate distortion codes and backward dmcs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the likelihood encoder for lossy compression")
  Member "on secure communication with constrained randomization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "publicness privacy and confidentiality in the single serving quantum broadcast channel")
  Member "achievability proof via output statistics of random binning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "channel simulation via interactive communications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication for generating correlation a unifying survey")
  Member "coordination via a relay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed source simulation with no communication")
  Member "secrecy is cheap if the adversary must reconstruct":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a large deviations approach to secure lossy compression")
  Member "generating dependent random variables over networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "coordination through shared randomness")

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)