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: "deciding conditional termination"
  Abstract: We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exists, as the greatest fixpoint of the function that maps a set of states into its pre-image with respect to the transition relation. This definition allows to compute the weakest non-termination precondition if at least one of the following holds: (i) the transition relation is deterministic, (ii) the descending Kleene sequence over-approximating the greatest fixpoint converges in finitely many steps, or (iii) the transition relation is well founded. We show that this is the case for two classes of relations, namely octagonal and finite monoid affine relations. Moreover, since the closed forms of these relations can be defined in Presburger arithmetic, we obtain the decidability of the termination problem for such loops. We show that the weakest non-termination precondition for octagonal relations can be computed in time polynomial in the size of the binary representation of the relation. Furthermore, for every well-founded octagonal relation, we prove the existence of an effectively computable well-founded witness relation for which a linear ranking function exists. For the class of linear affine relations we show that the weakest non-termination precondition can be defined in Presburger arithmetic if the relation has the finite monoid property. Otherwise, for a more general subclass, called polynomially bounded affine relations, we give a method of under-approximating the termination preconditions. Finally, we apply the method of computing weakest non-termination preconditions for conjunctive relations (octagonal or affine) to computing termination preconditions for programs with complex transition relations. We provide algorithms for computing transition invariants and termination preconditions, and define a class of programs, whose control structure has no nested loops, for which these algorithms provide precise results. Moreover, it is shown that, for programs with no nested control loops, and whose loops are labeled with octagonal constraints, the dual problem i. e. the existence of infinite runs, is NP-complete.

Connected through hyperedge HE-1 (induced by source paper "a calculus for modular loop acceleration"):
  with members:
    - "on the decidability of termination for polynomial loops"
    - "proving non termination via loop acceleration"
    - "inferring lower runtime bounds for integer programs"
    - "underapproximation of procedure summaries for integer programs"
    - "on termination of integer linear loops"
    - "abstract acceleration of general linear loops"
    - "abstracting path conditions"
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

Connected through hyperedge HE-2 (induced by source paper "on the decidability of termination for polynomial loops"):
  with members:
    - "termination of triangular integer loops is decidable"
    - "proving non termination via loop acceleration"
    - "termination of linear loops over the integers"
    - "on multiphase linear ranking functions"
    - "geometric nontermination arguments"
    - "ranking templates for linear loops"
    - "mixed integer quadratic programming is in np"
    - "on termination of integer linear loops"

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

Connected through hyperedge HE-4 (induced by source paper "how hard is it to verify flat affine counter systems with the finite monoid property"):
  with members:
    - "reachability in two dimensional vector addition systems with states is pspace complete"
    - "a concurrent pattern calculus"
    - "subclasses of presburger arithmetic and the weak exp hierarchy"
    - "on the complexity of verifying regular properties on flat counter systems"
    - "invariant generation through strategy iteration in succinctly represented control flow graphs"
    - "taming past ltl and flat counter systems"

Connected through hyperedge HE-5 (induced by source paper "the hardness of finding linear ranking functions for lasso programs"):
  with members:
    - "linear ranking for linear lasso programs"
    - "positivity problems for low order linear recurrence sequences"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-6 (induced by source paper "generating asymptotically non terminating initial values for linear programs"):
  with members:
    - "on termination of integer linear loops"
    - "proving termination starting from the end"

Connected through hyperedge HE-7 (induced by source paper "on the termination of linear and affine programs over the integers"):
  with members:
    - "on termination of integer linear loops"
    - "proving termination starting from the end"

Connected through hyperedge HE-8 (induced by source paper "a second order formulation of non termination"):
  with members:
    - "monotonicity constraints for termination in the integer domain"

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)