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: "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.

Connected through hyperedge HE-1 (induced by source paper "back to futures"):
  with members:
    - "a message passing interpretation of adjoint logic"
    - "circular proofs as session typed processes a local validity condition"
    - "design and implementation of concurrent c0"

Connected through hyperedge HE-2 (induced by source paper "around finite second order coherence spaces"):
  with members:
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "relational semantics of linear logic and higher order model checking"
    - "using models to model check recursive schemes"
    - "a finite semantics of simply typed lambda terms for infinite runs of automata"

Connected through hyperedge HE-3 (induced by source paper "on the denotational semantics of linear logic with least and greatest fixed points of formulas"):
  with members:
    - "full abstraction for probabilistic pcf"
    - "least and greatest fixpoints in game semantics"

Connected through hyperedge HE-4 (induced by source paper "a proof theory for model checking an extended abstract"):
  with members:
    - "cut elimination for a logic with induction and co induction"
    - "the bedwyr system for model checking over syntactic expressions"

Connected through hyperedge HE-5 (induced by source paper "mathematical logic for systems biology invited paper"):
  with members:
    - "a hybrid linear logic for constrained transition systems"
    - "a logical framework for systems biology"

Connected through hyperedge HE-6 (induced by source paper "a framework for proof certificates in finite state exploration"):
  with members:
    - "the bedwyr system for model checking over syntactic expressions"

Connected through hyperedge HE-7 (induced by source paper "a linear logic programming language for concurrent programming over graph structures"):
  with members:
    - "a complete and terminating execution model for constraint handling rules"
    - "linear logic based analysis of constraint handling rules with disjunction"
    - "robust vacuity for branching temporal logic"
    - "graphlab a new framework for parallel machine learning"

Connected through hyperedge HE-8 (induced by source paper "an infinitary model of linear logic"):
  with members:
    - "typing weak msol properties"
    - "using models to model check recursive schemes"

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)