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: "proof relevant corecursive resolution"
  Abstract: Resolution lies at the foundation of both logic programming and type class context reduction in functional languages. Terminating derivations by resolution have well-defined inductive meaning, whereas some non-terminating derivations can be understood coinductively. Cycle detection is a popular method to capture a small subset of such derivations. We show that in fact cycle detection is a restricted form of coinductive proof, in which the atomic formula forming the cycle plays the role of coinductive hypothesis. #R##N#This paper introduces a heuristic method for obtaining richer coinductive hypotheses in the form of Horn formulas. Our approach subsumes cycle detection and gives coinductive meaning to a larger class of derivations. For this purpose we extend resolution with Horn formula resolvents and corecursive evidence generation. We illustrate our method on non-terminating type class resolution problems.

Connected through hyperedge HE-1 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses"):
  with members:
    - "coinductive uniform proofs"
    - "towards coinductive theory exploration in horn clause logic position paper"
    - "breaking the loop recursive proofs for coinductive predicates in fibrations"
    - "productive corecursion in logic programming"
    - "guarded dependent type theory with coinductive types"
    - "refinement type inference via horn constraint optimization"
    - "sequent calculus in the topos of trees"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-2 (induced by source paper "coinductive uniform proofs"):
  with members:
    - "productive corecursion in logic programming"
    - "type theory based on dependent inductive and coinductive types"
    - "refinement type inference via horn constraint optimization"
    - "combining deduction modulo and logics of fixed point definitions"
    - "inductive and coinductive components of corecursive functions in coq"

Connected through hyperedge HE-3 (induced by source paper "proof relevant horn clauses for dependent type inference and term synthesis"):
  with members:
    - "operational semantics of resolution and productivity in horn clause logic"
    - "on equivalence and canonical forms in the lf type theory"

Connected through hyperedge HE-4 (induced by source paper "towards coinductive theory exploration in horn clause logic position paper"):
  with members:
    - "productive corecursion in logic programming"

Connected through hyperedge HE-5 (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"
    - "structural resolution for logic programming"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"
    - "coalgebraic logic programming from semantics to implementation"

Connected through hyperedge HE-6 (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"
    - "structural resolution for logic programming"
    - "coalgebraic logic programming from semantics to implementation"
    - "a dynamic approach to characterizing termination of general logic programs"

Connected through hyperedge HE-7 (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"
    - "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-8 (induced by source paper "category theoretic semantics for theorem proving in logic programming embracing the laxness"):
  with members:
    - "bialgebraic semantics for logic programming"
    - "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)