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 "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures"):
  Abstract: This paper presents a new construction of error correcting codes which achieves optimal recovery of a streaming source over a packet erasure channel. The channel model considered is the sliding window erasure model, with burst and arbitrary losses, introduced by Badr et al. . Recently, two independents works by Fong et al. and Krishnan and Kumar have identified optimal streaming codes within this framework. In this paper, we introduce streaming code when the rate of the code is at least 1/2. Our proposed construction is explicit and systematic, uses off-the-shelf maximum distance separable (MDS) codes and maximum rank distance (MRD) Gabidulin block codes as constituent codes and achieves the optimal error correction. It presents a natural generalization to the construction of Martinian and Sundberg to tolerate an arbitrary number of sparse erasures. The field size requirement which depends on the constituent MDS and MRD codes is also analyzed.

Includes members:
  Member "low field size rate optimal streaming codes for channels with burst and random erasures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an explicit rate optimal streaming code for channels with burst and arbitrary erasures")
  Member "optimal multiplexed erasure codes for streaming messages with different decoding delays":
    also connected through other hyperedges:
      (none)
  Member "an explicit rate optimal streaming code for channels with burst and arbitrary erasures":
    also connected through other hyperedges:
      (none)
  Member "optimal streaming codes for channels with burst and arbitrary erasures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low latency network adaptive error control for interactive streaming")
  Member "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "rate optimal streaming codes for channels with burst and isolated erasures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "low latency network adaptive error control for interactive streaming")
  Member "on the genericity of maximum rank distance and gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "new criteria for mrd and gabidulin codes and some rank metric code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decoding high order interleaved rank metric 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)