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 "on improving the balance between the completion time and decoding delay in instantly decodable network coded systems"):
  Abstract: This paper studies the complicated interplay of the completion time (as a measure of throughput) and the decoding delay performance in instantly decodable network coded (IDNC) systems over wireless broadcast erasure channels with memory, and proposes two new algorithms that improve the balance between the completion time and decoding delay of broadcasting a block of packets. We first formulate the IDNC packet selection problem that provides joint control of the completion time and decoding delay as a statistical shortest path (SSP) problem. However, since finding the optimal packet selection policy using the SSP technique is computationally complex, we employ its geometric structure to find some guidelines and use them to propose two heuristic packet selection algorithms that can efficiently improve the balance between the completion time and decoding delay for broadcast erasure channels with a wide range of memory conditions. It is shown that each one of the two proposed algorithms is superior for a specific range of memory conditions. Furthermore, we show that the proposed algorithms achieve an improved fairness in terms of the decoding delay across all receivers.

Includes members:
  Member "instantly decodable versus random linear network coding a comparative framework for throughput and decoding delay performance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint optimization of throughput and packet drop rate for delay sensitive applications in tdd satellite network coded systems")
  Member "completion delay minimization for instantly decodable network codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")
  Member "throughput delay analysis of random linear network coding for wireless broadcasting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "delay complexity trade off of random linear network coding in wireless broadcast")
  Member "effective delay control in online network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reliability of multicast under random linear network coding")
  Member "informed network coding for minimum decoding delay":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks")

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)