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: "erasure coding for real time streaming"
  Abstract: We consider a real-time streaming system where messages are created sequentially at the source, and are encoded for transmission over a packet erasure channel. Each message must subsequently be decoded at the receiver within a given delay from its creation time. We consider code design and maximum message rates when all messages must be decodable by their respective deadlines under a specified set of erasure patterns (erasure model). Specifically, we provide a code construction that achieves the optimal rate for an asymptotic number of messages, under erasure models containing a limited number of erasures per coding window, per sliding window, and containing erasure bursts of a limited length.

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

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

Connected through hyperedge HE-3 (induced by source paper "optimal streaming codes for channels with burst and arbitrary erasures"):
  with members:
    - "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 "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"
    - "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-5 (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"
    - "robust streaming erasure codes based on deterministic channel approximations"
    - "a new class of superregular matrices and mdp convolutional codes"

Connected through hyperedge HE-6 (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"
    - "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-7 (induced by source paper "throughput and delay analysis in video streaming over block fading channels"):
  with members:
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "diversity embedded streaming erasure codes de sco constructions and optimality"
    - "distortion minimization in gaussian layered broadcast coding with successive refinement"
    - "joint source channel codes for mimo block fading channels"

Connected through hyperedge HE-8 (induced by source paper "zero delay sequential transmission of markov sources over burst erasure channels"):
  with members:
    - "streaming codes for channels with burst and isolated erasures"
    - "the gaussian many help one distributed source coding problem"

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)