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: "optimal streaming codes for channels with burst and arbitrary erasures"
  Abstract: This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. Every source message must be recovered perfectly at the destination subject to a fixed decoding delay. We assume that the channel loss model induces either one burst erasure or multiple arbitrary erasures in any fixed-sized sliding window. Under this channel loss model assumption, we fully characterize the maximum achievable rate by constructing streaming codes that achieve the optimal rate. In addition, our construction of optimal streaming codes implies the full characterization of the maximum achievable rate for convolutional codes with any given column distance, column span and decoding delay. Numerical results demonstrate that the optimal streaming codes outperform existing streaming codes of comparable complexity over some instances of the Gilbert-Elliott channel and the Fritchman channel.

Connected through hyperedge HE-1 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures"):
  with members:
    - "low field size rate optimal streaming codes for channels with burst and random erasures"
    - "optimal multiplexed erasure codes for streaming messages with different decoding delays"
    - "an explicit rate optimal streaming code for channels with burst and arbitrary erasures"
    - "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"
    - "rate optimal streaming codes for channels with burst and isolated erasures"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "layered constructions for low delay streaming codes"

Connected through hyperedge HE-2 (induced by source paper "low latency network adaptive error control for interactive streaming"):
  with members:
    - "adaptive causal network coding with feedback"
    - "tiny codes for guaranteeable delay"
    - "rate optimal streaming codes for channels with burst and isolated erasures"
    - "congestion control using fec for conversational multimedia communication"
    - "the effect of block wise feedback on the throughput delay trade off in streaming"

Connected through hyperedge HE-3 (induced by source paper "an explicit rate optimal streaming code for channels with burst and arbitrary erasures"):
  with members:
    - "low field size rate optimal streaming codes for channels with burst and random erasures"
    - "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures"
    - "rate optimal streaming codes for channels with burst and isolated erasures"
    - "layered constructions for low delay streaming codes"
    - "streaming codes for channels with burst and isolated erasures"

Connected through hyperedge HE-4 (induced by source paper "optimal multiplexed erasure codes for streaming messages with different decoding delays"):
  with members:
    - "layered constructions for low delay streaming codes"
    - "zero delay sequential transmission of markov sources over burst erasure channels"
    - "erasure coding for real time streaming"
    - "streaming codes for channels with burst and isolated erasures"

Connected through hyperedge HE-5 (induced by source paper "optimal streaming erasure codes over the three node relay network"):
  with members:
    - "layered constructions for low delay streaming codes"
    - "erasure coding for real time streaming"
    - "streaming codes for channels with burst and isolated erasures"

Connected through hyperedge HE-6 (induced by source paper "rate optimal streaming codes for channels with burst and isolated erasures"):
  with members:
    - "layered constructions for low delay streaming codes"
    - "streaming codes for channels with burst and isolated erasures"

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)