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 "when is it possible to simulate a dmc channel from another"):
  Abstract: In this paper, we study the problem of simulating a DMC channel from another DMC channel. We assume that the input to the channel we are simulating is i.i.d. and that the transmitter and receivers are provided with common randomness at limited rates. We prove bounds for simulating point-to-point, MAC and broadcast channels. As a special case, we recover the achievability part of the result of Cuff for point-to-point channel simulation via a noiseless link and shared randomness.

Includes members:
  Member "achievability proof via output statistics of random binning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "communication for generating correlation a unifying survey")
  Member "hybrid codes needed for coordination over the point to point channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strategic communication with side information at the decoder")
  Member "a new data processing inequality and its applications in distributed source and channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "estimation efficiency under privacy constraints")
  Member "communication requirements for generating correlated random variables":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)