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

Includes members:
  Member "introduction to clarithmetic ii":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamentals of computability logic")
  Member "the computational complexity of propositional cirquent calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamentals of computability logic")
  Member "a propositional system induced by japaridze s approach to if logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamentals of computability logic")
  Member "the taming of recurrences in computability logic through cirquent calculus part ii":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamentals of computability logic")
  Member "the parallel versus branching recurrences in computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamentals of computability logic")
  Member "games and full completeness for multiplicative linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interaction laws of monads and comonads")
  Member "separating the basic logics of the basic recurrences":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamentals of computability logic")
  Member "a new face of the branching recurrence of computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamentals of computability logic")

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)