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 functions for linear constraint loops"
  Abstract: In this paper we study the complexity of the problems: given a loop, described by linear constraints over a finite set of variables, is there a linear or lexicographical-linear ranking function for this loop? While existence of such functions implies termination, these problems are not equivalent to termination. When the variables range over the rationals (or reals), it is known that both problems are PTIME decidable. However, when they range over the integers, whether for single-path or multipath loops, the complexity has not yet been determined. We show that both problems are coNP-complete. However, we point out some special cases of importance of PTIME complexity. We also present complete algorithms for synthesizing linear and lexicographical-linear ranking functions, both for the general case and the special PTIME cases. Moreover, in the rational setting, our algorithm for synthesizing lexicographical-linear ranking functions extends existing ones, because our class of ranking functions is more general, yet it has polynomial time complexity.

Connected through hyperedge HE-1 (induced by source paper "inferring lower runtime bounds for integer programs"):
  with members:
    - "computing expected runtimes for constant probability programs"
    - "termination of triangular integer loops is decidable"
    - "proving non termination via loop acceleration"
    - "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"
    - "towards automatic resource bound analysis for ocaml"
    - "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 "tight polynomial worst case bounds for loop programs"):
  with members:
    - "polynomial invariants for affine programs"
    - "interval based resource usage verification by translation into horn clauses and an application to energy consumption"
    - "on multiphase linear ranking functions"
    - "flowchart programs regular expressions and decidability of polynomial growth rate"
    - "on decidable growth rate properties of imperative programs"
    - "efficient algorithms for deciding the type of growth of products of integer matrices"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-3 (induced by source paper "termination of linear loops over the integers"):
  with members:
    - "multiphase linear ranking functions and their relation to recurrent sets"
    - "effective divergence analysis for linear recurrence sequences"
    - "on multiphase linear ranking functions"
    - "on termination of integer linear loops"
    - "abstract acceleration of general linear loops"
    - "positivity problems for low order linear recurrence sequences"

Connected through hyperedge HE-4 (induced by source paper "control flow refinement by partial evaluation and its application to termination and cost analysis"):
  with members:
    - "polyvariant program specialisation with property based abstraction"
    - "an iterative approach to precondition inference using constrained horn clauses"
    - "on multiphase linear ranking functions"
    - "t2 temporal property verification"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-5 (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"
    - "ranking templates for linear loops"
    - "non termination analysis of java bytecode"
    - "eventual linear ranking functions"

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

Connected through hyperedge HE-7 (induced by source paper "geometric nontermination arguments"):
  with members:
    - "t2 temporal property verification"
    - "extracting verified decision procedures dpll and resolution"
    - "ranking templates for linear loops"
    - "termination analysis by learning terminating programs"
    - "on termination of integer linear loops"
    - "unrestricted termination and non termination arguments for bit vector programs"

Connected through hyperedge HE-8 (induced by source paper "ranking templates for linear loops"):
  with members:
    - "termination analysis by learning terminating programs"
    - "ranking function synthesis for linear lasso programs"
    - "linear ranking for linear lasso programs"
    - "eventual linear ranking functions"
    - "size change termination monotonicity constraints and ranking functions"

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.PL(Programming Languages)