human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "streaming codes for multicast over burst erasure channels"):
  Abstract: We study the capacity limits of real-time streaming over burst-erasure channels. A stream of source packets must be sequentially encoded and the resulting channel packets must be transmitted over a two-receiver burst-erasure broadcast channel. The source packets must be sequentially reconstructed at each receiver with a possibly different reconstruction deadline. We study the associated capacity as a function of burst-lengths and delays at the two receivers. #R##N#We establish that the operation of the system can be divided into two main regimes: a low-delay regime and a large-delay regime. We fully characterize the capacity in the large delay regime. The key to this characterization is an inherent slackness in the delay of one of the receivers. At every point in this regime we can reduce the delay of at-least one of the users until a certain critical value and thus it suffices to obtain code constructions for certain critical delays. We partially characterize the capacity in the low-delay regime. Our capacity results involve code constructions and converse techniques that appear to be novel. We also provide a rigorous information theoretic converse theorem in the point-to-point setting which was studied by Martinian in an earlier work.

Includes members:
  Member "layered constructions for low delay streaming codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures")
  Member "robust streaming erasure codes based on deterministic channel approximations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust low delay streaming pir using convolutional codes")
  Member "erasure coding for real time streaming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal multiplexed erasure codes for streaming messages with different decoding delays")
  Member "streaming codes for channels with burst and isolated erasures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures")
  Member "linear error correcting codes with anytime reliability":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "layered constructions for low delay streaming codes")
  Member "diversity embedded streaming erasure codes de sco constructions and optimality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures")
  Member "rateless codes for single server streaming to diverse users":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "layered constructions for low delay streaming codes")
  Member "doped fountain coding for minimum delay data collection in circular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "layered constructions for low delay streaming codes")

Question: Please tell me which class the source paper 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)