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: "on the system cl12 of computability logic"
  Abstract: Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a#N#long-term project for redeveloping logic on the basis of a constructive game#N#semantics, with games seen as abstract models of interactive computational#N#problems. Among the fragments of this logic successfully axiomatized so far is#N#CL12 --- a conservative extension of classical first-order logic, whose#N#language augments that of classical logic with the so called choice sorts of#N#quantifiers and connectives. This system has already found fruitful#N#applications as a logical basis for constructive and complexity-oriented#N#versions of Peano arithmetic, such as arithmetics for polynomial time#N#computability, polynomial space computability, and beyond. The present paper#N#introduces a third, indispensable complexity measure for interactive#N#computations termed amplitude complexity, and establishes the adequacy of CL12#N#with respect to A-amplitude, S-space and T-time computability under certain#N#minimal conditions on the triples (A,S,T) of function classes. This result very#N#substantially broadens the potential application areas of CL12. The paper is#N#self-contained, and targets readers with no prior familiarity with the subject.

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"
    - "a propositional system induced by japaridze s approach to if logic"
    - "expressing algorithms as concise as possible via computability logic"
    - "a cirquent calculus system with clustering and ranking"

Connected through hyperedge HE-2 (induced by source paper "towards distributed logic programming based on computability logic"):
  with members:
    - "towards applied theories based on computability logic"
    - "propositional computability logic ii"

Connected through hyperedge HE-3 (induced by source paper "build your own clarithmetic i setup and completeness"):
  with members:
    - "build your own clarithmetic ii soundness"
    - "introduction to clarithmetic ii"
    - "the computational complexity of propositional cirquent calculus"
    - "build your own clarithmetic ii"
    - "a propositional system induced by japaridze s approach to if logic"
    - "a cirquent calculus system with clustering and ranking"
    - "the taming of recurrences in computability logic through cirquent calculus part ii"
    - "the parallel versus branching recurrences in computability logic"

Connected through hyperedge HE-4 (induced by source paper "build your own clarithmetic ii soundness"):
  with members:
    - "build your own clarithmetic i setup and completeness"
    - "introduction to clarithmetic ii"

Connected through hyperedge HE-5 (induced by source paper "sequential operations in logicweb"):
  with members:
    - "many concepts and two logics of algorithmic reduction"

Connected through hyperedge HE-6 (induced by source paper "implementing program extraction from cl1 proofs"):
  with members:
    - "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"
    - "in the beginning was game semantics"

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)