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: "implicit and explicit communication in decentralized control"
  Abstract: There has been substantial progress recently in understanding toy problems of purely implicit signaling. These are problems where the source and the channel are implicit -- the message is generated endogenously by the system, and the plant itself is used as a channel. In this paper, we explore how implicit and explicit communication can be used synergistically to reduce control costs. The setting is an extension of Witsenhausen's counterexample where a rate-limited external channel connects the two controllers. Using a semi-deterministic version of the problem, we arrive at a binning-based strategy that can outperform the best known strategies by an arbitrarily large factor. We also show that our binning-based strategy attains within a constant factor of the optimal cost for an asymptotically infinite-length version of the problem uniformly over all problem parameters and all rates on the external channel. For the scalar case, although our results yield approximate optimality for each fixed rate, we are unable to prove approximately-optimality uniformly over all rates.

Connected through hyperedge HE-1 (induced by source paper "strong coordination over multi hop line networks"):
  with members:
    - "coordination in distributed networks via coded actions with application to power control"
    - "secure cascade channel synthesis"
    - "coordination in state dependent distributed networks the two agent case"
    - "correlation between channel state and information source with empirical coordination constraint"
    - "strong coordination over a line network"
    - "empirical coordination in a triangular multiterminal network"
    - "distributed channel synthesis"
    - "channel simulation via interactive communications"

Connected through hyperedge HE-2 (induced by source paper "characterization of information channels for asymptotic mean stationarity and stochastic stability of non stationary unstable linear systems"):
  with members:
    - "linear error correcting codes with anytime reliability"
    - "unequal error protection an information theoretic perspective"
    - "error exponents for variable length block codes with feedback and cost constraints"
    - "a note on rate distortion functions for nonstationary gaussian autoregressive processes"
    - "finite state channels with time invariant deterministic feedback"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-3 (induced by source paper "is witsenhausen s counterexample a relevant toy"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "lecture notes on network information theory"
    - "the finite dimensional witsenhausen counterexample"
    - "a deterministic approach to wireless relay networks"

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)