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: "on termination of meta programs"
  Abstract: The term {\em meta-programming} refers to the ability of writing programs that have other programs as data and exploit their semantics. #R##N#The aim of this paper is presenting a methodology allowing us to perform a correct termination analysis for a broad class of practical meta-interpreters, including negation and performing different tasks during the execution. It is based on combining the power of general orderings, used in proving termination of term-rewrite systems and programs, and on the well-known acceptability condition, used in proving termination of logic programs. #R##N#The methodology establishes a relationship between the ordering needed to prove termination of the interpreted program and the ordering needed to prove termination of the meta-interpreter together with this interpreted program. If such a relationship is established, termination of one of those implies termination of the other one, i.e., the meta-interpreter preserves termination. #R##N#Among the meta-interpreters that are analysed correctly are a proof trees constructing meta-interpreter, different kinds of tracers and reasoners. #R##N#To appear without appendix in Theory and Practice of Logic Programming.

Connected through hyperedge HE-1 (induced by source paper "using linear constraints for logic program termination analysis"):
  with members:
    - "checking termination of bottom up evaluation of logic programs with function symbols"
    - "well definedness and efficient inference for probabilistic logic programming under the distribution semantics"
    - "non termination analysis of logic programs with integer arithmetics"
    - "disjunctive asp with functions decidable queries and effective computation"
    - "automated termination analysis for logic programs with cut"
    - "automated termination proofs for logic programs by term rewriting"
    - "termination proofs for logic programs with tabling"

Connected through hyperedge HE-2 (induced by source paper "checking termination of bottom up evaluation of logic programs with function symbols"):
  with members:
    - "disjunctive asp with functions decidable queries and effective computation"
    - "automated termination analysis for logic programs with cut"
    - "on chase termination beyond stratification"
    - "automated termination proofs for logic programs by term rewriting"

Connected through hyperedge HE-3 (induced by source paper "automated termination analysis for logic programs with cut"):
  with members:
    - "polytool polynomial interpretations as a basis for termination analysis of logic programs"
    - "automated termination proofs for logic programs by term rewriting"
    - "the witness properties and the semantics of the prolog cut"
    - "efficient groundness analysis in prolog"

Connected through hyperedge HE-4 (induced by source paper "automated termination proofs for logic programs by term rewriting"):
  with members:
    - "cti a constraint based termination inference tool for iso prolog"
    - "more precise yet efficient type inference for logic programs"
    - "inference of termination conditions for numerical loops in prolog"
    - "acceptability with general orderings"

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)