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: "ranking templates for linear loops"
  Abstract: We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parametrized, well-founded relations such that an assignment to the parameters gives rise to a ranking function. This approach generalizes existing methods and enables us to use templates for many different ranking functions with affine-linear components. We discuss templates for multiphase, piecewise, and lexicographic ranking functions. Because these ranking templates require both strict and non-strict inequalities, we use Motzkin’s Transposition Theorem instead of Farkas Lemma to transform the generated ∃ ∀-constraint into an ∃-constraint.

Connected through hyperedge HE-1 (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"
    - "mixed integer quadratic programming is in np"
    - "on termination of integer linear loops"
    - "deciding conditional termination"

Connected through hyperedge HE-2 (induced by source paper "multiphase linear ranking functions and their relation to recurrent sets"):
  with members:
    - "on multiphase linear ranking functions"
    - "geometric nontermination arguments"
    - "extracting verified decision procedures dpll and resolution"
    - "non termination analysis of java bytecode"
    - "eventual linear ranking functions"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-3 (induced by source paper "on multiphase linear ranking functions"):
  with members:
    - "extracting verified decision procedures dpll and resolution"
    - "proving termination starting from the end"
    - "eventual linear ranking functions"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-4 (induced by source paper "geometric nontermination arguments"):
  with members:
    - "t2 temporal property verification"
    - "extracting verified decision procedures dpll and resolution"
    - "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-5 (induced by source paper "complexity of bradley manna sipma lexicographic ranking functions"):
  with members:
    - "ranking functions for linear constraint loops"
    - "monotonicity constraints for termination in the integer domain"

Connected through hyperedge HE-6 (induced by source paper "using program synthesis for program analysis"):
  with members:
    - "unrestricted termination and non termination arguments for bit vector programs"

Connected through hyperedge HE-7 (induced by source paper "termination analysis by learning terminating programs"):
  with members:
    - "state of buchi complementation"
    - "linear ranking for linear lasso programs"
    - "proving termination starting from the end"
    - "buchi complementation and size change termination"
    - "size change termination monotonicity constraints and ranking functions"

Connected through hyperedge HE-8 (induced by source paper "unrestricted termination and non termination arguments for bit vector programs"):
  with members:
    - "second order propositional satisfiability"
    - "linear ranking for linear lasso programs"
    - "ranking functions for linear constraint loops"
    - "size change termination monotonicity constraints and ranking functions"
    - "a general framework for automatic termination analysis of logic programs"

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)