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 "application layer coding for iot benefits limitations and implementation aspects"):
  Abstract: One of the key technologies for future IoT/M2M systems are low power wide area networks, which are designed to support a massive number of low-end devices often in the unlicensed shared spectrum using random access protocols. However these usually operate without centralised control and since Automatic Repeat request and acknowledgement mechanisms are not very effective due to the strict duty cycles limits and high interference in the shared bands, many packets are lost from collisions. In this paper we analyse a recently proposed application layer coding scheme, which aims to recover lost packets by introducing redundancy in the form of a fountain code. We show how latency and decoding complexity is affected by the packet loss rate but also prove that there is a limit to what can be achieved by introducing more redundancy. The analysis is backed up by simulation results.

Includes members:
  Member "does bidirectional traffic do more harm than good in lorawan based lpwa networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tackling contention through cooperation a distributed federation in lorawan space")
  Member "low power wide area network analysis can lora scale":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance analysis of single cell adaptive data rate enabled lorawan")

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)