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: "mapping spreading dynamics from time respecting shortest paths to bond percolation"
  Abstract: We propose a mapping of spreading dynamics to an ensemble of weighted networks, where edge weights represent propagation time delays. In this mapping, shortest paths in the weighted networks preserve the temporal causality of spreading. Furthermore, for efficient sampling, we construct a Markov Chain (Gibbs sampler) over elements of an ensemble of mapped weighted networks. Our framework provides insights into the local and global spreading dynamics from arbitrary source nodes and the scaling the of average propagation time for Markovian and non-Markovian processes. Furthermore, it enables efficient source detection and helps to improve strategies for time-critical vaccination. Our framework overcomes the limitations of previous methods such as tree-like assumptions of message passing, omitting dynamical correlations with mean-field approximations, or setting all initial conditions upfront for the kinetic Monte Carlo method. Finally, in a limit of process time, we establish the connection of our mapping with bond percolation.

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.SI(Social and Information Networks)