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: "coalgebraic logic programming from semantics to implementation"
  Abstract: Coinductive definitions, such as that of an infinite stream, may often be described by elegant logic programs, but ones for which SLD-refutation is of no value as SLD-derivations fall into infinite loops. Such definitions give rise to questions of lazy corecursive derivations and parallelism, as execution of such logic programs can have both recursive and corecursive features at once. Observational and coalgebraic semantics have been used to study them abstractly. The programming developments have often occurred separately and have usually been implementation-led. Here, we give a coherent semantics-led account of the issues, starting with abstract category theoretic semantics, developing coalgebra to characterise naturally arising trees, and proceeding towards implementation of a new dialect, CoALP, of logic programming, characterised by guarded lazy corecursion and parallelism.

Connected through hyperedge HE-1 (induced by source paper "structural resolution for abstract compilation of object oriented languages"):
  with members:
    - "productive corecursion in logic programming"
    - "a productivity checker for logic programming"
    - "operational semantics of resolution and productivity in horn clause logic"
    - "proof relevant corecursive resolution"
    - "structural resolution for logic programming"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"

Connected through hyperedge HE-2 (induced by source paper "productive corecursion in logic programming"):
  with members:
    - "a productivity checker for logic programming"
    - "operational semantics of resolution and productivity in horn clause logic"
    - "proof relevant corecursive resolution"
    - "structural resolution for logic programming"
    - "a dynamic approach to characterizing termination of general logic programs"

Connected through hyperedge HE-3 (induced by source paper "universal constructions for co relations categories monoidal categories and props"):
  with members:
    - "custom hypergraph categories via generalized relations"
    - "a universal construction for co relations"
    - "bialgebraic semantics for logic programming"
    - "relating coalgebraic notions of bisimulation"

Connected through hyperedge HE-4 (induced by source paper "structural resolution with co inductive loop detection"):
  with members:
    - "a productivity checker for logic programming"
    - "structural resolution for logic programming"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"

Connected through hyperedge HE-5 (induced by source paper "logic programming laxness and saturation"):
  with members:
    - "productive corecursion in logic programming"
    - "a productivity checker for logic programming"
    - "operational semantics of resolution and productivity in horn clause logic"
    - "category theoretic semantics for theorem proving in logic programming embracing the laxness"
    - "bialgebraic semantics for logic programming"
    - "proof relevant corecursive resolution"
    - "a type theoretic approach to resolution"
    - "structural resolution for logic programming"

Connected through hyperedge HE-6 (induced by source paper "category theoretic semantics for theorem proving in logic programming embracing the laxness"):
  with members:
    - "bialgebraic semantics for logic programming"
    - "proof relevant corecursive resolution"
    - "a type theoretic approach to resolution"
    - "structural resolution for logic programming"
    - "exploiting parallelism in coalgebraic logic programming"
    - "an interactive semantics of logic programming"

Connected through hyperedge HE-7 (induced by source paper "a productivity checker for logic programming"):
  with members:
    - "productive corecursion in logic programming"
    - "operational semantics of resolution and productivity in horn clause logic"
    - "structural resolution for logic programming"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"
    - "exploiting parallelism in coalgebraic logic programming"

Connected through hyperedge HE-8 (induced by source paper "operational semantics of resolution and productivity in horn clause logic"):
  with members:
    - "a productivity checker for logic programming"
    - "proof relevant corecursive resolution"
    - "structural resolution for logic programming"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"

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)