human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "least and greatest fixed points in linear logic"):
  Abstract: The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the addition of the exponentials (! and ?), we add least and greatest fixed point operators. The resulting logic, which we call muMALL, satisfies two fundamental proof theoretic properties: we establish weak normalization for it, and we design a focused proof system that we prove complete. That second result provides a strong normal form for cut-free proof structures that can be used, for example, to help automate proof search. We show how these foundations can be applied to intuitionistic logic.

Includes members:
  Member "cut elimination for a logic with induction and co induction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a proof theory for model checking an extended abstract")
  Member "least and greatest fixpoints in game semantics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the denotational semantics of linear logic with least and greatest fixed points of formulas")
  Member "induction and co induction in sequent calculus":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "combining deduction modulo and logics of fixed point definitions")
  Member "the bedwyr system for model checking over syntactic expressions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a characterisation of open bisimulation using an intuitionistic modal logic")
  Member "focusing and polarization in intuitionistic logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a sequent calculus proof search procedure and counter model generation based on natural deduction bounds")

Question: Please tell me which class the source paper 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)