human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "slotless protocols for fast and energy efficient neighbor discovery"
  Abstract: In mobile ad-hoc networks, neighbor discovery protocols are used to find surrounding devices and to establish a first contact between them. Since the clocks of the devices are not synchronized and their energy-budgets are limited, usually duty-cycled, asynchronous discovery protocols are applied. Only if two devices are awake at the same point in time, they can rendezvous. Currently, time-slotted protocols, which subdivide time into multiple intervals with equal lengths (slots), are considered to be the most efficient discovery schemes. In this paper, we break away from the assumption of slotted time. We propose a novel, continuous-time discovery protocol, which temporally decouples beaconing and listening. Each device periodically sends packets with a certain interval, and periodically listens for a given duration with a different interval. By optimizing these interval lengths, we show that this scheme can, to the best of our knowledge, outperform all known protocols such as DISCO, U-Connect or Searchlight significantly. For example, Searchlight takes up to 740 % longer than our proposed technique to discover a device with the same duty-cycle. Further, our proposed technique can also be applied in widely-used asymmetric purely interval-based protocols such as ANT or Bluetooth Low Energy.

Connected through hyperedge HE-1 (induced by source paper "on optimal neighbor discovery"):
  with members:
    - "neighbor discovery latency in ble like protocols"
    - "talk more listen less energy efficient neighbor discovery in wireless sensor networks"
    - "maximizing broadcast throughput under ultra low power constraints"
    - "panda neighbor discovery on a power harvesting budget"
    - "on heterogeneous neighbor discovery in wireless sensor networks"
    - "near optimal radio use for wireless network synchronization"
    - "deterministic and energy optimal wireless synchronization"

Connected through hyperedge HE-2 (induced by source paper "neighbor discovery latency in ble like protocols"):
  with members:
    - "maximizing broadcast throughput under ultra low power constraints"
    - "panda neighbor discovery on a power harvesting budget"
    - "on heterogeneous neighbor discovery in wireless sensor networks"
    - "precise energy modeling for the bluetooth low energy protocol"

Question: Please tell me which class the center node 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)