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: "verifying safety properties with the tla proof system"
  Abstract: TLAPS, the TLA+ proof system, is a platform for the development and mechanical verification of TLA+ proofs. The TLA+ proof language is declarative, and understanding proofs requires little background beyond elementary mathematics. The language supports hierarchical and non-linear proof construction and verification, and it is independent of any verification tool or strategy. Proofs are written in the same language as specifications; engineers do not have to translate their high-level designs into the language of a particular verification tool. A proof manager interprets a TLA+ proof as a collection of proof obligations to be verified, which it sends to backend verifiers that include theorem provers, proof assistants, SMT solvers, and decision procedures.#R##N##R##N#The first public release of TLAPS is available from [1], distributed with a BSD-like license. It handles almost all the non-temporal part of TLA+ as well as the temporal reasoning needed to prove standard safety properties, in particular invariance and step simulation, but not liveness properties. Intuitively, a safety property asserts what is permitted to happen; a liveness property asserts what must happen; for a more formal overview, see [3,10].

Connected through hyperedge HE-1 (induced by source paper "a short counterexample property for safety and liveness verification of fault tolerant distributed algorithms"):
  with members:
    - "counting constraints in flat array fragments"
    - "proving liveness of parameterized programs"

Connected through hyperedge HE-2 (induced by source paper "mechanizing a process algebra for network protocols"):
  with members:
    - "a process algebra for wireless mesh networks"
    - "showing invariance compositionally for a process algebra for network protocols"
    - "a mechanized proof of loop freedom of the untimed aodv routing protocol"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "isabelle jedit a prover ide within the pide framework"

Connected through hyperedge HE-3 (induced by source paper "showing invariance compositionally for a process algebra for network protocols"):
  with members:
    - "a mechanized proof of loop freedom of the untimed aodv routing protocol"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "isabelle jedit a prover ide within the pide framework"

Connected through hyperedge HE-4 (induced by source paper "a mechanized proof of loop freedom of the untimed aodv routing protocol"):
  with members:
    - "showing invariance compositionally for a process algebra for network protocols"
    - "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"

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)