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: "linear error correcting codes with anytime reliability"
  Abstract: We consider rate R = k/n causal linear codes that map a sequence of k-dimensional binary vectors {b_t} to a sequence of n-dimensional binary vectors {c_t}, such that each c_t is a function of {b_1,b_2,...,b_t}. Such a code is called anytime reliable, for a particular binary-input memoryless channel, if at each time, probability of making an error about a source bit that was sent d time instants ago decays exponentially in d. Anytime reliable codes are useful in interactive communication problems and, in particular, can be used to stabilize unstable plants across noisy channels. Schulman proved the existence of such codes which, due to their structure, he called tree codes; however, to date, no explicit constructions and tractable decoding algorithms have been devised. In this paper, we show the existence of anytime reliable "linear" codes with "high probability", i.e., suitably chosen random linear causal codes are anytime reliable with high probability. The key is to consider time-invariant codes (i.e., ones with Toeplitz generator and parity check matrices) which obviates the need to union bound over all times. For the binary erasure channel we give a simple ML decoding algorithm whose average complexity is constant per time iteration and for which the probability that complexity at a given time t exceeds KC^3 decays exponentially in C. We show the efficacy of the method by simulating the stabilization of an unstable plant across a BEC, and remark on the tradeoffs between the utilization of the communication resources and the control performance.

Connected through hyperedge HE-1 (induced by source paper "layered constructions for low delay streaming codes"):
  with members:
    - "streaming codes for multicast over burst erasure channels"
    - "robust streaming erasure codes based on deterministic channel approximations"
    - "erasure coding for real time streaming"
    - "round robin streaming with generations"
    - "streaming codes for channels with burst and isolated erasures"
    - "diversity embedded streaming erasure codes de sco constructions and optimality"
    - "rateless codes for single server streaming to diverse users"
    - "doped fountain coding for minimum delay data collection in circular networks"

Connected through hyperedge HE-2 (induced by source paper "achievable moderate deviations asymptotics for streaming compression of correlated sources"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "exact moderate deviation asymptotics in streaming data transmission"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "streaming data transmission in the moderate deviations and central limit regimes"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "the streaming dmt of fading channels"
    - "moderate deviations in channel coding"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"

Connected through hyperedge HE-3 (induced by source paper "exact moderate deviation asymptotics in streaming data transmission"):
  with members:
    - "streaming data transmission in the moderate deviations and central limit regimes"
    - "the streaming dmt of fading channels"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-4 (induced by source paper "streaming data transmission in the moderate deviations and central limit regimes"):
  with members:
    - "exact moderate deviation asymptotics in streaming data transmission"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "on error exponents and moderate deviations for lossless streaming compression of correlated sources"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "the streaming dmt of fading channels"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-5 (induced by source paper "streaming codes for multicast over burst erasure channels"):
  with members:
    - "layered constructions for low delay streaming codes"
    - "robust streaming erasure codes based on deterministic channel approximations"
    - "erasure coding for real time streaming"
    - "streaming codes for channels with burst and isolated erasures"
    - "diversity embedded streaming erasure codes de sco constructions and optimality"
    - "rateless codes for single server streaming to diverse users"
    - "doped fountain coding for minimum delay data collection in circular networks"
    - "arq for network coding"

Connected through hyperedge HE-6 (induced by source paper "the streaming dmt of fading channels"):
  with members:
    - "erasure coding for real time streaming"
    - "streaming codes for channels with burst and isolated erasures"
    - "diversity embedded streaming erasure codes de sco constructions and optimality"
    - "on successive refinement of diversity for fading isi channels"
    - "distortion minimization in gaussian layered broadcast coding with successive refinement"
    - "high snr analysis of outage limited communications with bursty and delay limited information"
    - "on the distortion snr exponent of some layered transmission schemes"
    - "joint source channel codes for mimo block fading channels"

Connected through hyperedge HE-7 (induced by source paper "characterization of information channels for asymptotic mean stationarity and stochastic stability of non stationary unstable linear systems"):
  with members:
    - "implicit and explicit communication in decentralized control"
    - "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"

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)