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 "analysis of overlapped chunked codes with small chunks over line networks"):
  Abstract: To lower the complexity of network codes over packet line networks with arbitrary schedules, chunked codes (CC) and overlapped chunked codes (OCC) were proposed in earlier works. These codes have been previously analyzed for relatively large chunks. In this paper, we prove that for smaller chunks, CC and OCC asymptotically approach the capacity with an arbitrarily small but non-zero constant gap. We also show that unlike the case for large chunks, the larger is the overlap size, the better would be the tradeoff between the speed of convergence and the message or packet error rate. This implies that OCC are superior to CC for shorter chunks. Simulations consistent with the theoretical results are also presented, suggesting great potential for the application of OCC for multimedia transmission over packet networks.

Includes members:
  Member "network codes with overlapping chunks over line networks a case for linear time codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on efficient decoding and design of sparse random linear network codes")
  Member "effects of the generation size and overlap on throughput and complexity in randomized linear network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on efficient decoding and design of sparse random linear network codes")
  Member "overlapped chunked network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the benefit of limited feedback to generation based random linear network coding in wireless broadcast")
  Member "sparse network coding with overlapping classes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "upper bound scalability on achievable rates of batched codes for line networks")
  Member "coding schemes for line networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "random linear network coding for 5g mobile video delivery")

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)