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: "t2 temporal property verification"
  Abstract: We present the open-source tool T2, the first public release from the TERMINATOR project. T2 has been extended over the past decade to support automatic temporal-logic proving techniques and to handle a general class of user-provided liveness and safety properties. Input can be provided in a native format and in C, via the support of the LLVM compiler framework. We briefly discuss T2's architecture, its underlying techniques, and conclude with an experimental illustration of its competitiveness and directions for future extensions.

Connected through hyperedge HE-1 (induced by source paper "control flow refinement by partial evaluation and its application to termination and cost analysis"):
  with members:
    - "polyvariant program specialisation with property based abstraction"
    - "an iterative approach to precondition inference using constrained horn clauses"
    - "on multiphase linear ranking functions"
    - "ranking functions for linear constraint loops"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-2 (induced by source paper "proving non termination via loop acceleration"):
  with members:
    - "multiphase linear ranking functions and their relation to recurrent sets"
    - "geometric nontermination arguments"
    - "abstract acceleration of general linear loops"
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

Connected through hyperedge HE-3 (induced by source paper "termination of triangular integer loops is decidable"):
  with members:
    - "on termination of integer linear loops"
    - "deciding conditional termination"

Connected through hyperedge HE-4 (induced by source paper "translating xd c programs to msvl programs"):
  with members:
    - "software model checking via large block encoding"
    - "mechanized semantics for the clight subset of the c language"
    - "cpachecker a tool for configurable software verification"

Connected through hyperedge HE-5 (induced by source paper "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"):
  with members:
    - "termination of nondeterministic recursive probabilistic programs"
    - "a new rule for almost certain termination of probabilistic and demonic programs"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "proving differential privacy via probabilistic couplings"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "synthesizing probabilistic invariants via doob s decomposition"
    - "reasoning about recursive probabilistic programs"
    - "complexity of bradley manna sipma lexicographic ranking functions"

Connected through hyperedge HE-6 (induced by source paper "geometric nontermination arguments"):
  with members:
    - "extracting verified decision procedures dpll and resolution"
    - "ranking templates for linear loops"
    - "termination analysis by learning terminating programs"
    - "on termination of integer linear loops"
    - "unrestricted termination and non termination arguments for bit vector programs"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-7 (induced by source paper "verifying procedural programs via constrained rewriting induction"):
  with members:
    - "quasi reductivity of logically constrained term rewriting systems"
    - "termination of lctrss"
    - "software verification and graph similarity for automated evaluation of students assignments"
    - "software model checking via large block encoding"
    - "automated induction for complex data structures"
    - "verification of java bytecode using analysis and transformation of logic programs"
    - "removing redundant arguments automatically"
    - "a divergence critic for inductive proof"

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)