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: "equational reasonings in wireless network gossip protocols"
  Abstract: Gossip protocols have been proposed as a robust and efficient method for#N#disseminating information throughout large-scale networks. In this paper, we#N#propose a compositional analysis technique to study formal probabilistic models#N#of gossip protocols expressed in a simple probabilistic timed process calculus#N#for wireless sensor networks. We equip the calculus with a simulation theory to#N#compare probabilistic protocols that have similar behaviour up to a certain#N#tolerance. The theory is used to prove a number of algebraic laws which#N#revealed to be very effective to estimate the performances of gossip networks,#N#with and without communication collisions, and randomised gossip networks. Our#N#simulation theory is an asymmetric variant of the weak bisimulation metric that#N#maintains most of the properties of the original definition. However, our#N#asymmetric version is particularly suitable to reason on protocols in which the#N#systems under consideration are not approximately equivalent, as in the case of#N#gossip protocols.

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.LO(Logic in Computer Science)