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: "computability logic a formal theory of interaction"
  Abstract: Generalizing the traditional concepts of predicates and their truth to interactive computational problems and their effective solvability, computability logic conservatively extends classical logic to a formal theory that provides a systematic answer to the question of what and how can be computed, just as traditional logic is a systematic tool for telling what is true. The present chapter contains a comprehensive yet relatively compact overview of this very recently introduced framework and research program. It is written in a semitutorial style with general computer science, logic and mathematics audiences in mind.

Connected through hyperedge HE-1 (induced by source paper "fundamentals of computability logic"):
  with members:
    - "build your own clarithmetic ii soundness"
    - "build your own clarithmetic i setup and completeness"
    - "elementary base cirquent calculus i parallel and choice connectives"
    - "introduction to clarithmetic ii"
    - "the computational complexity of propositional cirquent calculus"
    - "on the system cl12 of computability logic"
    - "a propositional system induced by japaridze s approach to if logic"
    - "expressing algorithms as concise as possible via computability logic"

Connected through hyperedge HE-2 (induced by source paper "extending and automating basic probability theory with propositional computability logic"):
  with members:
    - "towards applied theories based on computability logic"
    - "in the beginning was game semantics"
    - "propositional computability logic ii"

Connected through hyperedge HE-3 (induced by source paper "introduction to clarithmetic ii"):
  with members:
    - "games and full completeness for multiplicative linear logic"
    - "a logical basis for constructive systems"
    - "toggling operators in computability logic"
    - "towards applied theories based on computability logic"
    - "many concepts and two logics of algorithmic reduction"
    - "in the beginning was game semantics"
    - "sequential operators in computability logic"
    - "cirquent calculus deepened"

Connected through hyperedge HE-4 (induced by source paper "on the system cl12 of computability logic"):
  with members:
    - "introduction to clarithmetic ii"
    - "the computational complexity of propositional cirquent calculus"
    - "a propositional system induced by japaridze s approach to if logic"
    - "the taming of recurrences in computability logic through cirquent calculus part ii"
    - "the parallel versus branching recurrences in computability logic"
    - "games and full completeness for multiplicative linear logic"
    - "separating the basic logics of the basic recurrences"
    - "a new face of the branching recurrence of computability logic"

Connected through hyperedge HE-5 (induced by source paper "implementing program extraction from cl1 proofs"):
  with members:
    - "on the system cl12 of computability logic"
    - "the taming of recurrences in computability logic through cirquent calculus part ii"
    - "the parallel versus branching recurrences in computability logic"
    - "the countable versus uncountable branching recurrences in computability logic"
    - "soundness and completeness of the cirquent calculus system cl6 for computability logic"
    - "toggling operators in computability logic"
    - "towards applied theories based on computability logic"
    - "many concepts and two logics of algorithmic reduction"

Connected through hyperedge HE-6 (induced by source paper "a logical basis for constructive systems"):
  with members:
    - "games and full completeness for multiplicative linear logic"
    - "toggling operators in computability logic"
    - "towards applied theories based on computability logic"
    - "many concepts and two logics of algorithmic reduction"
    - "in the beginning was game semantics"
    - "sequential operators in computability logic"
    - "cirquent calculus deepened"
    - "the logic of interactive turing reduction"

Connected through hyperedge HE-7 (induced by source paper "separating the basic logics of the basic recurrences"):
  with members:
    - "toggling operators in computability logic"
    - "towards applied theories based on computability logic"
    - "many concepts and two logics of algorithmic reduction"
    - "in the beginning was game semantics"
    - "sequential operators in computability logic"
    - "cirquent calculus deepened"
    - "the logic of interactive turing reduction"
    - "the intuitionistic fragment of computability logic at the propositional level"

Connected through hyperedge HE-8 (induced by source paper "from formulas to cirquents in computability logic"):
  with members:
    - "introduction to clarithmetic ii"
    - "games and full completeness for multiplicative linear logic"
    - "a logical basis for constructive systems"
    - "toggling operators in computability logic"
    - "towards applied theories based on computability logic"
    - "many concepts and two logics of algorithmic reduction"
    - "in the beginning was game semantics"
    - "sequential operators in computability 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)