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 "strong coordination over noisy channels is separation sufficient"):
  Abstract: We study the problem of strong coordination of actions of two agents X and Y that communicate over a noisy communication channel such that the actions follow a given joint probability distribution. We propose two novel schemes for this noisy strong coordination problem, and derive inner bounds for the underlying strong coordination capacity region. The first scheme is a joint coordination-channel coding scheme that utilizes the randomness provided by the communication channel to reduce the local randomness required in generating the action sequence at agent Y. The second scheme exploits separate coordination and channel coding where local randomness is extracted from the channel after decoding. Finally, we present an example in which the joint scheme is able to outperform the separate scheme in terms of coordination rate.

Includes members:
  Member "strong coordination over multi hop line networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal communication rates and combinatorial properties for distributed simulation")
  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 of signals and actions over noisy channels")
  Member "strong coordination over a line network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coordination through shared randomness")
  Member "empirical coordination in a triangular multiterminal network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "empirical coordination subject to a fidelity criterion")
  Member "distributed channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")
  Member "channel simulation via interactive communications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication for generating correlation a unifying survey")
  Member "coordination via a relay":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed source simulation with no communication")
  Member "hybrid codes needed for coordination over the point to point channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "strategic communication with side information at the decoder")

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)