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 "instantly decodable network coding for real time scalable video broadcast over wireless networks"):
  Abstract: In this paper, we study real-time scalable video broadcast over wireless networks using instantly decodable network coding (IDNC). Such real-time scalable videos have hard deadline and impose a decoding order on the video layers. We first derive the upper bound on the probability that the individual completion times of all receivers meet the deadline. Using this probability, we design two prioritized IDNC algorithms, namely the expanding window IDNC (EW-IDNC) algorithm and the non-overlapping window IDNC (NOW-IDNC) algorithm. These algorithms provide a high level of protection to the most important video layer, namely the base layer, before considering additional video layers, namely the enhancement layers, in coding decisions. Moreover, in these algorithms, we select an appropriate packet combination over a given number of video layers so that these video layers are decoded by the maximum number of receivers before the deadline. We formulate this packet selection problem as a two-stage maximal clique selection problem over an IDNC graph. Simulation results over a real scalable video sequence show that our proposed EW-IDNC and NOW-IDNC algorithms improve the received video quality compared to the existing IDNC algorithms.

Includes members:
  Member "resource allocation frameworks for network coded layered multimedia multicast services":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resource allocation for loss tolerant video streaming in embms")
  Member "adaptive prioritized random linear coding and scheduling for layered data delivery from multiple servers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a rolling horizon dynamic programming approach for collaborative caching")
  Member "fulcrum network codes a code for fluid allocation of complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a markov chain model for the decoding probability of sparse network coding")
  Member "coding based data broadcasting for time critical applications with rate adaptation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on resource allocation in vehicular networks")
  Member "random linear network coding for wireless layered video broadcast general design methods for adaptive feedback free transmission":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "network coding based evolutionary network formation for dynamic wireless networks")
  Member "partially blind instantly decodable network codes for lossy feedback environment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "data dissemination using instantly decodable binary codes in fog radio access networks")
  Member "network coding meets multimedia a review":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "agile data offloading over novel fog computing infrastructure for cavs")
  Member "joint coding and scheduling optimization in wireless systems with varying delay sensitivities":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "adaptive causal network coding with feedback")

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)