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: "bialgebraic semantics for logic programming"
  Abstract: Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic programs as reactive systems and exploit abstract techniques developed in that setting. First we use saturation to model the operational semantics of logic programs as coalgebrae on presheaves. Then, we make explicit the underlying algebraic structure by using bialgebrae on presheaves. The resulting semantics turns out to be compositional with respect to conjunction and term substitution. Also, it encodes a parallel model of computation, whose soundness is guaranteed by a built-in notion of synchronisation between different threads.

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

Connected through hyperedge HE-2 (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"
    - "proof relevant corecursive resolution"
    - "a type theoretic approach to 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-3 (induced by source paper "category theoretic semantics for theorem proving in logic programming embracing the laxness"):
  with members:
    - "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"
    - "an interactive semantics of logic programming"

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)