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 "optimal streaming erasure codes over the three node relay network"):
  Abstract: This paper investigates low-latency streaming codes for a three-node relay network. The source transmits a sequence of messages (a streaming source) to the destination through the relay between them, where the first-hop channel from the source to the relay and the second-hop channel from the relay to the destination are subject to packet erasures. Every source message must be recovered perfectly at the destination subject to a fixed decoding delay. We assume the following packet loss model for each of the two channels: A fixed number of erasures exist on the discrete timeline. Under this channel loss assumption, we fully characterize the maximum achievable rate. The lower bound is proved by using a symbol-wise decode-forward strategy where the source symbols within the same message are decoded by the relay with different delays. The upper bound is proved by analyzing the maximum achievable rate for each channel when the erasures in the other channel are consecutive (bursty). In addition, we show that message-wise decode-forward strategies, which require the source symbols within the same message to be decoded by the relay with the same delay, are sub-optimal in general.

Includes members:
  Member "optimal streaming codes for channels with burst and arbitrary erasures":
    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 "layered constructions for low delay streaming codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures")
  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")

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)