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: "an interactive semantics of logic programming"
  Abstract: We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms that rule the operational machinery of such a programming paradigm. The semantic framework we have chosen for presenting our results is tile logic, which has the advantage of allowing a uniform treatment of goals and observations and of applying abstract categorical tools for proving the results. As main contributions, we mention the finitary presentation of abstract unification, and a concurrent and coordinated abstract semantics consistent with the most common semantics of logic programming. Moreover, the compositionality of the tile semantics is guaranteed by standard results, as it reduces to check that the tile systems associated to logic programs enjoy the tile decomposition property. An extension of the approach for handling constraint systems is also discussed.

Connected through hyperedge HE-1 (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-2 (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"
    - "coalgebraic logic programming from semantics to implementation"

Connected through hyperedge HE-3 (induced by source paper "bialgebraic semantics for logic programming"):
  with members:
    - "connector algebras for c e and p t nets interactions"
    - "coalgebraic logic programming from semantics to implementation"
    - "relating coalgebraic notions of bisimulation"

Connected through hyperedge HE-4 (induced by source paper "coalgebraic logic programming from semantics to implementation"):
  with members:
    - "exploiting parallelism in coalgebraic logic programming"
    - "inductive and coinductive components of corecursive functions in coq"
    - "logic programming functional programming and inductive definitions"

Connected through hyperedge HE-5 (induced by source paper "exploiting parallelism in coalgebraic logic programming"):
  with members:
    - "coalgebraic logic programming from semantics to implementation"

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.LO(Logic in Computer Science)