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: "lazy abstractions for timed automata"
  Abstract: We consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of zones. For efficiency reasons, they are parametrized by the maximal lower and upper bounds (LU-bounds) occurring in the guards of the automaton. We propose an algorithm that is updating LU-bounds during exploration of the search tree. In order to keep them as small as possible, the bounds are refined only when they enable a transition that is impossible in the unabstracted system. So our algorithm can be seen as a kind of lazy CEGAR algorithm for timed automata. We show that on several standard benchmarks, the algorithm is capable of keeping very small LU-bounds, and in consequence reduce the search space substantially.

Connected through hyperedge HE-1 (induced by source paper "fast algorithms for handling diagonal constraints in timed automata"):
  with members:
    - "reachability in timed automata with diagonal constraints"
    - "revisiting timed logics with automata modalities"
    - "symbolic optimal reachability in weighted timed automata"
    - "better abstractions for timed automata"
    - "improving search order for reachability testing in timed automata"

Connected through hyperedge HE-2 (induced by source paper "abstraction refinement algorithms for timed automata"):
  with members:
    - "improving search order for reachability testing in timed automata"
    - "using non convex approximations for efficient analysis of timed automata"

Connected through hyperedge HE-3 (induced by source paper "lazy abstraction based controller synthesis"):
  with members:
    - "lazy abstraction based control for safety specifications"
    - "nonuniform abstractions refinement and controller synthesis with novel bdd encodings"
    - "sparsity aware finite abstraction"
    - "cpachecker a tool for configurable software verification"

Connected through hyperedge HE-4 (induced by source paper "better abstractions for timed automata"):
  with members:
    - "symbolic optimal reachability in weighted timed automata"
    - "using non convex approximations for efficient analysis of timed automata"

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)