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: "almost practical tree codes"
  Abstract: We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.

Connected through hyperedge HE-1 (induced by source paper "stabilizing a linear system using phone calls when time is information"):
  with members:
    - "optimal causal rate constrained sampling of the wiener process"
    - "theory and implementation of event triggered stabilization over digital channels"
    - "stabilizing a linear system using phone calls"
    - "tracking and control of gauss markov processes over packet drop channels with acknowledgments"
    - "event triggered stabilization of linear systems under bounded bit rates"
    - "inscribed matter communication part ii"
    - "information theory of molecular communication directions and challenges"
    - "bits through bufferless queues"

Connected through hyperedge HE-2 (induced by source paper "stabilizing a linear system using phone calls"):
  with members:
    - "event triggered stabilization of linear systems under bounded bit rates"
    - "inscribed matter communication part ii"
    - "information theory of molecular communication directions and challenges"
    - "rate cost tradeoffs in control"
    - "bits through bufferless queues"
    - "dynamic triggering mechanisms for event triggered control"

Connected through hyperedge HE-3 (induced by source paper "multi rate control over awgn channels via analog joint source channel coding"):
  with members:
    - "rate cost tradeoffs in control"
    - "the gaussian channel with noisy feedback near capacity performance via simple interaction"
    - "on zero delay source channel coding"
    - "error correcting codes for distributed control"
    - "analog matching of colored sources to colored channels"
    - "joint wyner ziv dirty paper coding by modulo lattice modulation"

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)