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: "context bounded analysis for concurrent programs with dynamic creation of threads"
  Abstract: Context-bounded analysis has been shown to be both efficient and effective at#N#finding bugs in concurrent programs. According to its original definition,#N#context-bounded analysis explores all behaviors of a concurrent program up to#N#some fixed number of context switches between threads. This definition is#N#inadequate for programs that create threads dynamically because bounding the#N#number of context switches in a computation also bounds the number of threads#N#involved in the computation. In this paper, we propose a more general#N#definition of context-bounded analysis useful for programs with dynamic thread#N#creation. The idea is to bound the number of context switches for each thread#N#instead of bounding the number of switches of all threads. We consider several#N#variants based on this new definition, and we establish decidability and#N#complexity results for the analysis induced by them.

Connected through hyperedge HE-1 (induced by source paper "fine grained complexity of safety verification"):
  with members:
    - "slightly superexponential parameterized problems"
    - "effect summaries for thread modular analysis"
    - "on problems as hard as cnf sat"
    - "on parametrized verification of asynchronous shared memory pushdown systems"
    - "model checking parameterized asynchronous shared memory systems"
    - "parameterized verification of asynchronous shared memory systems"
    - "kernelization lower bounds by cross composition"
    - "parameterised pushdown systems with non atomic writes"

Connected through hyperedge HE-2 (induced by source paper "history register automata"):
  with members:
    - "automata theory in nominal sets"
    - "weak and nested class memory automata"
    - "ordered navigation on multi attributed data words"
    - "ackermannian and primitive recursive bounds with dickson s lemma"

Connected through hyperedge HE-3 (induced by source paper "on parametrized verification of asynchronous shared memory pushdown systems"):
  with members:
    - "reachability in networks of register protocols under stochastic schedulers"
    - "model checking parameterized asynchronous shared memory systems"
    - "sequentializing parameterized programs"
    - "parameterised pushdown systems with non atomic writes"

Connected through hyperedge HE-4 (induced by source paper "decidable models of integer manipulating programs with recursive parallelism technical report"):
  with members:
    - "senescent ground tree rewrite systems"
    - "approximating petri net reachability along context free traces"

Connected through hyperedge HE-5 (induced by source paper "a theory of formal synthesis via inductive learning"):
  with members:
    - "are there good mistakes a theoretical analysis of cegis"
    - "sciduction combining induction deduction and structure for verification and synthesis"

Connected through hyperedge HE-6 (induced by source paper "senescent ground tree rewrite systems"):
  with members:
    - "complexity hierarchies beyond elementary"
    - "subclasses of presburger arithmetic and the weak exp hierarchy"

Connected through hyperedge HE-7 (induced by source paper "reachability problem for weak multi pushdown automata"):
  with members:
    - "reachability under contextual locking"
    - "partially commutative context free languages"

Connected through hyperedge HE-8 (induced by source paper "model checking branching time properties of multi pushdown systems is hard"):
  with members:
    - "reachability analysis of communicating pushdown systems"
    - "the complexity of games on higher order pushdown 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)