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: "eventual linear ranking functions"
  Abstract: Program termination is a hot research topic in program analysis. The last few years have witnessed the development of termination analyzers for programming languages such as C and Java with remarkable precision and performance. These systems are largely based on techniques and tools coming from the field of declarative constraint programming. In this paper, we first recall an algorithm based on Farkas' Lemma for discovering linear ranking functions proving termination of a certain class of loops. Then we propose an extension of this method for showing the existence of eventual linear ranking functions, i.e., linear functions that become ranking functions after a finite unrolling of the loop. We show correctness and completeness of this algorithm.

Connected through hyperedge HE-1 (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"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-2 (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"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-3 (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"
    - "ranking functions for linear constraint loops"
    - "size change termination monotonicity constraints and ranking functions"

Connected through hyperedge HE-4 (induced by source paper "ranking functions for linear constraint loops"):
  with members:
    - "ranking function synthesis for linear lasso programs"
    - "deciding conditional termination"
    - "linear ranking for linear lasso programs"
    - "proving termination starting from the end"
    - "monotonicity constraints for termination in the integer domain"
    - "an improved tight closure algorithm for integer octagonal constraints"
    - "the octagon abstract domain"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

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)