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: "minimum model semantics for extensional higher order logic programming with negation"
  Abstract: Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic programming. In this paper we consider the semantics of negation in the context of the new paradigm. Using some recent results from non-monotonic fixed-point theory, we demonstrate that every higher-order logic program with negation has a unique  minimum  infinite-valued model. In this way we obtain the first purely model-theoretic semantics for negation in extensional higher-order logic programming. Using our approach, we resolve an old paradox that was introduced by W. W. Wadge in order to demonstrate the semantic difficulties of higher-order logic programming.

Connected through hyperedge HE-1 (induced by source paper "approximation fixpoint theory and the well founded semantics of higher order logic programs"):
  with members:
    - "extensional semantics for higher order logic programs with negation"
    - "an analysis of the equational properties of the well founded fixed point"
    - "equivalence of two fixed point semantics for definitional higher order logic programs"
    - "a fixed point theorem for non monotonic functions"
    - "extensional higher order logic programming"

Connected through hyperedge HE-2 (induced by source paper "extensional semantics for higher order logic programs with negation"):
  with members:
    - "an analysis of the equational properties of the well founded fixed point"
    - "equivalence of two fixed point semantics for definitional higher order logic programs"
    - "extensional higher order logic programming"
    - "minimum model semantics for logic programs with negation as failure"

Connected through hyperedge HE-3 (induced by source paper "an analysis of the equational properties of the well founded fixed point"):
  with members:
    - "a representation theorem for stratified complete lattices"
    - "a fixed point theorem for non monotonic functions"
    - "modularity aspects of disjunctive stable models"
    - "splitting an operator algebraic modularity results for logics with fixpoint semantics"
    - "minimum model semantics for logic programs with negation as failure"

Connected through hyperedge HE-4 (induced by source paper "a representation theorem for stratified complete lattices"):
  with members:
    - "a fixed point theorem for non monotonic functions"
    - "minimum model semantics for logic programs with negation as failure"

Connected through hyperedge HE-5 (induced by source paper "equivalence of two fixed point semantics for definitional higher order logic programs"):
  with members:
    - "extensional higher order logic programming"

Connected through hyperedge HE-6 (induced by source paper "a fixed point theorem for non monotonic functions"):
  with members:
    - "extensional higher order logic programming"
    - "splitting an operator algebraic modularity results for logics with fixpoint semantics"
    - "minimum model semantics for logic programs with negation as failure"

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)