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: "a process algebra for wireless mesh networks"
  Abstract: We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery.

Connected through hyperedge HE-1 (induced by source paper "ensuring liveness properties of distributed systems open problems"):
  with members:
    - "progress justness and fairness"
    - "reward testing equivalences for processes"
    - "justness a completeness criterion for capturing liveness properties"
    - "analysing mutual exclusion using process algebra with signals"
    - "lean and full congruence formats for recursion"
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "ccs it s not fair fair schedulers cannot be implemented in ccs like languages even under progress and certain fairness assumptions"
    - "progress fairness and justness in process algebra"

Connected through hyperedge HE-2 (induced by source paper "justness a completeness criterion for capturing liveness properties"):
  with members:
    - "progress justness and fairness"
    - "analysing mutual exclusion using process algebra with signals"
    - "ensuring liveness properties of distributed systems a research agenda"
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "progress fairness and justness in process algebra"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "on characterising distributability"
    - "on synchronous and asynchronous interaction in distributed systems"

Connected through hyperedge HE-3 (induced by source paper "progress justness and fairness"):
  with members:
    - "analysing mutual exclusion using process algebra with signals"
    - "ccs it s not fair fair schedulers cannot be implemented in ccs like languages even under progress and certain fairness assumptions"
    - "progress fairness and justness in process algebra"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "explicit fairness in testing semantics"

Connected through hyperedge HE-4 (induced by source paper "a process algebra for link layer protocols"):
  with members:
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"

Connected through hyperedge HE-5 (induced by source paper "equational reasonings in wireless network gossip protocols"):
  with members:
    - "a probabilistic calculus of cyber physical systems"
    - "modelling mac layer communications in wireless systems"
    - "fixed point characterization of compositionality properties of probabilistic processes combinators"
    - "compositionality of approximate bisimulation for probabilistic systems"
    - "an analytical model of information dissemination for a gossip based protocol"

Connected through hyperedge HE-6 (induced by source paper "ensuring liveness properties of distributed systems a research agenda"):
  with members:
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "automated analysis of aodv using uppaal"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "sequence numbers do not guarantee loop freedom aodv can yield routing loops"
    - "on characterising distributability"
    - "psi calculi a framework for mobile processes with nominal data and logic"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-7 (induced by source paper "an efficient loop free version of adovv2"):
  with members:
    - "modelling and verifying the aodv routing protocol"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "sequence numbers do not guarantee loop freedom aodv can yield routing loops"
    - "a rigorous analysis of aodv and its variants"

Connected through hyperedge HE-8 (induced by source paper "split send reassemble a formal specification of a can bus protocol stack"):
  with members:
    - "modelling and verifying the aodv routing protocol"
    - "mechanizing a process algebra for network protocols"
    - "a mechanized proof of loop freedom of the untimed aodv routing protocol"

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)