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: "diversity embedded streaming erasure codes de sco constructions and optimality"
  Abstract: Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper introduces diversity embedded streaming erasure codes (DE-SCo), that provide a flexible tradeoff between the channel quality and receiver delay. When the channel conditions are good, the source stream is recovered with a low delay, whereas when the channel conditions are poor the source stream is still recovered, albeit with a larger delay. Information theoretic analysis of the underlying burst-erasure broadcast channel reveals that DE-SCo achieve the minimum possible delay for the weaker user, without sacrificing the performance of the stronger user. A larger class of multicast streaming erasure codes (MU-SCo) that achieve optimal tradeoff between rate, delay and erasure-burst length is also constructed.

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"
    - "optimal streaming codes 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"

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"
    - "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"
    - "linear error correcting codes with anytime reliability"
    - "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 "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"
    - "linear error correcting codes with anytime reliability"
    - "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-4 (induced by source paper "throughput and delay analysis in video streaming over block fading channels"):
  with members:
    - "erasure coding for real time streaming"
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "distortion minimization in gaussian layered broadcast coding with successive refinement"
    - "joint source channel codes for mimo block fading channels"

Connected through hyperedge HE-5 (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"
    - "linear error correcting codes with anytime reliability"
    - "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-6 (induced by source paper "streaming codes for channels with burst and isolated erasures"):
  with members:
    - "erasure coding for real time streaming"
    - "throughput and latency in finite buffer line networks"
    - "rateless codes for single server streaming to diverse users"
    - "doped fountain coding for minimum delay data collection in circular networks"

Connected through hyperedge HE-7 (induced by source paper "streaming transmitter over block fading channels with delay constraint"):
  with members:
    - "erasure coding for real time streaming"
    - "fading broadcast channels with state information at the receivers"

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)