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 "network coding for video distortion reduction in device to device communications"):
  Abstract: In this paper, we study the problem of distributing a real-time video sequence to a group of partially connected cooperative wireless devices using instantly decodable network coding (IDNC). In such a scenario, the coding conflicts occur to service multiple devices with an immediately decodable packet and the transmission conflicts occur from simultaneous transmissions of multiple devices. To avoid these conflicts, we introduce a novel IDNC graph that represents all feasible coding and transmission conflict-free decisions in one unified framework. Moreover, a real-time video sequence has a hard deadline and unequal importance of video packets. Using these video characteristics and the new IDNC graph, we formulate the problem of minimizing the mean video distortion before the deadline as a finite horizon Markov decision process (MDP) problem. However, the backward induction algorithm that finds the optimal policy of the MDP formulation has high modelling and computational complexities. To reduce these complexities, we further design a two-stage maximal independent set selection algorithm, which can efficiently reduce the mean video distortion before the deadline. Simulation results over a real video sequence show that our proposed IDNC algorithms improve the received video quality compared to the existing IDNC algorithms.

Includes members:
  Member "adaptive prioritized random linear coding and scheduling for layered data delivery from multiple servers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a rolling horizon dynamic programming approach for collaborative caching")
  Member "content aware instantly decodable network coding over wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "device to device networking meets cellular via network coding")
  Member "delay reduction in multi hop device to device communication using network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")
  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-4 (induced by source paper "network coding based evolutionary network formation for dynamic wireless networks")
  Member "data dissemination in wireless networks with network coding":
    also connected through other hyperedges:
      (none)
  Member "coded cooperative data exchange in multihop networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "part i improving computational efficiency of communication for omniscience")
  Member "coded cooperative data exchange problem for general topologies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a monetary mechanism for stabilizing cooperative data exchange with selfish users")
  Member "joint coding and scheduling optimization in wireless systems with varying delay sensitivities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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.NI(Networking and Internet Architecture)