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 "on optimal neighbor discovery"):
  Abstract: Mobile devices apply neighbor discovery (ND) protocols to wirelessly initiate a first contact within the shortest possible amount of time and with minimal energy consumption. For this purpose, over the last decade, a vast number of ND protocols have been proposed, which have progressively reduced the relation between the time within which discovery is guaranteed and the energy consumption. In spite of the simplicity of the problem statement, even after more than 10 years of research on this specific topic, new solutions are still proposed even today. Despite the large number of known ND protocols, given an energy budget, what is the best achievable latency still remains unclear. This paper addresses this question and for the first time presents safe and tight, duty-cycle-dependent bounds on the worst-case discovery latency that no ND protocol can beat. Surprisingly, several existing protocols are indeed optimal, which has not been known until now. We conclude that there is no further potential to improve the relation between latency and duty-cycle, but future ND protocols can improve their robustness against packet collisions.

Includes members:
  Member "neighbor discovery latency in ble like protocols":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast collision simulation for cyclic wireless protocols")
  Member "talk more listen less energy efficient neighbor discovery in wireless sensor networks":
    also connected through other hyperedges:
      (none)
  Member "maximizing broadcast throughput under ultra low power constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "neighbor discovery latency in ble like protocols")
  Member "slotless protocols for fast and energy efficient neighbor discovery":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "neighbor discovery latency in ble like protocols")
  Member "panda neighbor discovery on a power harvesting budget":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "neighbor discovery latency in ble like protocols")
  Member "on heterogeneous neighbor discovery in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "neighbor discovery latency in ble like protocols")
  Member "near optimal radio use for wireless network synchronization":
    also connected through other hyperedges:
      (none)
  Member "deterministic and energy optimal wireless synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "near optimal radio use for wireless network synchronization")

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)