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: "fast collision simulation for cyclic wireless protocols"
  Abstract: With most modern smartphones supporting wireless protocols such as Bluetooth Low Energy (BLE) or ANT+, the number of networks are growing rapidly. Therefore, collisions among multiple networks need to be considered for choosing the appropriate protocol parameters. With growing numbers of networks, simulations for estimating the collision rate become computationally very complex and lengthy. The large simulation times therefore constitute a major limitation in the analysis of complex cases. In this paper, we present a novel simulation technique which can speed up collision simulations by one order of magnitude in realistic situations. Whenever the transmission of a packet is simulated, the cyclic nature of protocols like BLE is exploited to predict the next packet that has a chance of colliding. All transmissions in between can be skipped without affecting the simulation results. Based on the transmission intervals of the networks, one can compute a certain shrinkage per cycle of the time offset between their packets. Using this shrinkage and the current offset between the starting times of any two packets, our proposed simulation model can accurately predict the next pair of packets that needs to be simulated. Whereas our proposed technique aims at the BLE protocol, the theory is generic and can be used for many other cyclic protocols such as ANT/ANT+ as well.

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)