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 "groups net group meetings aware routing in multi hop d2d networks"):
  Abstract: In the next generation cellular networks, device-to-device (D2D) communication is already considered a fundamental feature. A problem of multi-hop D2D networks is on how to define forwarding algorithms that achieve, at the same time, high delivery ratio and low network overhead. In this paper we aim to understand group meetings' properties by looking at their structure and regularity with the final goal of applying such knowledge in the design of a forwarding algorithm for D2D multi-hop networks. We introduce a forwarding protocol, namely GROUPS-NET, which is aware of social group meetings and their evolution over time. Our algorithm is parameter-calibration free and does not require any knowledge about the social network structure of the system. In particular, different from the state of the art algorithms, GROUPS-NET does not need communities detection, which is a complex and expensive task. We validate our algorithm using different publicly available data-sources. In real large scale scenarios, our algorithm achieves approximately the same delivery ratio of the state-of-art solution with up to 40% less network overhead.

Includes members:
  Member "group mobility detection tracking and characterization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "grm group regularity mobility model")
  Member "a survey on device to device communication in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simultaneous energy harvesting and information transmission in a mimo full duplex system a machine learning based design")
  Member "an overview on 3gpp device to device proximity services":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spectrum sharing for device to device communication in cellular networks")
  Member "on the dynamics of human proximity for data diffusion in ad hoc networks":
    also connected through other hyperedges:
      (none)
  Member "estimating network parameters for selecting community detection algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an exact no free lunch theorem for community detection")
  Member "swim a simple model to generate small mobile worlds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lightweight joint simulation of vehicular mobility and communication with limosim")

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)