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 "channel simulation via interactive communications"):
  Abstract: In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals observe i.i.d.\ copies of two random variables and would like to generate i.i.d.\ copies of two other random variables jointly distributed with the observed random variables. The terminals are provided with two-way communication links, and shared common randomness, all at limited rates. Two special cases of this problem are the interactive function computation studied by Ma and Ishwar, and the tradeoff curve between one-way communication and shared randomness studied by Cuff. The latter work had inspired Gohari and Anantharam to study the general problem of channel simulation via interactive communication stated above. However only inner and outer bounds for the special case of no shared randomness were obtained in their work. In this paper we settle this problem by providing an exact computable characterization of the multi-round problem. To show this we employ the technique of "output statistics of random binning" that has been recently developed by the authors.

Includes members:
  Member "secure cascade channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coordination through shared randomness")
  Member "when is it possible to simulate a dmc channel from another":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "strong coordination over noisy channels is separation sufficient")
  Member "distributed channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")
  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 "secure channel simulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interactive secure function computation")
  Member "coordination via a relay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed source simulation with no communication")
  Member "generating dependent random variables over networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coordination through shared randomness")
  Member "communication requirements for generating correlated random variables":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed source simulation with no communication")

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)