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: "robust streaming erasure codes based on deterministic channel approximations"
  Abstract: We study near optimal error correction codes for real-time communication. In our setup the encoder must operate on an incoming source stream in a sequential manner, and the decoder must reconstruct each source packet within a fixed playback deadline of $T$ packets. The underlying channel is a packet erasure channel that can introduce both burst and isolated losses. #R##N#We first consider a class of channels that in any window of length ${T+1}$ introduce either a single erasure burst of a given maximum length $B,$ or a certain maximum number $N$ of isolated erasures. We demonstrate that for a fixed rate and delay, there exists a tradeoff between the achievable values of $B$ and $N,$ and propose a family of codes that is near optimal with respect to this tradeoff. We also consider another class of channels that introduce both a burst {\em and} an isolated loss in each window of interest and develop the associated streaming codes. #R##N#All our constructions are based on a layered design and provide significant improvements over baseline codes in simulations over the Gilbert-Elliott channel.

Connected through hyperedge HE-1 (induced by source paper "robust low delay streaming pir using convolutional codes"):
  with members:
    - "private information retrieval from locally repairable databases with colluding servers"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "robust private information retrieval on coded data"
    - "layered constructions for low delay streaming codes"
    - "superregular matrices and applications to convolutional codes"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval from coded databases"
    - "decoding of convolutional codes over the erasure channel"

Connected through hyperedge HE-2 (induced by source paper "layered constructions for low delay streaming codes"):
  with members:
    - "streaming codes for multicast over burst erasure channels"
    - "erasure coding for real time streaming"
    - "round robin streaming with generations"
    - "streaming codes for channels with burst and isolated erasures"
    - "linear error correcting codes with anytime reliability"
    - "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-3 (induced by source paper "on the construction of jointly superregular lower triangular toeplitz matrices"):
  with members:
    - "convolutional codes with maximum column sum rank for network streaming"
    - "a new class of superregular matrices and mdp convolutional codes"
    - "erasure coding for real time streaming"

Connected through hyperedge HE-4 (induced by source paper "streaming codes for multicast over burst erasure channels"):
  with members:
    - "layered constructions for low delay streaming codes"
    - "erasure coding for real time streaming"
    - "streaming codes for channels with burst and isolated erasures"
    - "linear error correcting codes with anytime reliability"
    - "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-5 (induced by source paper "the effect of block wise feedback on the throughput delay trade off in streaming"):
  with members:
    - "effective delay control in online network coding"
    - "arq for network coding"

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)