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: "streaming codes for channels with burst and isolated erasures"
  Abstract: We study low-delay error correction codes for streaming recovery over a class of packet-erasure channels that introduce both burst-erasures and isolated erasures. We propose a simple, yet effective class of codes whose parameters can be tuned to obtain a tradeoff between the capability to correct burst and isolated erasures. Our construction generalizes previously proposed low-delay codes which are effective only against burst erasures. We establish an information theoretic upper bound on the capability of any code to simultaneously correct burst and isolated erasures and show that our proposed constructions meet the upper bound in some special cases. We discuss the operational significance of column-distance and column-span metrics and establish that the rate 1/2 codes discovered by Martinian and Sundberg [IT Trans.\, 2004] through a computer search indeed attain the optimal column-distance and column-span tradeoff. Numerical simulations over a Gilbert-Elliott channel model and a Fritchman model show significant performance gains over previously proposed low-delay codes and random linear codes for certain range of channel parameters.

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 "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"
    - "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"

Connected through hyperedge HE-3 (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"
    - "erasure coding for real time streaming"

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

Connected through hyperedge HE-5 (induced by source paper "private streaming with convolutional codes"):
  with members:
    - "on the capacity of private information retrieval from coded colluding and adversarial servers"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "t private information retrieval schemes using transitive codes"
    - "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"
    - "the capacity of robust private information retrieval with colluding databases"

Connected through hyperedge HE-6 (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"
    - "erasure coding for real time streaming"

Connected through hyperedge HE-7 (induced by source paper "optimal streaming codes for channels with burst and arbitrary erasures"):
  with members:
    - "layered constructions for low delay streaming codes"
    - "erasure coding for real time streaming"

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

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)