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 "packet loss recovery in broadcast for real time applications in dense wireless networks"):
  Abstract: Packet loss recovery in wireless broadcast is challenging, particularly for real-time applications which have strict and short delivery deadline. To recover the maximum number of lost packets within a short time, existing packet recovery solutions often rely on instantly decodable network coding (IDNC). Some of these solutions can recover nearly the maximum number of lost packets possible at the cost of collecting feedback from all (or a large percentage of) users. This is impractical in dense networks. In addition, their runtime grows with the number of users, which is not desirable due to the urgent delivery deadline of real-time applications. In this work, we introduce RIDNC, a random encoding approach to IDNC. We propose RACE, a light RIDNC encoder that can recover nearly as many lost packets as the optimal RIDNC encoder. We compare RACE with the CrowdWiFi encoder, a high performing packet loss recovery solution used in CrowdWiFi, a commercial system for broadcasting live video in dense networks. We show that RACE is up to two orders of magnitude faster than the CrowdWiFi encoder, and recovers more lost packets in practice, where there is not enough time to collect feedback from many users.

Includes members:
  Member "on coding for cooperative data exchange":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "embedded index coding")
  Member "broadcasting in time division duplexing a random linear network coding approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the packet decoding delay of linear network coded wireless broadcast")
  Member "informed network coding for minimum decoding delay":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the packet decoding delay of linear network coded wireless broadcast")
  Member "random linear network coding for time division duplexing when to stop talking and start listening":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "network coded handover in ieee 802 11")
  Member "random linear network coding a free cipher":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "random linear network coding on programmable switches")
  Member "opportunistic network coding for video streaming over wireless":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "content aware network coding over device to device 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.NI(Networking and Internet Architecture)