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: "inductive and coinductive components of corecursive functions in coq"
  Abstract: In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive functions. However, many terminating and productive functions do not pass the syntactic tests. Bove proposed in her thesis an elegant reformulation of the method of accessibility predicates that widens the range of terminative recursive functions formalisable in Constructive Type Theory. In this paper, we pursue the same goal for productive corecursive functions. Notably, our method of formalisation of coinductive definitions of productive functions in Coq requires not only the use of ad-hoc predicates, but also a systematic algorithm that separates the inductive and coinductive parts of functions.

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

Connected through hyperedge HE-2 (induced by source paper "a type theoretic approach to resolution"):
  with members:
    - "structural resolution for logic programming"
    - "coalgebraic logic programming from semantics to implementation"

Connected through hyperedge HE-3 (induced by source paper "co recursion in logic programming lazy vs eager"):
  with members:
    - "exploiting parallelism in coalgebraic logic programming"
    - "coalgebraic logic programming from semantics to implementation"

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

Connected through hyperedge HE-5 (induced by source paper "using structural recursion for corecursion"):
  with members:
    - "mechanizing coinduction and corecursion in higher order 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.LO(Logic in Computer Science)