human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "strong coordination of signals and actions over noisy channels"
  Abstract: -We develop a random binning scheme for strong coordination in a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of non-causal encoding and decoding, we propose a joint source-channel coding scheme and develop inner and outer bounds for the strong coordination region. While the set of achievable target distributions is the same as for empirical coordination, we characterize the rate of common randomness required for strong coordination.

Connected through hyperedge HE-1 (induced by source paper "empirical coordination subject to a fidelity criterion"):
  with members:
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "coordination in distributed networks via coded actions with application to power control"
    - "empirical coordination with two sided state information and correlated source and state"
    - "empirical coordination with channel feedback and strictly causal or causal encoding"
    - "empirical coordination in a triangular multiterminal network"

Connected through hyperedge HE-2 (induced by source paper "fixed length strong coordination"):
  with members:
    - "strong coordination of signals and actions over noisy channels with two sided state information"
    - "non asymptotic output statistics of random binning and its applications"
    - "achievability proof via output statistics of random binning"
    - "fixed length lossy compression in the finite blocklength regime"

Connected through hyperedge HE-3 (induced by source paper "strong coordination of signals and actions over noisy channels with two sided state information"):
  with members:
    - "persuasion with limited communication capacity"
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "joint coordination channel coding for strong coordination over noisy channels based on polar codes"
    - "empirical and strong coordination via soft covering with polar codes"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "secure cascade channel synthesis"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "correlation between channel state and information source with empirical coordination constraint"

Connected through hyperedge HE-4 (induced by source paper "strong coordination over noisy channels with strictly causal encoding"):
  with members:
    - "strong coordination of signals and actions over noisy channels with two sided state information"
    - "polar codes for empirical coordination over noisy channels with strictly causal encoding"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for secret key generation"
    - "simulation of a channel with another channel"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"
    - "hybrid codes needed for coordination over the point to point channel"

Connected through hyperedge HE-5 (induced by source paper "joint coordination channel coding for strong coordination over noisy channels based on polar codes"):
  with members:
    - "strong coordination over noisy channels is separation sufficient"
    - "empirical and strong coordination via soft covering with polar codes"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "polar codes for broadcast channels"
    - "strong coordination over multi hop line networks"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "strong coordination over a line network"

Connected through hyperedge HE-6 (induced by source paper "joint empirical coordination of source and channel"):
  with members:
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "coordination in distributed networks via coded actions with application to power control"
    - "secure cascade channel synthesis"
    - "strong coordination over multi hop line networks"
    - "zero error coordination"
    - "empirical coordination with two sided state information and correlated source and state"
    - "empirical coordination with channel feedback and strictly causal or causal encoding"

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