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: "secure data timestamping in synchronization free lorawan"
  Abstract: Low-power wide-area network technologies such as LoRaWAN are important for achieving ubiquitous connectivity required by the Internet of Things. Due to limited bandwidth, LoRaWAN is primarily for applications of collecting low-rate monitoring data from geographically distributed sensors. In these applications, sensor data timestamping is often a critical system function. This paper considers a synchronization-free approach of timestamping the uplink data at the LoRaWAN gateway, which can give milliseconds accuracy. Its key advantages are simplicity and no extra overhead, commensurate with the scarce communication resources of LoRaWAN. However, we show that this low-overhead approach is susceptible to a frame delay attack that can be implemented by a combination of stealthy jamming and delayed replay. To address this threat, we propose a SoftLoRa gateway design that integrates a commodity LoRaWAN gateway with a low-power software-defined radio receiver to track the inherent frequency biases of LoRaWAN end devices. With a set of efficient signal processing algorithms that are designed based on LoRaWAN's modulation method, our frequency bias estimation achieves a resolution of 0.14 parts-per-million (ppm) of the channel's central frequency. This resolution is sufficient to detect the attack that introduces an additional frequency bias of one or more ppm. We evaluate our approach in various indoor and outdoor environments. In summary, this paper presents an attack-aware and low-overhead approach to timestamping the data generated by LoRaWAN end devices.

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)