human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "modelling probabilistic wireless networks"):
  Abstract: We propose a process calculus to model high level wireless systems, where the#N#topology of a network is described by a digraph. The calculus enjoys features#N#which are proper of wireless networks, namely broadcast communication and#N#probabilistic behaviour. We first focus on the problem of composing wireless#N#networks, then we present a compositional theory based on a probabilistic#N#generalisation of the well known may-testing and must-testing pre- orders.#N#Also, we define an extensional semantics for our calculus, which will be used#N#to define both simulation and deadlock simulation preorders for wireless#N#networks. We prove that our simulation preorder is sound with respect to the#N#may-testing preorder; similarly, the deadlock simulation pre- order is sound#N#with respect to the must-testing preorder, for a large class of networks. We#N#also provide a counterexample showing that completeness of the simulation#N#preorder, with respect to the may testing one, does not hold. We conclude the#N#paper with an application of our theory to probabilistic routing protocols.

Includes members:
  Member "modelling mac layer communications in wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equational reasonings in wireless network gossip protocols")
  Member "a timed calculus for mobile ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a process algebra for wireless mesh networks")

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