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: "a logical framework for systems biology"
  Abstract: We propose a novel approach for the formal verification of biological systems based on the use of a modal linear logic. We show how such a logic can be used, with worlds as instants of time, as an unified framework to encode both biological systems and temporal properties of their dynamic behaviour. To illustrate our methodology, we consider a model of the P53/Mdm2 DNA-damage repair mechanism. We prove several properties that are important for such a model to satisfy and serve to illustrate the promise of our approach. We formalize the proofs of these properties in the Coq Proof Assistant, with the help of a Lambda Prolog prover for partial automation of the proofs.

Connected through hyperedge HE-1 (induced by source paper "hybrid and subexponential linear logics technical report"):
  with members:
    - "a hybrid linear logic for constrained transition systems"
    - "a proof theoretic study of soft concurrent constraint programming"
    - "classical and intuitionistic subexponential logics are equally expressive"

Connected through hyperedge HE-2 (induced by source paper "a hybrid linear logic for constrained transition systems"):
  with members:
    - "a hybrid linear logic for constrained transition systems with applications to molecular biology"
    - "a framework for specifying prototyping and reasoning about computational systems"
    - "the bedwyr system for model checking over syntactic expressions"

Connected through hyperedge HE-3 (induced by source paper "slicing concurrent constraint programs"):
  with members:
    - "abstract interpretation of temporal concurrent constraint programs"
    - "abstract diagnosis for timed concurrent constraint programs"

Connected through hyperedge HE-4 (induced by source paper "mathematical logic for systems biology invited paper"):
  with members:
    - "a hybrid linear logic for constrained transition systems"
    - "least and greatest fixed points in linear 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)