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 "how agile is the adaptive data rate mechanism of lorawan"):
  Abstract: The LoRaWAN based Low Power Wide Area networks aim to provide long-range connectivity to a large number of devices by exploiting limited radio resources. The Adaptive Data Rate (ADR) mechanism controls the assignment of these resources to individual end-devices by a runtime adaptation of their communication parameters when the quality of links inevitably changes over time. This paper provides a detailed performance analysis of the ADR technique presented in the recently released LoRaWAN Specifications (v1.1). We show that the ADR technique lacks the agility to adapt to the changing link conditions, requiring a number of hours to days to converge to a reliable and energy-efficient communication state. As a vital step towards improving this situation, we then change different control knobs or parameters in the ADR technique to observe their effects on the convergence time.

Includes members:
  Member "fair adaptive data rate allocation and power control in lorawan":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance analysis of single cell adaptive data rate enabled lorawan")
  Member "does bidirectional traffic do more harm than good in lorawan based lpwa networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tackling contention through cooperation a distributed federation in lorawan space")
  Member "low power wide area networks an overview":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random access based reliable uplink communication and power transfer using dynamic power splitting")

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)