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: "proving liveness of parameterized programs"
  Abstract: Correctness of multi-threaded programs typically requires that they satisfy liveness properties. For example, a program may require that no thread is starved of a shared resource, or that all threads eventually agree on a single value. This paper presents a method for proving that such liveness properties hold. Two particular challenges addressed in this work are that (1) the correctness argument may rely on global behaviour of the system (e.g., the correctness argument may require that all threads collectively progress towards "the good thing" rather than one thread progressing while the others do not interfere), and (2) such programs are often designed to be executed by any number of threads, and the desired liveness properties must hold regardless of the number of threads that are active in the program.

Connected through hyperedge HE-1 (induced by source paper "verification and synthesis of symmetric uni rings for leads to properties"):
  with members:
    - "synthesizing imperative programs from examples guided by static analysis"
    - "automatic completion of distributed protocols with symmetry"
    - "specification based synthesis of distributed self stabilizing protocols"
    - "synthesis of a simple self stabilizing system"
    - "synchronous counting and computational algorithm design"
    - "generalization strategies for the verification of infinite state systems"

Connected through hyperedge HE-2 (induced by source paper "parity to safety in polynomial time for pushdown and collapsible pushdown systems"):
  with members:
    - "the complexity of games on higher order pushdown automata"

Connected through hyperedge HE-3 (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"
    - "verifying safety properties with the tla proof system"

Connected through hyperedge HE-4 (induced by source paper "domains for higher order games"):
  with members:
    - "summaries for context free games"
    - "using models to model check recursive schemes"

Connected through hyperedge HE-5 (induced by source paper "liveness verification and synthesis new algorithms for recursive programs"):
  with members:
    - "summaries for context free games"

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)